| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Maximum possible difference of two subsets of an array | 3169 |
| 2 | Maximize sum of consecutive differences in a circular array | 2352 |
| 3 | Check if all Rows of a Matrix are Circular Rotations of Each Other | 1903 |
| 4 | Cumulative Frequency of Count of Each Element in an Unsorted Array | 1603 |
| 5 | Golomb sequence | 1474 |
| 6 | Sorting using trivial hash function | 1448 |
| 7 | Breadth First Search (BFS) for a Graph | 1349 |
| 8 | Print all triplets in sorted array that form AP | 1299 |
| 9 | Compute nCr % p | 1264 |
| 10 | Sqrt (or Square Root) Decomposition Technique | 1256 |
| 11 | Mean of range in array | 1119 |
| 12 | Find number of pairs in an array such that their XOR is 0 | 1046 |
| 13 | Array Queries for multiply replacements and product | 972 |
| 14 | Maximum Depth Of Binary Tree | 837 |
