Solutions for May LeetCoding Challenge
This release contains solutions for May LeetCoding Challenge.
| LeetCode # | Title | Difficulty | Topics |
|---|---|---|---|
| 72 | Edit Distance | Hard | String, Dynamic Programming |
| 169 | Majority Element | Easy | Array, Divide and Conquer, Bit Manipulation |
| 207 | Course Schedule | Medium | Depth-first Search, Breadth-first Search, Graph, Topological Sort |
| 208 | Implement Trie (Prefix Tree) | Medium | Design, Trie |
| 230 | Kth Smallest Element in a BST | Medium | Binary Search, Tree |
| 278 | First Bad Version | Easy | Binary Search |
| 328 | Odd Even Linked List | Medium | Linked List |
| 338 | Counting Bits | Medium | Dynamic Programming, Bit Manipulation |
| 367 | Valid Perfect Square | Easy | Math, Binary Search |
| 383 | Ransom Note | Easy | String |
| 387 | First Unique Character in a String | Easy | Hash Table, String |
| 402 | Remove K Digits | Medium | Stack, Greedy |
| 438 | Find All Anagrams in a String | Medium | Hash Table |
| 451 | Sort Characters By Frequency | Medium | Hash Table, Heap |
| 476 | Number Complement | Easy | Bit Manipulation |
| 525 | Contiguous Array | Medium | Hash Table |
| 540 | Single Element in a Sorted Array | Medium | - |
| 567 | Permutation in String | Medium | Two Pointers, Sliding Window |
| 733 | Flood Fill | Easy | Depth-first Search |
| 771 | Jewels and Stones | Easy | Hash Table |
| 886 | Possible Bipartition | Medium | Depth-first Search |
| 901 | Online Stock Span | Medium | Stack |
| 918 | Maximum Sum Circular Subarray | Medium | Array |
| 973 | K Closest Points to Origin | Medium | Divide and Conquer, Heap, Sort |
| 986 | Interval List Intersections | Medium | Two Pointers |
| 993 | Cousins in Binary Tree | Easy | Tree, Breadth-first Search |
| 997 | Find the Town Judge | Easy | Graph |
| 1035 | Uncrossed Lines | Medium | Array |
| 1008 | Construct Binary Search Tree from Preorder Traversal | Medium | Tree |
| 1232 | Check If It Is a Straight Line | Easy | Array, Math, Geometry |
| 1277 | Count Square Submatrices with All Ones | Medium | Array, Dynamic Programming |