| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Remove Minimum Characters so that Two Strings Become Anagrams | 1776 |
| 2 | Check if all Rows of a Matrix are Circular Rotations of Each Other | 1304 |
| 3 | Maximum possible difference of two subsets of an array | 1186 |
| 4 | Given an Array of Pairs Find all Symmetric Pairs in it | 1160 |
| 5 | Check if a given array contains duplicate elements within k distance from each other | 1103 |
| 6 | Subarrays with distinct elements | 1087 |
| 7 | Sort a String According to Another String | 1062 |
| 8 | Count Substrings with equal number of 0s, 1s and 2s | 1005 |
| 9 | Find all pairs (a, b) in an array such that a % b = k | 953 |
| 10 | Print all subarrays with 0 sum | 950 |
| 11 | Insertion in a Binary Tree | 869 |
| 12 | Products of ranges in an array | 790 |
| 13 | Convert a String that is Repetition of a Substring of Length K | 781 |
| 14 | Find Largest d in Array such that a + b + c = d | 741 |
| 15 | Replace two consecutive equal values with one greater | 715 |
| 16 | Mean of range in array | 677 |
| 17 | Print modified array after executing the commands of addition and subtraction | 651 |
| 18 | Moser-de Bruijn Sequence | 645 |
| 19 | Print modified array after multiple array range increment operations | 601 |
| 20 | K’th Largest element in BST using constant extra space | 585 |
| 21 | Maximum Depth Of Binary Tree | 575 |
