LeetCode Solutions
Leetcode problems solutions in C (not C++).
| Difficulty | Name | Problem | Solution | Note |
|---|---|---|---|---|
| Medium | String to Integer (atoi) | Link | Link | |
| Medium | Design Circular Queue | Link | Link | |
| Easy | Power of Four | Link | Link | |
| Hard | Regular Expression Matching | Link | Link | Passes only 90% of tests |
| Easy | Number of 1 Bits | Link | Link | |
| Medium | Implement Trie (Prefix Tree) | Link | Link | |
| Medium | Validate IP Address | Link | Link | |
| Easy | Valid Parentheses | Link | Link | Macro stack |
| Hard | LRU Cache | Link | Link | Passes 13/18 tests, no hashmap |
| Easy | Reverse Bits | Link | Link | Possible optimisation with iteration, depends on arch |
| Easy | Min Stack | Link | Link | 12ms, fastest possible |
| Hard | Valid Number | Link | Link | |
| Easy | Power of Two | Link | Link | |
| Easy | To Lower Case | Link | Link | |
| Medium | Reverse Polish Notation | Link | Link | Can be improved with in place stack operations instead of literal POP/PUSH operations |
| Easy | Ransom Note | Link | Link | |
| Easy | Binary Search | Link | Link |