Repository to house the solutions of the 31 day May LeetCode Challenge
Week 1
-
Day 1 (First Bad Version)
-
Day 2 (Jewels and Stones)
-
Day 3 (Ransom Note)
-
Day 4 (Complement of a Number)
-
Day 5 (First Unique Character of a String)
-
Day 6 (Majority Element of an Array)
-
Day 7 (Cousins in a Binary Tree)
Week 2
-
Day 8 (Check for a Straight Line)
-
Day 9 (Perfect Square Checker without sqrt)
-
Day 10 (Find the Town Judge)
-
Day 11 (Flood Fill)
-
Day 12 (Single element in a sorted array)
-
Day 13 (Remove K digits)
-
Day 14 (Implement Trie)
Week 3
-
Day 15 (Maximum Sum Circular Sub Array)
-
Day 16 (Odd Even Linked List)
-
Day 17 (Find all Anagrams in a String)
-
Day 18 (Permutation in String)
-
Day 19 (Online Stock Span)
-
Day 20 (Kth Smallest Element in Binary Search Tree)
-
Day 21 (Count Square Submatrices with All Ones)
Week 4
-
Day 22 (Sort Characters by Frequency)
-
Day 23 (Interval List Intersections)
-
Day 24 (Construct BST from Preorder Traversal)
-
Day 25 (Uncrossed Lines)
-
Day 26 (Contiguous Array)
-
Day 27 (Possible Bipartition)
-
Day 28 (Counting Bits)
Week 5
-
Day 29 (Course Schedule)
-
Day 30 (K Closest Points to Origin)
-
Day 31 (Edit Distance)