Tesco Interview Experience | Set 2 (Online Test)

Last Updated : 23 Jul, 2025
  1. Perfect sums is the sum of two or more number of elements of arrays whose sum is equal to a given number. Return 999 if not found. Examples: 
    Input : arr[] = {2, 3, 5, 6, 8, 10}
input = 10;
Output : 2
5+2+3 = 10
2+8 = 10
So, the output is 2;
    Perfect Sum Problem (Print all subsets with given sum)
  2. Problem was related to find subsequence within another sequence. this problem already exists on geeks for geeks.
Comment
Article Tags:
Interview Experiences
Experiences
Tesco

Explore