https://github.com/nidhiupman568/codechef-problem-solved
π Hi! I'm Nidhi Upman, a passionate π©βπ» competitive programmer π₯ active on CodeChef π₯. Starting with just solving 1οΈβ£-2οΈβ£ questions β, I persisted πͺ, upsolving π to master π§ and achieve 3-star π status. Every Wednesday ποΈ, I tackle contests π and daily π practice ensures continuous improvement π».
https://github.com/nidhiupman568/codechef-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: 3 months ago
JSON representation
π Hi! I'm Nidhi Upman, a passionate π©βπ» competitive programmer π₯ active on CodeChef π₯. Starting with just solving 1οΈβ£-2οΈβ£ questions β, I persisted πͺ, upsolving π to master π§ and achieve 3-star π status. Every Wednesday ποΈ, I tackle contests π and daily π practice ensures continuous improvement π».
- Host: GitHub
- URL: https://github.com/nidhiupman568/codechef-problem-solved
- Owner: nidhiupman568
- Created: 2023-06-02T03:09:41.000Z (about 3 years ago)
- Default Branch: main
- Last Pushed: 2025-02-16T18:20:50.000Z (over 1 year ago)
- Last Synced: 2025-10-10T00:03:12.179Z (8 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://www.codechef.com/users/upmanyunidhi09
- Size: 1.61 MB
- Stars: 4
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 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! ππ©βπ»π¨βπ»
---