GeeksforGeeks Experience · Aug 2025

Moonfrog Labs Interview Experience | Set 4

Interview Experience

  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 order4. Reverse an array without using subtract sign '-' anywhere...

Full Details

  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. . org/minimum-number-of-jumps- to-reach-end-of-a-given-array/ Related Practice Problems Reverse an Array Minimum number of jumps
Free preview. Unlock all questions →

Topics

Arrays Linked List Trees Graphs Dynamic Programming