Solutions of the problems that I solved in LeetCode during May LeetCoding Challenge
| Day | Problem | Concept | Difficulty |
|---|---|---|---|
| 1 | First Bad Version | Binary Search | Easy |
| 2 | Jewels and Stones | String Comparision | Easy |
| 3 | Ransom Note | String Manipulation | Easy |
| 4 | Number Complement | Bit Wise Operators | Medium |
| 5 | First Unique Character in a String | String | Easy |
| 6 | Majority Element | Boyer-Moore Voting Algorithm | Easy |
| 7 | Cousins in Binary Tree | Binary Tree | Medium |
| 8 | Check If It Is a Straight Line | Math | Easy |
| 9 | Valid Perfect Square | Binary Search | Easy |
| 10 | Find the Town Judge | Counting | Easy |
| 11 | Flood Fill | Recursion | Easy |
| 12 | Single Element in a Sorted Array | Loop | Easy |
| 13 | Remove K Digits | Loop | Medium |
| 14 | Implement Trie (Prefix Tree) | Trie | Medium |
| 15 | Maximum Sum Circular Subarray | Kadane's algorithm | Medium |
| 16 | Odd Even Linked List | Linked List - TWO Pointer | Medium |
| 17 | Find All Anagrams in a String | Anagram | Medium |