This directory contains solved LeetCode problems organized by topic and difficulty, structured to follow the NeetCode and Striver A2Z roadmaps.
Currently documented problem sets:
- 01 Arrays & Hashing: Solutions for frequency maps, prefixes, and basic array validations.
- contains_duplicate.py - Check if array contains duplicates.
- valid_anagram.py - Check if two strings are anagrams of each other.
- two_sum.py - Find indices of two numbers that add up to a target.
- group_anagrams.py - Group anagram strings together.
- 02 Stacks: Solutions for sequential validation, reverse order processing, and stack usage.
- valid_parentheses.py - Validate parenthetical bracket balance in a string.
- 03 Two Pointers: Solutions for sequence iteration from both ends and read/write partitions.
- valid_palindrome.py - Check if a string is a palindrome after filtering non-alphanumeric characters.
- move_zeroes.py - Shift all zeroes in an array to the end in-place while maintaining relative order of non-zero elements.
The following topics will be populated as progression continues:
- 04 Sliding Window
- 05 Binary Search
- 06 Linked List
- 07 Trees
- 08 Backtracking
- 09 Graphs
- 10 Dynamic Programming
leetcode_problems/
├── README.md
├── 01_arrays_and_hashing/
├── 02_stacks/
├── 03_two_pointers/
├── 04_sliding_window/
├── 05_binary_search/
├── 06_linked_list/
├── 07_trees/
├── 08_backtracking/
├── 09_graphs/
└── 10_dynamic_programming/