| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Reversing a Queue | 2973 |
| 2 | Text Justification LeetCode Solution | 2466 |
| 3 | Count subarrays with equal number of 1’s and 0’s | 1900 |
| 4 | Minimum Moves to Equal Array Elements Leetcode Solution | 1298 |
| 5 | Even Substring Count | 1264 |
| 6 | Regular Expression Matching Regular Expression Matching LeetCode Solution | 1243 |
| 7 | Distinct adjacent elements in an array | 1195 |
| 8 | Minimum Increment to Make Array Unique Leetcode Solution | 1121 |
| 9 | Queries for counts of array elements with values in given range | 1096 |
| 10 | Size of The Subarray With Maximum Sum | 1022 |
| 11 | Count minimum steps to get the given desired array | 984 |
| 12 | Minimum Characters to be Removed to Make a Binary String Alternate | 957 |
| 13 | Smallest Subarray With all Occurrences of a Most Frequent Element | 908 |
| 14 | Find the minimum distance between two numbers | 722 |
| 15 | Largest subarray with equal number of 0s and 1s | 718 |
| 16 | Binary array after M range toggle operations | 693 |
| 17 | Maximum sum of pairs with specific difference | 629 |
| 18 | Regular Expression Matching | 598 |
| 19 | Binary Tree to Binary Search Tree Conversion using STL set | 479 |
