An open API service indexing awesome lists of open source software.

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 πŸ’».

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! πŸ˜ŠπŸ‘©β€πŸ’»πŸ‘¨β€πŸ’»

---