Skip to content
Related Articles
Get the best out of our app
GeeksforGeeks App
Open App

Related Articles

Moonfrog Labs Interview Questions

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

Round 1: 
1> given a number, and an encoding technique like 1-> A, 2-> B…. 26->Z, How may different valid encryption can be done. Like 123 can be decoded as ABC or LC or AW. so the count is 3 

2> given an array of -1, 0, 1 in an unsorted matter. sort it in order of n time complexity 

3> How to get the top 10 occurring words from a file which is dynamically changing 

Round 2: 
1> traverse a tree in spiral order. 

2> traverse a tree in spiral order using a stack and a queue 

3> given a string in form of a linked link. check if it is palindrome or not . 

Round 3: 
1> Given an array which contains value in range 0 to N^2. sort it in order of N time complexity. 

2> Find the largest monotonically increasing subsequence. 

3> Given a binary tree, check if it is a binary search tree or not. 

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

My Personal Notes arrow_drop_up
Last Updated : 04 May, 2022
Like Article
Save Article
Similar Reads