Add New DSA Problems to Enhance Repository for Hacktoberfest 2025 #13
Description
Description:
Currently, the repository has a few problems under Arrays, Strings, and LinkedList. To make it more beginner-friendly and Hacktoberfest-ready, I propose adding additional essential DSA problems.
Proposed New Problems:
Arrays:
Reverse Array
Two Sum / Pair with Target Sum
Rotate Array
Trapping Rain Water
Maximum Product Subarray
Strings:
Reverse String
Anagram Check
Longest Palindromic Substring
String Compression
LinkedList:
Reverse Linked List
Detect Cycle in LinkedList
Merge Two Sorted LinkedLists
Remove N-th Node from End
Optional New Folders:
Stacks/Queues:
Implement Stack using LinkedList
Evaluate Postfix Expression
Next Greater Element
Recursion / Backtracking:
Subset Sum Problem
N-Queens Problem
Generate All Permutations of a String
Implementation Guidelines:
Add problems in the appropriate folders.
Solutions can be in Python, Java, C++, etc.
Each solution should be clean, readable, and well-documented.
Follow the existing file structure and naming conventions.
Expected Outcome:
Beginners will have a broader set of problems to contribute to during Hacktoberfest.
Repository becomes more comprehensive and contribution-friendly.
assign me this