A comprehensive collection of Data Structures and Algorithms implemented in Python. This repository is designed to help learners understand core DSA concepts through clean, beginner-friendly, and well-structured implementations.
- About
- Topics Covered
- Repository Structure
- Features
- Learning Objectives
- Getting Started
- Author
- License
- Build a strong foundation in Data Structures and Algorithms.
- Practice writing clean and efficient Python code.
- Understand the core concepts behind common data structures.
- Strengthen problem-solving skills.
- Prepare for coding interviews and technical assessments.
| Topic | Description |
|---|---|
| Arrays | Basic array operations and manipulation |
| Strings | Common string algorithms |
| Searching | Linear and Binary Search |
| Sorting | Fundamental sorting algorithms |
| Stack | Stack implementations and applications |
| Queue | Queue implementations |
| Linked List | Basic linked list operations |
| Trees | Tree traversal algorithms |
| Recursion | Recursive problem solving |
| Hashing | Hash maps and frequency counting |
| Heap | Min Heap and Max Heap operations |
| Graph | BFS, DFS, and graph representation |
| Dynamic Programming | Classic optimization problems |
DSA-Using-Python/
├── Arrays/
├── Strings/
├── Searching/
├── Sorting/
├── Stack/
├── Queue/
├── LinkedList/
├── Trees/
├── Recursion/
├── Hashing/
├── Heap/
├── Graph/
├── DynamicProgramming/
├── README.md
└── LICENSE
- Array manipulation
- Searching techniques
- Sorting algorithms
- Recursive thinking
- Stack and Queue operations
- Linked List fundamentals
- Tree traversals
- Graph traversals
- Dynamic Programming basics
- Time and space complexity awareness
- Beginner-friendly implementations
- Clean and readable Python code
- Topic-wise organized structure
- Covers fundamental DSA concepts
- Suitable for learning and practice
- Useful for interview preparation
Clone the repository:
git clone https://github.com/notlexius-glitch/DSA-Using-Python.git
Move into the project:
cd DSA-Using-Python
Run any file:
python Arrays/reverse_array.py
Praval Yadav
GitHub: @notlexius-glitch
This project is licensed under the MIT License.
| 0110-balanced-binary-tree |
| 0235-lowest-common-ancestor-of-a-binary-search-tree |
| 0257-binary-tree-paths |
| 0110-balanced-binary-tree |
| 0235-lowest-common-ancestor-of-a-binary-search-tree |
| 0257-binary-tree-paths |
| 0310-minimum-height-trees |
| 0110-balanced-binary-tree |
| 0235-lowest-common-ancestor-of-a-binary-search-tree |
| 0257-binary-tree-paths |
| 0229-majority-element-ii |
| 0242-valid-anagram |
| 0264-ugly-number-ii |
| 0268-missing-number |
| 0290-word-pattern |
| 0299-bulls-and-cows |
| 0229-majority-element-ii |
| 0242-valid-anagram |
| 0268-missing-number |
| 0274-h-index |
| 0295-find-median-from-data-stream |
| 0229-majority-element-ii |
| 0299-bulls-and-cows |
| 0229-majority-element-ii |
| 0231-power-of-two |
| 0260-single-number-iii |
| 0268-missing-number |
| 0287-find-the-duplicate-number |
| 0231-power-of-two |
| 0233-number-of-digit-one |
| 0234-palindrome-linked-list |
| 0273-integer-to-english-words |
| 0233-number-of-digit-one |
| 0264-ugly-number-ii |
| 0279-perfect-squares |
| 0300-longest-increasing-subsequence |
| 0312-burst-balloons |
| 0313-super-ugly-number |
| 0322-coin-change |
| 0234-palindrome-linked-list |
| 0234-palindrome-linked-list |
| 0283-move-zeroes |
| 0287-find-the-duplicate-number |
| 0295-find-median-from-data-stream |
| 0234-palindrome-linked-list |
| 0316-remove-duplicate-letters |
| 0235-lowest-common-ancestor-of-a-binary-search-tree |
| 0235-lowest-common-ancestor-of-a-binary-search-tree |
| 0239-sliding-window-maximum |
| 0239-sliding-window-maximum |
| 0239-sliding-window-maximum |
| 0264-ugly-number-ii |
| 0295-find-median-from-data-stream |
| 0239-sliding-window-maximum |
| 0239-sliding-window-maximum |
| 0240-search-a-2d-matrix-ii |
| 0307-range-sum-query-mutable |
| 0240-search-a-2d-matrix-ii |
| 0289-game-of-life |
| 0257-binary-tree-paths |
| 0282-expression-add-operators |
| 0301-remove-invalid-parentheses |
| 0306-additive-number |
| 0258-add-digits |
| 0289-game-of-life |
| 0258-add-digits |
| 0274-h-index |
| 0278-first-bad-version |
| 0279-perfect-squares |
| 0301-remove-invalid-parentheses |
| 0310-minimum-height-trees |
| 0322-coin-change |
| 0279-perfect-squares |
| 0322-coin-change |
| 0279-perfect-squares |
| 0322-coin-change |
| 0284-peeking-iterator |
| 0295-find-median-from-data-stream |
| 0307-range-sum-query-mutable |
| 0284-peeking-iterator |
| 0287-find-the-duplicate-number |
| 0287-find-the-duplicate-number |
| 0292-nim-game |
| 0319-bulb-switcher |
| 0292-nim-game |
| 0292-nim-game |
| 1927-sum-game |
| 0292-nim-game |
| 0292-nim-game |
| 0295-find-median-from-data-stream |
| 0300-longest-increasing-subsequence |
| 0307-range-sum-query-mutable |
| 0307-range-sum-query-mutable |
| 0307-range-sum-query-mutable |
| 0310-minimum-height-trees |
| 0310-minimum-height-trees |
| 0316-remove-duplicate-letters |
| 1927-sum-game |
| 0316-remove-duplicate-letters |