/Codeforces-Problem-Solved

πŸ‘‹Hello!πŸ‘‹ I'm Nidhi UpmanπŸ˜€, a passionate competitive programmer on CodeforcesπŸ†. Started with basic problems (like A) and never gave up! πŸš€ Upsolving after contests πŸ“ˆ improved my skills. Now tackling tougher challenges (like B) 🧠. Codeforces hosts contests 2-3 times weekly πŸ—“οΈ and daily challenges to stay sharp. Determined to climb to Pupil.πŸ’ͺ

Primary LanguageC++

πŸš€βœ¨ Welcome to My Coding Journey! πŸš€βœ¨

πŸ‘‹ Hello there! πŸ‘‹ I'm Nidhi Upman πŸ˜€, a dedicated competitive programmer 🌟 actively participating on Codeforces πŸ†. Let me take you through my journey and the topics I've mastered along the way. πŸš€

My Codeforces Journey πŸ†

In the beginning, πŸ₯³ I could solve basic problems (like A) during contests 🏁, but struggled with tougher ones. πŸ˜… However, I never gave up! πŸ’ͺ After each contest, 🏁 I diligently upsolved problems πŸ“ˆ that stumped me, gradually improving my skills. πŸ”§ Soon, I began tackling more challenging problems (like B), 🧠 gaining deeper insights into advanced concepts. πŸ’‘

Codeforces hosts contests 2-3 times every week, πŸ—“οΈ keeping me engaged and sharpening my skills. ✨ Outside of contests, 🏁 I tackle daily challenges πŸ“… that I couldn't crack during the competition. πŸ‹οΈ

I'm currently a Codeforces newbie, πŸ‘Ά but I'm determined to climb up the ranks through hard work and perseverance. πŸ’ͺ My goal is to swiftly move up to Pupil and beyond! πŸš€

Languages and Tools πŸ› οΈ

Most of my solutions are in C++ πŸ’». Here are the key topics and techniques I've utilized to solve problems:

Data Structures & Algorithms πŸ“š

  • Arrays πŸ“Š
  • Strings πŸ”€
  • Linked Lists πŸ”—
  • Graphs 🌐
  • Trees 🌳
  • Dynamic Programming 🧩
  • Recursion πŸ”„
  • Sorting and Searching πŸ”

Advanced Techniques πŸ’‘

  • Backtracking πŸ”™
  • Bit Manipulation πŸ”’
  • Greedy Algorithms πŸ’°
  • Binary Search πŸ”
  • Hashing πŸ—οΈ
  • Tries 🌳
  • Segment Trees πŸ“Š
  • Heap Data Structure πŸ—‘οΈ

Other Important Topics πŸ”

  • Matrix Operations βž—
  • Bitwise Operations βš™οΈ
  • Binary Search Trees πŸ”
  • Divide and Conquer βš”οΈ
  • Stacks and Queues πŸ“š

Topic-Wise and Sub-Topic Wise Breakdown πŸ“‚

1. Arrays πŸ“Š

  • Basic operations πŸ› οΈ
  • Two-pointer technique πŸ‘¬
  • Sliding window technique πŸšͺ

2. Strings πŸ”€

  • String manipulation πŸ”„
  • Pattern matching algorithms πŸ”
  • Trie data structure 🌳

3. Linked Lists πŸ”—

  • Singly linked lists 🧡
  • Doubly linked lists πŸ”—πŸ”—
  • Circular linked lists πŸ”„

4. Graphs 🌐

  • Representation and traversal πŸšΆβ€β™‚οΈ
  • Shortest path algorithms πŸ›€οΈ
  • Minimum spanning tree algorithms 🌳

5. Trees 🌳

  • Binary search trees 🌲
  • AVL trees 🌳
  • Fenwick trees (Binary Indexed Tree) 🌳

6. Dynamic Programming 🧩

  • Memoization and tabulation πŸ“
  • Knapsack and LCS problems πŸŽ’

7. Sorting and Searching πŸ”

  • Quick sort and merge sort πŸ”„
  • Binary search techniques πŸ”

8. Advanced Topics 🌟

  • Matrix exponentiation πŸ“Š
  • Computational geometry πŸ“
  • Number theory algorithms πŸ”’

Feel free to explore my repositories πŸ“‚ to delve deeper into each topic and see my solutions and projects. Happy coding! πŸ˜ŠπŸ‘©β€πŸ’»πŸ‘¨β€πŸ’»