π 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. π
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! π
Most of my solutions are in C++ π». Here are the key topics and techniques I've utilized to solve problems:
- Arrays π
- Strings π€
- Linked Lists π
- Graphs π
- Trees π³
- Dynamic Programming π§©
- Recursion π
- Sorting and Searching π
- Backtracking π
- Bit Manipulation π’
- Greedy Algorithms π°
- Binary Search π
- Hashing ποΈ
- Tries π³
- Segment Trees π
- Heap Data Structure ποΈ
- Matrix Operations β
- Bitwise Operations βοΈ
- Binary Search Trees π
- Divide and Conquer βοΈ
- Stacks and Queues π
- Basic operations π οΈ
- Two-pointer technique π¬
- Sliding window technique πͺ
- String manipulation π
- Pattern matching algorithms π
- Trie data structure π³
- Singly linked lists π§΅
- Doubly linked lists ππ
- Circular linked lists π
- Representation and traversal πΆββοΈ
- Shortest path algorithms π€οΈ
- Minimum spanning tree algorithms π³
- Binary search trees π²
- AVL trees π³
- Fenwick trees (Binary Indexed Tree) π³
- Memoization and tabulation π
- Knapsack and LCS problems π
- Quick sort and merge sort π
- Binary search techniques π
- 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! ππ©βπ»π¨βπ»