Someone send me link of Greplin challenges. Interesting problems to solve. I have completed the same and got positive feedback from Greplin. Following are the problems in the challenge.

Embedded in this block of text is the password for level 2. The password is the longest substring that is the same in reverse. As an example, if the input was “I like racecars that go fast” the password would be “racecar”.

write code to find the first prime fibonacci number larger than a given minimum. For example, the first prime fibonacci number larger than 10 is 13

you must find all subsets of an array where the largest number is the sum of the remaining numbers. For example, for an input of: (1, 2, 3, 4, 6) the subsets would be 1 + 2 = 3
1 + 3 = 4
2 + 4 = 6
1 + 2 + 3 = 6
Solution and C++ code is posted on my github.
Advertisements