🌟 Welcome to My LeetCode Journey! 🌟

Hello! I'm excited to share my progress and accomplishments on LeetCode with you. 🚀✨

🌐 About Me

🏆🌟 I solve the Problem of the Day on LeetCode daily 🗓️🧩 and have successfully tackled over 150 interview questions. 💪🧠 Additionally, I've completed Love Babbar's 450 DSA sheet 📚 and Striver's 180 DSA sheet 📘. My primary coding language is C++ 💻, but I have also solved many problems in Java ☕. 🏆🌟

🏆 My Achievements

• Solved 150+ LeetCode interview questions 🔥
• Completed Love Babbar's 450 DSA sheet 📚
• Completed Fraz's 180 DSA sheet 📘
• Proficient in C++ and Java 💻

🚀 Topics and Subtopics Mastered

Here’s a detailed list of the topics and subtopics I have mastered, categorized and neatly organized:

🚀 C++ and Java

• Basic Syntax 📝
• Object-Oriented Programming 🧩
• STL (Standard Template Library) 📚

🌳 Data Structures

• Linked List: Singly, Doubly, Circular 🔗
• Graphs: BFS, DFS, Dijkstra’s, Prim’s, Kruskal’s 🌐
• Trees: Binary Trees, Binary Search Trees, AVL Trees 🌲
• Heaps: Min-Heap, Max-Heap ⛏️
• Tries: Prefix Trees 📚
• Stacks and Queues: Stack, Queue, Priority Queue 📊

🧩 Algorithms

• Sorting: Quick Sort, Merge Sort, Heap Sort 🔄
• Searching: Binary Search, Linear Search 🔍
• Dynamic Programming: Memoization, Tabulation 🎯
• Greedy Algorithms: Activity Selection, Huffman Coding 🤑
• Backtracking: N-Queens, Sudoku Solver ♟️
• Divide and Conquer: Merge Sort, Quick Sort ⚔️
• Bit Manipulation: Bitwise AND, OR, XOR 🧩

📈 Advanced Topics

• Graphs: Bellman-Ford, Floyd-Warshall, Topological Sort 🌐
• Recursion: Basic to Advanced Recursion Techniques ♾️
• Matrix: Spiral Order, Search in Sorted Matrix, Rotate Matrix 🔄
• Hashing: Hash Maps, Hash Sets, Collision Handling 🔑

🔥 Additional Competitive Programming Topics

• Fenwick Tree: Binary Indexed Tree 🌳
• Segment Tree: Range Queries, Lazy Propagation 🌲
• Union-Find: Disjoint Set Union (DSU) 📌
• String Algorithms: KMP, Rabin-Karp, Z Algorithm 📝
• Game Theory: Nim Game, Grundy Numbers 🎮
• Geometry: Convex Hull, Line Intersection 📐
• Number Theory: Sieve of Eratosthenes, Modular Arithmetic 🔢

📅 Daily Practice

I consistently solve the LeetCode Problem of the Day to stay sharp and up-to-date with different problem-solving techniques. 🧠💡

📂 Repository Structure

Here's how this repository is structured for easy navigation:

LeetCode-Journey/
|
├── C++/
|   ├── LinkedList/
|   ├── Graphs/
|   ├── Strings/
|   ├── Matrix/
|   ├── Trie/
|   ├── Hash/
|   ├── Recursion/
|   ├── Backtracking/
|   ├── BitManipulation/
|   ├── Greedy/
|   ├── BinarySearchTree/
|   ├── Arrays/
|   ├── Heap/
|   ├── DynamicProgramming/
|   ├── BinaryTrees/
|   ├── DivideAndConquer/
|   ├── StacksAndQueues/
|   ├── SearchingAndSorting/
|   ├── FenwickTree/
|   ├── SegmentTree/
|   ├── UnionFind/
|   ├── StringAlgorithms/
|   ├── GameTheory/
|   ├── Geometry/
|   ├── NumberTheory/
|
├── Java/
|   ├── LinkedList/
|   ├── Graphs/
|   ├── Strings/
|   ├── Matrix/
|   ├── Trie/
|   ├── Hash/
|   ├── Recursion/
|   ├── Backtracking/
|   ├── BitManipulation/
|   ├── Greedy/
|   ├── BinarySearchTree/
|   ├── Arrays/
|   ├── Heap/
|   ├── DynamicProgramming/
|   ├── BinaryTrees/
|   ├── DivideAndConquer/
|   ├── StacksAndQueues/
|   ├── SearchingAndSorting/
|   ├── FenwickTree/
|   ├── SegmentTree/
|   ├── UnionFind/
|   ├── StringAlgorithms/
|   ├── GameTheory/
|   ├── Geometry/
|   ├── NumberTheory/
|
└── README.md

Feel free to explore each directory for detailed solutions and explanations of the problems I've solved. Happy coding! 😊

---

Leetcode-Solved-Problems