This repository contains my LeetCode problem solutions.
The goal is to keep track of problems I have solved and the concepts I am learning. It also acts as a place for quick revision.
Solutions are added as I practice. Code quality and optimization may vary.
This repository is for personal learning and reference.
now also has the solution from the placement training
Create markdown file for the given problem. include the leetcode number, problem link, write the brute force and optimized solution. explain the flow of the algorithm using an example. explain the core idea and thinking view. include the intuvtion. include the images if possible from the internet.
| 0110-balanced-binary-tree |
| 2306-create-binary-tree-from-descriptions |
| 3842-number-of-ways-to-assign-edge-weights-ii |
| 3844-number-of-ways-to-assign-edge-weights-i |
| 0110-balanced-binary-tree |
| 2306-create-binary-tree-from-descriptions |
| 0039-combination-sum |
| 0040-combination-sum-ii |
| 0046-permutations |
| 0077-combinations |
| 0078-subsets |
| 0079-word-search |
| 0090-subsets-ii |
| 0401-binary-watch |
| 0800-letter-case-permutation |
| 0021-merge-two-sorted-lists |
| 0050-powx-n |
| 0143-reorder-list |
| 0206-reverse-linked-list |
| 0234-palindrome-linked-list |
| 0020-valid-parentheses |
| 0143-reorder-list |
| 0234-palindrome-linked-list |
| 0682-baseball-game |
| 2236-maximum-twin-sum-of-a-linked-list |
| 2846-robot-collisions |
| 3902-maximize-spanning-tree-stability-with-upgrades |
| 3902-maximize-spanning-tree-stability-with-upgrades |
| 0146-lru-cache |
| 0303-range-sum-query-immutable |
| 1728-fancy-sequence |
| 2178-walking-robot-simulation-ii |
| 0493-reverse-pairs |
| 1728-fancy-sequence |
| 4007-maximum-total-subarray-value-ii |
| 4074-count-subarrays-with-majority-element-i |
| 4075-count-subarrays-with-majority-element-ii |
| 0146-lru-cache |
| 0023-merge-k-sorted-lists |
| 4007-maximum-total-subarray-value-ii |
| 0023-merge-k-sorted-lists |
| 0493-reverse-pairs |
| 4074-count-subarrays-with-majority-element-i |
| 4075-count-subarrays-with-majority-element-ii |
| 3770-lexicographically-smallest-generated-string |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0204-count-primes |
| 0258-add-digits |
| 3933-minimum-jumps-to-reach-end-via-prime-teleportation |
| 1482-how-many-numbers-are-smaller-than-the-current-number |
| 1961-maximum-ice-cream-bars |
| 1395-minimum-time-visiting-all-points |
| 1036-rotting-oranges |
| 1447-jump-game-iv |
| 1507-check-if-there-is-a-valid-path-in-a-grid |
| 1663-detect-cycles-in-2d-grid |
| 3933-minimum-jumps-to-reach-end-via-prime-teleportation |
| 0070-climbing-stairs |
| 0014-longest-common-prefix |
| 3329-find-the-length-of-the-longest-common-prefix |
| 0187-repeated-dna-sequences |
| 0187-repeated-dna-sequences |