Skip to content
Related Articles

Related Articles

Improve Article

Tesco Interview Experience | Set 2 (Online Test)

  • Difficulty Level : Hard
  • Last Updated : 27 Oct, 2017
  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.
    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.

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, AmazonGoogle and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :