| Distributed Wikipedia Crawler System Design | Hard | google | |
| Word Sense Disambiguation Algorithm | Hard | quora | |
| Soundex Algorithm Implementation | Hard | grammarly | |
| Maximum Edge Removal for Even Subtrees | Hard | adobe | |
| Uniformly Shuffle Linked List Nodes | Hard | apple | |
| Ways To Form Max Heap | Hard | microsoft
directi | |
| PageRank Algorithm Implementation | Hard | google | |
| 2-CNF Boolean Satisfiability Problem | Hard | dropbox | |
| Stable Marriage Problem | Hard | amazon | |
| Construct Cartesian Tree from Sequence | Hard | netflix | |
| 8-Puzzle Solver | Hard | airbnb | |
| Stone Pyramid Construction | Hard | uber | |
| Dodgeball Team Division | Hard | twitter | |
| Binary Search Without Multiplication, Division and Bit-shift Operations | Hard | netflix | |
| Chess King Check Detector | Hard | Oracle | |
| Ghost Word Game Winning Strategy | Hard | two-sigma | |
| Maximum of Two Numbers Without Conditionals | Hard | nvidia | |
| Maximum Weight Spanning Tree | Hard | microsoft | |
| Blackjack Optimal Strategy with Known Card Sequence | Hard | MIT | |
| Maximum flow and bipartite matching | Hard | | |
| Check If Digits Are Equal in String After Operations II | Hard | | |
| Concatenated Divisibility | Hard | | |
| Count Beautiful Numbers | Hard | | |
| Count Connected Components in LCM Graph | Hard | | |
| Count Non-Decreasing Subarrays After K Operations | Hard | | |
| Count Numbers with Non-Decreasing Digits | Hard | | |
| Count Substrings Divisible By Last Digit | Hard | | |
| Equal Sum Grid Partition II | Hard | | |
| Find Invalid IP Addresses | Hard | | |
| Find Sum of Array Product of Magical Sequences | Hard | | |
| Find the Lexicographically Largest String From the Box II | Hard | | |
| Find X Value of Array II | Hard | | |
| First Letter Capitalization II | Hard | | |
| Frequencies of Shortest Supersequences | Hard | | |
| Length of Longest V-Shaped Diagonal Segment | Hard | | |
| Lexicographically Smallest Generated String | Hard | | |
| Longest Common Prefix of K Strings After Removal | Hard | | |
| Longest Palindrome After Substring Concatenation II | Hard | | |
| Longest Special Path | Hard | | |
| Longest Special Path II | Hard | | |
| Manhattan Distances of All Arrangements of Pieces | Hard | | |
| Maximize Active Section with Trade II | Hard | | |
| Maximize Subarray Sum After Removing All Occurrences of One Element | Hard | | |
| Maximize Subarrays After Removing One Conflicting Pair | Hard | | |
| Maximize the Distance Between Points on a Square | Hard | | |
| Maximize the Minimum Game Score | Hard | | |
| Maximum and Minimum Sums of at Most Size K Subarrays | Hard | | |
| Maximum Area Rectangle With Point Constraints II | Hard | | |
| Maximum Product of Subsequences With an Alternating Sum Equal to K | Hard | | |
| Maximum Profit from Valid Topological Order in DAG | Hard | | |