Add More DSA Problems to Repository #12
Description
Currently, the repository has only a limited number of Data Structures & Algorithms problems. To make this repo more helpful for Hacktoberfest contributors and learners, I’d like to contribute by adding more DSA problems across multiple topics and difficulty levels.
Proposal
I will add new problems with clear problem statements, constraints, and example test cases. Each problem will also include solutions in one or more programming languages (C++, Java, Python, etc.).
Example Topics I Can Contribute
Arrays & Strings (e.g., Second Largest Element, Palindrome Check)
Linked Lists (e.g., Reverse Linked List, Detect Cycle)
Dynamic Programming (e.g., Longest Common Subsequence, Edit Distance)
Graph Algorithms (e.g., BFS, DFS, Cycle Detection)
Classic Backtracking (e.g., N-Queens, Rat in a Maze)
This will make the repo more valuable and engaging for Hacktoberfest contributors. Please assign this issue to me, and I’ll start contributing right away!