This is a collection of my attempts at solutions to LeetCode problems. Please note that these may not be the best or optimal solutions. Some of the solutions may be incomplete and/or not working. Some of the solutions are missing. I will try to get these all competed and updated to working order, but PRs are welcome!
Most of the solutions are available in Go. Some also have PowerShell (PS) solutions.
PowerShell examples may not follow PowerShell best practices. These solutions are intended to be done quickly in a coding interview. PowerShell is a very verbose language when done properly. As such, the PowerShell solutions optimize function over form.
- Cleanup solutions
- Document time and space complexity for each solution
- Add PowerShell solutions
- Document the LeetCode problem title and URL in each solution
- Document how each solutions works
- Algorithms I https://leetcode.com/study-plan/algorithm/
- Day 1 - Binary Search
- Day 2 - Two Pointers
- Day 3 - Two Pointers
- Day 4 - Two Pointers
- Day 5 - Two Pointers
- Day 6 - Sliding Window
- Day 7 - Breadth-First Search / Depth-First Search
- Day 8 - Breadth-First Search / Depth-First Search
- Day 9 - Breadth-First Search / Depth-First Search
- Day 10 - Recursion / Backtracking
- Day 11 - Recursion / Backtracking
- Day 12 - Dynamic Programming
- Day 13 - Bit Manipulation
- Day 14 - Bit Manipulation
- 190. Reverse Bits - Go | PS
- 136. Single Number - Go | PS
- Data Structure I
- Day 1 - Array
- 217. Contains Duplicate - Go | PS
- 53. Maximum Subarray - Go | PS
- Day 2 - Array
- 1. Two Sum - Go | PS
- 88. Merge Sorted Array - Go | PS
- Day 3 - Array
- Day 4 - Array
- Day 5 - Array
- 36. Valid Sudoku - Go | PS
- 74. Search a 2D Matrix - Go | PS
- Day 1 - Array