Welcome to My Competitive Programming Journey! 🚀✨

👋Hello there! 👋 I'm Nidhi Upman 😀, a passionate 🔥 competitive programmer 👩‍💻. I actively 💪 participate in CodeChef 🥘 contests 🏆 and continuously 🔄 improve my coding skills 💻. Here's a bit about my journey 🛤️ and the various topics 📚 I've mastered 🧠 along the way 🛤️.

My CodeChef Journey 🏆

🏆In the beginning 🏁, I could only solve 🔍 1️⃣-2️⃣ questions ❓ in each contest 🏁. However, I never gave up 🙅‍♂️. After the contests 🏁, I would meticulously 🔍 upsolve 📈 the problems 🛠️ I couldn't solve 🔍 during the contest ⏱️. Over time ⏳, things started to make sense 💡, and I began solving more questions ❓. This persistent effort 💪 led me to become a 3-star 🌟 coder on CodeChef 🥘. 🌟

Every Wednesday 🗓️, I participate 🏃‍♂️ in the contests 🏆 without fail ❗. Additionally, I work 🛠️ on the remaining questions ❓ daily 🗓️ to ensure I don't leave any stone unturned 🔄.

Languages and Tools 🛠️

Most of my solutions ✔️ are in C++ 💻. Here are some of the key 🔑 topics 📚 and techniques 🧠 I've learned 📘 and used 🛠️ to solve problems ❓:

Data Structures & Algorithms 📚

• Arrays 📊
• Strings 🔤
• Linked Lists 🔗
• Stacks and Queues 📚
• Graphs 🌐
• Trees 🌳
• Binary Trees 🌲
• Binary Search Trees 🔍
• Heaps 🗑️
• Tries 🌳

Algorithmic Techniques 💡

• Dynamic Programming 🧩
• Greedy Algorithms 💰
• Divide and Conquer ⚔️
• Backtracking 🔙
• Recursion 🔄
• Bit Manipulation 🔢
• Bitwise Operations ⚙️

Other Important Topics 🔍

• Hashing 🗝️
• Matrix Operations ➗
• Searching and Sorting 🔄
• Graph Algorithms 🌐

Topic-Wise and Sub-Topic Wise Breakdown 📂

1. Arrays 📊

• Introduction 🎓
• Operations: Insertion ✍️, Deletion 🗑️
• Two-pointer technique 👬
• Sliding window technique 🚪

2. Strings 🔤

• Basic operations 🛠️
• String matching algorithms 🔍
• Pattern searching 🔍
• String manipulation 🔄

3. Linked Lists 🔗

• Singly linked list 🧵
• Doubly linked list 🔗🔗
• Circular linked list 🔄

4. Stacks and Queues 📚

• Stack operations 📚
• Queue operations 🚶‍♂️
• Priority queues 🎯

5. Graphs 🌐

• Representation of graphs 🌉
• Graph traversal: BFS 🔄, DFS 🔍
• Shortest path algorithms: Dijkstra's 🛤️, Floyd-Warshall 🌐
• Minimum spanning tree: Kruskal's 🌳, Prim's 🌿

6. Trees 🌳

• Tree traversal: In-order 🔄, Pre-order 🔍, Post-order 🔄
• Binary search trees 🌲
• AVL trees 🌳
• Segment trees 📊
• Fenwick trees (Binary Indexed Tree) 🌳

7. Heaps 🗑️

• Binary heaps 🌲
• Min-heap 📉, Max-heap 📈
• Heap operations 🛠️

8. Dynamic Programming 🧩

• Memoization 📝
• Tabulation 📊
• Common DP problems ❓: Knapsack 🎒, Longest Increasing Subsequence 📈

9. Greedy Algorithms 💰

• Activity selection 🎯
• Huffman coding 🔍
• Fractional knapsack 🎒

10. Recursion 🔄

• Base case 🛠️ and recursive case 🔄
• Recurrence relations 🔄
• Backtracking 🔙

11. Bit Manipulation 🔢

• Basic bitwise operations 🛠️
• Bitwise hacks 🔍
• Applications in problems ❓

12. Searching and Sorting 🔄

• Binary search 🔍
• Merge sort 🔄
• Quick sort ⏩
• Counting sort 🔢

13. Graph Algorithms 🌐

• Shortest path algorithms 🛤️
• Topological sort 🔄
• Strongly connected components 🔗

Feel free to explore 🕵️‍♂️ my repositories 📁 to see my solutions 🛠️ and projects 🗂️. Each repository 📁 is organized topic-wise 📂 for your convenience 🛠️. Happy coding! 😊👩‍💻👨‍💻

---