👋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 🛤️.
🏆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 🔄.
Most of my solutions ✔️ are in C++ 💻. Here are some of the key 🔑 topics 📚 and techniques 🧠 I've learned 📘 and used 🛠️ to solve problems ❓:
- Arrays 📊
- Strings 🔤
- Linked Lists 🔗
- Stacks and Queues 📚
- Graphs 🌐
- Trees 🌳
- Binary Trees 🌲
- Binary Search Trees 🔍
- Heaps 🗑️
- Tries 🌳
- Dynamic Programming 🧩
- Greedy Algorithms 💰
- Divide and Conquer ⚔️
- Backtracking 🔙
- Recursion 🔄
- Bit Manipulation 🔢
- Bitwise Operations ⚙️
- Hashing 🗝️
- Matrix Operations ➗
- Searching and Sorting 🔄
- Graph Algorithms 🌐
- Introduction 🎓
- Operations: Insertion ✍️, Deletion 🗑️
- Two-pointer technique 👬
- Sliding window technique 🚪
- Basic operations 🛠️
- String matching algorithms 🔍
- Pattern searching 🔍
- String manipulation 🔄
- Singly linked list 🧵
- Doubly linked list 🔗🔗
- Circular linked list 🔄
- Stack operations 📚
- Queue operations 🚶♂️
- Priority queues 🎯
- Representation of graphs 🌉
- Graph traversal: BFS 🔄, DFS 🔍
- Shortest path algorithms: Dijkstra's 🛤️, Floyd-Warshall 🌐
- Minimum spanning tree: Kruskal's 🌳, Prim's 🌿
- Tree traversal: In-order 🔄, Pre-order 🔍, Post-order 🔄
- Binary search trees 🌲
- AVL trees 🌳
- Segment trees 📊
- Fenwick trees (Binary Indexed Tree) 🌳
- Binary heaps 🌲
- Min-heap 📉, Max-heap 📈
- Heap operations 🛠️
- Memoization 📝
- Tabulation 📊
- Common DP problems ❓: Knapsack 🎒, Longest Increasing Subsequence 📈
- Activity selection 🎯
- Huffman coding 🔍
- Fractional knapsack 🎒
- Base case 🛠️ and recursive case 🔄
- Recurrence relations 🔄
- Backtracking 🔙
- Basic bitwise operations 🛠️
- Bitwise hacks 🔍
- Applications in problems ❓
- Binary search 🔍
- Merge sort 🔄
- Quick sort ⏩
- Counting sort 🔢
- 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! 😊👩💻👨💻