| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Check if all Rows of a Matrix are Circular Rotations of Each Other | 1291 |
| 2 | Maximum possible difference of two subsets of an array | 1142 |
| 3 | Cumulative Frequency of Count of Each Element in an Unsorted Array | 1056 |
| 4 | Sorting using trivial hash function | 944 |
| 5 | Golomb sequence | 898 |
| 6 | Maximize sum of consecutive differences in a circular array | 823 |
| 7 | Breadth First Search (BFS) for a Graph | 806 |
| 8 | Compute nCr % p | 779 |
| 9 | Print all triplets in sorted array that form AP | 773 |
| 10 | Sqrt (or Square Root) Decomposition Technique | 728 |
| 11 | Mean of range in array | 675 |
| 12 | Find number of pairs in an array such that their XOR is 0 | 616 |
| 13 | Array Queries for multiply replacements and product | 569 |
| 14 | Maximum Depth Of Binary Tree | 557 |
