This repository tracks my progress on Leetcode.
These solutions are absolutely not to be taken as the best possible. These solutions are the ones I came up with.
I have created this repository for personal future reference. Don't get upset if I'm not using the best algorithms or coding practices, that's not the goal.
All of the solutions reported are exclusively for the free tier questions.
| # | Title | Solution | Difficulty | Time Complexity | Space Complexity |
|---|---|---|---|---|---|
| 0062 | Unique Paths | C++ | Medium | O(n * m) | O(n * m) |
| 0064 | Minimum Path Sum | C++ | Medium | O(n) | O(n) |
| 0070 | Climbing Stairs | C++ | Easy | O(n) | O(n) |
| 0152 | Maximum Product Subarray | C++ | Medium | O(n) | O(1) |
| 0322 | Coin Change | C++ | Medium | O(m * n) | O(n) |
| 0338 | Counting Bits | C++ | Medium | O(n) | O(n) |
| 0746 | Min Cost Climbing Stairs | C++ | Easy | O(n^2) | O(n) |
| 0931 | Minimum Falling Path Sum | C++ | Medium | O(n^2) | O(n) |
| 0983 | Minimum Cost For Tickets | C++ | Medium | O(1) | O(1) |
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent