https://github.com/sahil-113/dsa-practice-questions
This repository contains a curated collection of Data Structures and Algorithms (DSA) practice questions with detailed solutions. It is designed to help students and professionals improve their problem-solving skills for coding interviews, competitive programming, and technical assessments. The solutions are written in Python, and C++ with OOPs...
https://github.com/sahil-113/dsa-practice-questions
arrays-and-strings bit-manipulation dynamic-programming graph linked-list stack tree
Last synced: 3 months ago
JSON representation
This repository contains a curated collection of Data Structures and Algorithms (DSA) practice questions with detailed solutions. It is designed to help students and professionals improve their problem-solving skills for coding interviews, competitive programming, and technical assessments. The solutions are written in Python, and C++ with OOPs...
- Host: GitHub
- URL: https://github.com/sahil-113/dsa-practice-questions
- Owner: Sahil-113
- Created: 2025-03-01T04:01:04.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2025-05-27T20:16:22.000Z (about 1 year ago)
- Last Synced: 2025-09-25T10:03:26.191Z (9 months ago)
- Topics: arrays-and-strings, bit-manipulation, dynamic-programming, graph, linked-list, stack, tree
- Homepage:
- Size: 135 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# DSA Practice Questions with Solutions
Welcome to the DSA Practice Questions with Solutions repository! This repository contains a collection of Data Structures and Algorithms (DSA) problems along with well-structured solutions in multiple programming languages. It is designed to help students and professionals prepare for coding interviews, competitive programming, and technical assessments.
## π Features
π Comprehensive Solutions: Each problem includes a detailed explanation and optimized solution.
π Covers Key DSA Topics: Arrays, Linked Lists, Stacks, Queues, Trees, Graphs, Sorting, Searching, Recursion, Dynamic Programming, and more.
π Optimized Code: Solutions focus on efficiency and best practices.
π― Difficulty Levels: Problems categorized into Easy, Medium, and Hard.
π Language Support: Solutions provided in C++ and Python.
## π Folder Structure
DSA-Practice-Questions/
βββ Arrays/
βββ LinkedLists/
βββ Stacks/
βββ Queues/
βββ Trees/
βββ Graphs/
βββ Recursion/
βββ DynamicProgramming/
βββ SortingSearching/
βββ Miscellaneous/
βββ README.md
## π₯ Topics Covered
β
Arrays β Sliding Window, Two Pointers, Sorting, Searching, Kadaneβs Algorithm, etc.
β
Linked Lists β Reversal, Cycle Detection, Merge, Partitioning, etc.
β
Stacks & Queues β Next Greater Element, Balanced Parentheses, etc.
β
Trees β Traversals, BST, AVL, Heap, Segment Tree, etc.
β
Graphs β BFS, DFS, Dijkstra, Floyd-Warshall, Topological Sorting, etc.
β
Recursion & Backtracking β Subsets, Permutations, N-Queens, etc.
β
Dynamic Programming β Fibonacci, Knapsack, LIS, Matrix Chain Multiplication, etc.
β
Sorting & Searching β QuickSort, MergeSort, Binary Search Variations, etc.
## π‘ How to Contribute
We welcome contributions! Follow these steps to contribute:
Fork the repository.
Clone your forked repository:
git clone https://github.com/Sahil-113/DSA-Practice-Questions.git
Create a new branch:
git checkout -b feature-branch
Add your solution in the respective folder.
Commit and push:
git add .
git commit -m "Added solution for XYZ problem"
git push origin feature-branch
Submit a Pull Request (PR) and wait for review.
## π Prerequisites
To run the solutions, you need:
Python (>=3.7)
GCC for C++
Java JDK (>=8)
π License
This project is licensed under the MIT License β feel free to use, modify, and share!
### π Show Your Support
If you find this helpful, β star this repository to keep it growing!
### Happy Coding! π