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