Skip to content

πŸš€ This repository contains Data Structures and Algorithms (DSA) implementations in C++ with a focus on arrays, linked lists, stacks, queues, trees, graphs, sorting, searching, and other fundamental concepts. Ideal for interview preparation and competitive programming. πŸ’‘πŸ”’

Notifications You must be signed in to change notification settings

iamapuneet/dsa_in_cpp

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 

History

2 Commits
Β 
Β 
Β 
Β 

Repository files navigation

DSA in C++ πŸš€

Welcome to the DSA in C++ repository! This project contains implementations of various Data Structures and Algorithms (DSA) in C++, making it a great resource for coding interviews, competitive programming, and learning fundamental concepts.

πŸ“Œ Features

βœ… Implementations of essential DSA topics
βœ… Optimized and well-structured C++ code
βœ… Beginner-friendly explanations and comments
βœ… Useful for interview preparation and competitive coding

πŸ”§ Installation & Setup

  1. Clone the repository
    git clone https://github.com/iamapuneet/dsa_in_cpp.git
    cd dsa_in_cpp
  2. Compile and run a program
    g++ main.cpp -o main
    ./main

πŸ† Topics Covered

  • Arrays πŸ“Š
  • Linked Lists πŸ”—
  • Stacks πŸ“š
  • Queues 🎭
  • Trees 🌳
  • Graphs πŸ”—
  • Sorting Algorithms πŸ”’
  • Searching Algorithms πŸ”
  • Dynamic Programming πŸ”₯
  • Recursion & Backtracking πŸŒ€

🀝 Contributing

Feel free to contribute by adding new DSA solutions or improving existing implementations.

  1. Fork the repository
  2. Create a new branch
    git checkout -b feature-name
  3. Make your changes and commit
    git commit -m "Added XYZ algorithm"
  4. Push your changes and create a pull request
    git push origin feature-name

πŸ“œ License

This project is licensed under the MIT License.


Happy coding! πŸš€

About

πŸš€ This repository contains Data Structures and Algorithms (DSA) implementations in C++ with a focus on arrays, linked lists, stacks, queues, trees, graphs, sorting, searching, and other fundamental concepts. Ideal for interview preparation and competitive programming. πŸ’‘πŸ”’

Topics

Resources

Stars

Watchers

Forks

Contributors 2

  •  
  •