Welcome to my Problem Solving Practice repository! 👋

This repository is dedicated to improving my problem-solving skills using Java. It focuses on mastering algorithms and data structures through hands-on practice and challenges.

Problems are sourced from platforms like Codeforces and LeetCode, as well as structured courses for systematic learning.

• Strengthen algorithmic thinking and coding proficiency.
• Prepare for coding interviews with comprehensive practice.
• Build efficient and optimized solutions to challenging problems.

• Sliding Window
• Two Pointers
• Fast and Slow Pointers
• Sorting Algorithms
• Searching Algorithms
• Prefix Sum

• In-place Reversal of a Linked List
• Linked Lists
• Stacks and Queues
• Queues and Deques

• Tree Breadth-First Search
• Tree Depth-First Search
• Topological Sort (Graph)
• Graph Basics and Traversals
• Graph Algorithms (DFS, BFS, Dijkstra's, Floyd-Warshall)

• 0/1 Knapsack
• Longest Common Substring
• Advanced Dynamic Programming
• Bitwise XOR
• Subsets

• Merge Intervals
• Cyclic Sort
• Greedy Strategies

• Modified Binary Search

• Two Heaps (Priority Queues)
• K-way Merge
• Trie (Prefix Tree)
• Segment Trees and Fenwick Trees
• Disjoint Set Union (Union-Find)
• Computational Geometry
• Number Theory
• String Matching Algorithms (KMP, Rabin-Karp, Z-Algorithm)
• Bit Manipulation Techniques

root/
 ├── DSA/ # Practice by topics (Leetcode & Codeforces)
 │ ├── arrays_and_strings/
 │ ├── linked_lists_and_stacks/
 │ ├── trees_and_graphs/
 │ ├── dynamic_programming/
 │ ├── greedy_algorithms/
 │ ├── divide_and_conquer/
 │ ├── advanced_topics/
 │ └── utils/
 ├── Leetcode/ # Practice by Contests and Study Plans
 │ ├── contests/
 │ ├── study_plans/
 ├── test/
 │ ├── DSA/
 │ ├── Leetcode/
 ├── README.md
 ├── .gitignore
 ├── pom.xml
 ├── build.gradle
 ├── LICENSE

Feel free to explore the repository and contribute your suggestions or solutions! 🚀