| Group Sold Products By The Date | Open ↗ |
| Group the People Given the Group Size They Belong To | Open ↗ |
| Grumpy Bookstore Owner | Open ↗ |
| Guess Number Higher or Lower | Open ↗ |
| Guess Number Higher or Lower II | Open ↗ |
| Guess the Majority in a Hidden Array | Open ↗ |
| Guess the Word | Open ↗ |
| Hamming Distance | Open ↗ |
| Handling Sum Queries After Update | Open ↗ |
| Hand of Straights | Open ↗ |
| Handshakes That Don't Cross | Open ↗ |
| Happy Number | Open ↗ |
| Happy Students | Open ↗ |
| Harshad Number | Open ↗ |
| Hash Divided String | Open ↗ |
| Heaters | Open ↗ |
| Height Checker | Open ↗ |
| Height of Binary Tree After Subtree Removal Queries | Open ↗ |
| Hexadecimal and Hexatrigesimal Conversion | Open ↗ |
| Hexspeak | Open ↗ |
| High-Access Employees | Open ↗ |
| Highest Grade For Each Student | Open ↗ |
| High Five | Open ↗ |
| H-Index | Open ↗ |
| H-Index II | Open ↗ |
| Hopper Company Queries I | Open ↗ |
| Hopper Company Queries II | Open ↗ |
| Hopper Company Queries III | Open ↗ |
| House Robber | Open ↗ |
| House Robber II | Open ↗ |
| House Robber III | Open ↗ |
| House Robber IV | Open ↗ |
| How Many Apples Can You Put into the Basket | Open ↗ |
| How Many Numbers Are Smaller Than the Current Number | Open ↗ |
| HTML Entity Parser | Open ↗ |
| Human Traffic of Stadium | Open ↗ |
| Identify the Largest Outlier in an Array | Open ↗ |
| Image Overlap | Open ↗ |
| Image Smoother | Open ↗ |
| Immediate Food Delivery I | Open ↗ |
| Immediate Food Delivery II | Open ↗ |
| Implement Magic Dictionary | Open ↗ |
| Implement Queue using Stacks | Open ↗ |
| Implement Rand10() Using Rand7() | Open ↗ |
| Implement Router | Open ↗ |
| Implement Stack using Queues | Open ↗ |
| Implement Trie II (Prefix Tree) | Open ↗ |
| Implement Trie (Prefix Tree) | Open ↗ |
| Increasing Decreasing String | Open ↗ |
| Increasing Order Search Tree | Open ↗ |
| Increasing Triplet Subsequence | Open ↗ |
| Incremental Memory Leak | Open ↗ |
| Increment Submatrices by One | Open ↗ |
| Index Pairs of a String | Open ↗ |
| Inorder Successor in BST | Open ↗ |
| Inorder Successor in BST II | Open ↗ |
| Insert Delete GetRandom O(1) | Open ↗ |
| Insert Delete GetRandom O(1) - Duplicates allowed | Open ↗ |
| Insert Greatest Common Divisors in Linked List | Open ↗ |
| Insert Interval | Open ↗ |
| Insert into a Binary Search Tree | Open ↗ |
| Insert into a Sorted Circular Linked List | Open ↗ |
| Insertion Sort List | Open ↗ |
| Insufficient Nodes in Root to Leaf Paths | Open ↗ |
| Integer Break | Open ↗ |
| Integer Replacement | Open ↗ |
| Integer to English Words | Open ↗ |
| Integer to Roman | Open ↗ |
| Interleaving String | Open ↗ |
| Intersection of Multiple Arrays | Open ↗ |
| Intersection of Three Sorted Arrays | Open ↗ |
| Intersection of Two Arrays | Open ↗ |
| Intersection of Two Arrays II | Open ↗ |
| Intersection of Two Linked Lists | Open ↗ |
| Interval List Intersections | Open ↗ |
| Intervals Between Identical Elements | Open ↗ |
| Invalid Transactions | Open ↗ |
| Invalid Tweets | Open ↗ |
| Inverse Coin Change | Open ↗ |
| Invert Binary Tree | Open ↗ |
| Investments in 2016 | Open ↗ |
| IPO | Open ↗ |
| IP to CIDR | Open ↗ |
| Is Graph Bipartite? | Open ↗ |
| Island Perimeter | Open ↗ |
| Is Object Empty | Open ↗ |
| Isomorphic Strings | Open ↗ |
| Is Subsequence | Open ↗ |
| Iterator for Combination | Open ↗ |
| Jewels and Stones | Open ↗ |
| Jump Game | Open ↗ |
| Jump Game II | Open ↗ |
| Jump Game III | Open ↗ |
| Jump Game IV | Open ↗ |
| Jump Game IX | Open ↗ |
| Jump Game V | Open ↗ |
| Jump Game VI | Open ↗ |
| Jump Game VII | Open ↗ |
| Jump Game VIII | Open ↗ |
| K Closest Points to Origin | Open ↗ |