| Count Unguarded Cells in the Grid Problem | Medium | | |
| Take K of Each Character From Left and Right Problem | Medium | | |
| Maximum Sum of Distinct Subarrays With Length K Problem | Medium | | |
| Defuse the Bomb Problem | Easy | | |
| Shortest Subarray with Sum at Least K Problem | Hard | amazon
facebook
goldman-sachs
google | |
| Find the Power of K-Size Subarrays 1 | Medium | | |
| Shortest Subarray to be Removed to Make Array Sorted Problem | Medium | | |
| Minimized Maximum of Products Distributed to Any Store Problem | Medium | | |
| Count the Number of Fair Pairs Problem | Medium | | |
| Two Best Non-Overlapping Events Problem | Medium | | |
| Maximum Earnings From Taxi Problem | Medium | | |
| Most Beautiful Item for Each Query Problem | Medium | | |
| Prime Subtraction Operation Problem | Medium | | |
| Shortest Subarray With OR at Least K 2 Problem | Medium | | |
| Minimum Array End Problem | Medium | | |
| Maximum XOR for Each Query Problem | Medium | | |
| Largest Combination With Bitwise AND Greater Than Zero Problem | Medium | | |
| Find if Array Can Be Sorted Problem | Medium | | |
| Minimum Number of Changes to Make Binary String Beautiful Problem | Medium | | |
| Consecutive Characters Problem | Easy | | |
| String Compression 3 Problem | Medium | | |
| Capitalize the Title Problem | Easy | | |
| Extended Euclidean Algorithm using modulo operator | | | |
| Basic Euclidean Algorithm to find GCD of two numbers using modulo operator | | | |
| Subtractive Euclidean Algorithm | | | |
| Circular Sentence Problem | Easy | | |
| Delete Characters to Make Fancy String Problem | Easy | | |
| Row With Maximum Ones Problem | Easy | | |
| Minimum Total Distance Traveled Problem | Hard | | |
| Maximum Number of Moves in a Grid Problem | Medium | | |
| Longest Square Streak in an Array Problem | Medium | | |
| Count Square Submatrices with All Ones Problem | Medium | google | |
| Height of Binary Tree After Subtree Removal Queries Problem | Hard | | |
| Remove Sub-Folders from the Filesystem Problem | Medium | amazon
facebook
google | |
| Diagonal Traverse Problem | Medium | amazon
apple
ebay
facebook
google
microsoft
quora
splunk | |
| Kth Largest Sum in a Binary Tree Problem | Medium | | |
| Split a String Into the Max Number of Unique Substrings Problem | Medium | | |
| Parsing A Boolean Expression Problem | Hard | affinity | |
| Find Kth Bit in Nth Binary String Problem | Medium | | |
| Count Number of Maximum Bitwise-OR Subsets Problem | Medium | | |
| Maximum Swap Problem | Medium | amazon
apple
bytedance
facebook
microsoft
uber | |
| Separate Black and White Balls Problem | Medium | | |
| Maximal Score After Applying K Operations Problem | Medium | | |
| Smallest Range Covering Elements from K Lists Problem | Hard | amazon
apple
facebook
google
lyft
microsoft
pinterest
snapchat | |
| Divide Intervals Into Minimum Number of Groups Problem | Medium | | |
| The Number of the Smallest Unoccupied Chair Problem | Medium | | |
| Maximum Width Ramp Problem | Medium | ebay
facebook
google | |
| Minimum Add to Make Parentheses Valid Problem | Medium | amazon
facebook
servicenow | |
| Minimum String Length After Removing Substrings Problem | Easy | | |
| Sentence Similarity Problem | Easy | google | |