Tag Archives: Moonfrog Labs

Moonfrog Labs Interview Experience | Set 4

1. Topological sort. 2. Reverse linked list in pairs. (1->2->3->4 to 2->1->4->3) 3. Print a binary tree in spiral order 4. Reverse an array without using subtract sign ‘-‘ anywhere in your code. 5. One DP problem in a 3*3 matrix which I don’t remember exactly. 6. http://www.geeksforgeeks.org/minimum-number-of-jumps-to-reach-end-of-a-given-array/   If you like GeeksforGeeks and would like… Read More »

Moonfrog Labs Interview Experience | Set 3

Q1. Given a sequence of integers, find the longest increasing subsequence. Example: arr = [1, 2, 5, 3, 7] ans : [1, 2, 5, 7] or [1, 2, 3, 7] arr = [4, 3, 1, 2] ans: [1, 2]. Solution: [1, 2, 3, 3, 4] —————————————————————————————————————————————– Q2. Given a vectors of numbers of fixed length,… Read More »

Moonfrog Labs Interview Experience

Moonfrog Labs Interview Experience Recently I got interviewed at Moonfrog Labs. Here is my interview experience. Round 1(1 hour): The interviewer was very friendly and helping. She started with my introduction and discussed a bit about my current project. Q1. Check whether a graph can be converted to a tree or not. First we have… Read More »