DSA Algomap Questions

Welcome to the DSA Algomap Questions repository! This project is a curated collection of solutions to common Data Structures and Algorithms (DSA) problems. The repository is structured to help learners and enthusiasts understand and solve DSA problems efficiently.

---

Repository Structure

The repository currently contains a folder named Array_and_Strings, which includes solutions to the following problems:

1. Closest Number to Zero

   • File: Closest_Number_To_Zero.cpp
   • Description: This solution identifies the number closest to zero in a given array, considering both positive and negative values.

2. Merge Strings Alternately

   • File: Merge_Strings_Alternately.cpp
   • Description: This program merges two input strings alternately, character by character, creating a new interleaved string.

3. Additional Problems

   • More files and solutions are being actively added to this folder, providing a growing resource for learners.

---

Getting Started

To clone and explore this repository on your local system, run: bash git clone https://github.com/sdass1918/DSA-Algomap-Questions.git

---

Goals of This Repository

1. Provide structured and well-documented DSA solutions.
2. Serve as a resource for others preparing for coding interviews or improving their problem-solving skills.

Technologies Used

• C++: The primary programming language used for solving DSA problems.
• Git & GitHub: For version control and collaboration.

Future Plans

Expand the repository to include solutions for more DSA topics like:

• Sorting and Searching
• Linked Lists
• Trees and Graphs
• Dynamic Programming

Motivation

⭐ If you find this repository helpful or inspiring, please consider giving it a star! Your support encourages me to keep improving and adding new solutions, making this repository a better resource for everyone.

Author

Sudipta Das
B.Tech in Mathematics and Computing
Rajiv Gandhi Institute of Petroleum Technology, Jais Amethi