| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Maximum Sum Increasing Subsequence | 2864 |
| 2 | Distinct adjacent elements in an array | 2080 |
| 3 | Find Sum of all unique sub-array sum for a given array | 1298 |
| 4 | How to check if two given sets are disjoint? | 1261 |
| 5 | Find missing elements of a range | 1255 |
| 6 | Valid Anagrams | 1225 |
| 7 | Find the Only Repetitive Element Between 1 to N-1 | 1087 |
| 8 | Rearrange an array such that ‘arr[j]’ becomes ‘i’ if ‘arr[i]’ is ‘j’ | 1006 |
| 9 | Print modified array after executing the commands of addition and subtraction | 933 |
