This repo contains a collection of completed leetcode challenges. The challenges are organised in folders indicating their difficulty level and contain a description of the challenge along with some test cases. If you desire to test my solutions locally follow the instructions, and alternatively copy paste the code into the corresponding leetcode challenge.

• Fork and clone the repo
• cd into the directory
• open the directory in the code editor of your choice and open it's terminal
• To run the challenge in the terminal run node <foldername>/<filename>

• 1. Two Sum
• 9. Palindrome Number
• 13. Roman to Integer
• 14. Longest Common Prefix
• 20. Valid Parentheses
• 26. Remove Duplicates from Sorted Array
• 27. Remove Element
• 28. Find the Index of the First Occurrence in a String
• 35. Search Insert Position
• 58. Length of last word
• 66. Plus One
• 67. Add Binary
• 69. Sqrt(x)
• 70. Climbing Stairs
• 88. Merge Sorted Array
• 100. Same Tree
• 118. Pascal's Triangle
• 119. Pascal's Triangle II
• 125. Valid Palindrome
• 136. Single Number
• 190. Reverse Bits
• 191. Number of 1 Bits
• 202. Happy Number
• 205. Isomorphic Strings
• 217. Contains Duplicate
• 219. Contains Duplicate II
• 228. Summary Ranges
• 231. Power of Two
• 242. Valid Anagram
• 268. Missing Number
• 338. Counting Bits
• 492. Construct the Rectangle
• 495. Teemo Attacking
• 860. Lemonade Change
• 884. Uncommon Words From Two Sentences
• 1089. Duplicate Zeros
• 1909. Remove One Element to Make the Array Strictly Increasing
• 2331. Evaluate Boolean Binary Tree
• 2437. Number of Valid Clock Times
• 2620. Counter
• 2665. Counter 2
• 2727. Is Object Empty

• 3. Longest Substring Without Repeating Characters
• 6. ZigZag Conversion
• 12. Integer to Roman
• 15. 3Sum
• 18. 4Sum
• 22. Generate Parentheses
• 38. Count and Say
• 46. Permutaions
• 62. Unique Paths
• 167. Two Sum II - Input Array is Sorted
• 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers