Skip to content
Related Articles

Related Articles

Tesco Interview Experience | Set 2 (Online Test)

View Discussion
Improve Article
Save Article
  • 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.
    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.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. 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.

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!