https://github.com/nidhiupman568/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.πͺ
https://github.com/nidhiupman568/codeforces-problem-solved
arrays backtracking binary-search-tree binary-trees bit-manipulation bitwise c-plus-plus divide-and-conquer dynamic-programming graphs greedy hash heap linked-list matrix recursion searching-and-sorting stacks-and-queues strings trie
Last synced: 8 months ago
JSON representation
π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.πͺ
- Host: GitHub
- URL: https://github.com/nidhiupman568/codeforces-problem-solved
- Owner: nidhiupman568
- Created: 2023-06-02T03:08:05.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2025-05-20T12:40:48.000Z (10 months ago)
- Last Synced: 2025-06-06T15:04:51.996Z (9 months ago)
- Topics: arrays, backtracking, binary-search-tree, binary-trees, bit-manipulation, bitwise, c-plus-plus, divide-and-conquer, dynamic-programming, graphs, greedy, hash, heap, linked-list, matrix, recursion, searching-and-sorting, stacks-and-queues, strings, trie
- Language: C++
- Homepage: https://codeforces.com/profile/upmanyunidhi02930
- Size: 1.19 MB
- Stars: 8
- Watchers: 2
- Forks: 1
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# πβ¨ 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! ππ©βπ»π¨βπ»