Hello, Welcome to my daily grind of solving LeetCode problems! This repository is a structured archive of my journey through algorithmic challenges—one problem at a time, every day.
0349-intersection-of-two-arrays |
0451-sort-characters-by-frequency |
0628-maximum-product-of-three-numbers |
2204-find-subsequence-of-length-k-with-the-largest-sum |
3226-minimum-number-game |
0451-sort-characters-by-frequency |
2204-find-subsequence-of-length-k-with-the-largest-sum |
3226-minimum-number-game |
0451-sort-characters-by-frequency |
0451-sort-characters-by-frequency |
1386-shift-2d-grid |
1642-water-bottles |
1806-count-of-matches-in-tournament |
2137-final-value-of-variable-after-performing-operations |
3226-minimum-number-game |
0151-reverse-words-in-a-string |
0189-rotate-array |
0349-intersection-of-two-arrays |
0653-two-sum-iv-input-is-a-bst |
2231-find-first-palindromic-string-in-the-array |
1610-xor-operation-in-an-array |
1386-shift-2d-grid |
1496-lucky-numbers-in-a-matrix |
1791-richest-customer-wealth |
3330-modify-the-matrix |
2507-number-of-common-factors |
2507-number-of-common-factors |
0111-minimum-depth-of-binary-tree |
0653-two-sum-iv-input-is-a-bst |
0671-second-minimum-node-in-a-binary-tree |
1079-sum-of-root-to-leaf-binary-numbers |
0111-minimum-depth-of-binary-tree |
0653-two-sum-iv-input-is-a-bst |
0671-second-minimum-node-in-a-binary-tree |
1079-sum-of-root-to-leaf-binary-numbers |
0111-minimum-depth-of-binary-tree |
0653-two-sum-iv-input-is-a-bst |
0671-second-minimum-node-in-a-binary-tree |
1079-sum-of-root-to-leaf-binary-numbers |
0198-house-robber |
0747-min-cost-climbing-stairs |
1013-fibonacci-number |
1236-n-th-tribonacci-number |
1013-fibonacci-number |
1013-fibonacci-number |
1236-n-th-tribonacci-number |
0111-minimum-depth-of-binary-tree |
0653-two-sum-iv-input-is-a-bst |
0349-intersection-of-two-arrays |
0653-two-sum-iv-input-is-a-bst |
0445-add-two-numbers-ii |
2871-double-a-number-represented-as-a-linked-list |
0445-add-two-numbers-ii |
2871-double-a-number-represented-as-a-linked-list |