Skip to content

AkhtarShadab/GFG_DSA

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

GeeksforGeeks DSA Practice Solutions

This repository contains C++ solutions for classic data structure and algorithm questions from the GeeksforGeeks DSA (Data Structures and Algorithms) practice course and the explore section.

Course Link: DSA - GeeksforGeeks Explore Link: GFG Explore

About

In this repository, you will find organized solutions for various DSA problems provided in the GeeksforGeeks DSA practice course and the explore section. Each solution is written in C++ and is aimed at helping you understand and practice fundamental algorithms and data structures.

Contents

The repository is structured as follows:

  • Arrays: Solutions related to array manipulation and algorithms.
  • Strings: Solutions involving string manipulation and pattern matching.
  • Linked Lists: Solutions for problems related to singly and doubly linked lists.
  • Stacks and Queues: Implementations and solutions involving stacks and queues.
  • Trees: Problems related to binary trees, binary search trees, and heap data structures.
  • Graphs: Solutions for graph traversal, shortest paths, and other graph-related problems.
  • Sorting and Searching: Implementations of various sorting algorithms and binary search.
  • Dynamic Programming: Solutions involving dynamic programming concepts and techniques.
  • Greedy: Problems and solutions that apply greedy algorithms.
  • Bit Manipulation: Solutions that involve bitwise manipulation and operations.

How to Use

  1. Clone the repository to your local machine using:
git clone https://github.com/AkhtarShadab/GFG_DSA.git
  1. Navigate to the relevant folder for the problem you are interested in.
  2. Open the solution file in your preferred C++ compiler or IDE.
  3. Read through the code, comments, and explanations to understand the solution approach.
  4. Run the code and modify it as needed for your own practice.

Contribution

If you find any issues with the solutions, or you have a better approach, feel free to contribute. Here's how:

  1. Fork the repository.
  2. Create a new branch for your changes.
  3. Make your modifications and improvements.
  4. Test thoroughly.
  5. Submit a pull request explaining your changes and improvements.

Let's learn and grow together through collaborative coding!

Disclaimer

The solutions provided in this repository are intended for educational purposes. They are not intended for direct submission in coding assessments or competitive programming without understanding the concepts involved. Use these solutions as a reference and try to implement your own solutions first.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages