S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
1 | Palindrome using Recursion | 10987 |
2 | Move all negative elements to one side of array | 10145 |
3 | Print the Fibonacci numbers in reverse order | 6706 |
4 | Sum of numbers in String | 4553 |
5 | Total Numbers With no Repeated Digits in a Range | 4405 |
6 | Reverse a Number Using Stack | 4194 |
7 | Rabin Karp Algorithm | 3921 |
8 | OSI Model | 3593 |
9 | KMP Algorithm | 3440 |
10 | Palindrome Number | 3193 |
11 | Most Frequent Element in an Array | 2871 |
12 | Implement a stack using single queue | 2689 |
13 | Find all Common Elements in Given Three Sorted Arrays | 2587 |
14 | Reverse words in a string | 2574 |
15 | Iterative Tower of Hanoi | 2507 |
16 | Find the First and Second Smallest Elements | 2506 |
17 | Implement Stack and Queue using Deque | 2425 |
18 | Mobile Numeric Keypad Problem | 2349 |
19 | Sorting a Queue without Extra Space | 2307 |
20 | Delete a Node from linked list without head pointer | 2290 |
21 | Find duplicates in a given array when elements are not limited to a range | 2225 |
22 | Maximum Consecutive Numbers Present in an Array | 2156 |
23 | Priority Queue using doubly linked list | 2070 |
24 | The Stock Span Problem | 2033 |
25 | Convert String To Int | 1973 |
26 | Recursion | 1928 |
27 | Tower Of Hanoi | 1896 |
28 | Sieve of Eratosthenes | 1896 |
29 | Fibonacci numbers | 1854 |
30 | Dynamic Programming Basics | 1849 |