A curated collection of important and high-quality coding problems solved from different competitive programming platforms.
This repository is created to strengthen Data Structures & Algorithms, improve problem-solving skills, and maintain a well-organized reference for future revision and interviews.
- ✅ LeetCode (LC)
- ✅ Codeforces (CF)
- ✅ GeeksforGeeks (GFG)
- 📘 Hand-picked good-quality problems
- 🧩 Problems ranging from easy → medium → hard
- ⚡ Optimized and clean solutions
- 🧠 Logical explanations where required
- 🎯 Frequently asked interview problems
- 🏆 Competitive programming standard approaches
- Arrays & Strings
- Two Pointers
- Sliding Window
- Prefix Sum
- Hashing
- Recursion & Backtracking
- Linked List
- Stack & Queue
- Binary Search
- Trees & BST
- Graphs (BFS / DFS / Shortest Path)
- Dynamic Programming
- Greedy Algorithms
- Bit Manipulation
- 🔹 Daily DSA practice
- 🔹 Interview preparation
- 🔹 Competitive programming improvement
- 🔹 Revision before contests
- 🔹 Maintain clean solution archive
- ✅ Clean and readable code
- ✅ Optimized solutions
- ✅ Covers real interview patterns
- ✅ Regularly updated
- ✅ Beginner to advanced friendly
- LeetCode – DSA & Interview focused
- Codeforces – Competitive logic & speed
- GeeksforGeeks – Core concept strengthening
- Clone the repository:
git clone https://github.com/premmsharma122/coding-plateform-question.git
| 1461-check-if-a-string-contains-all-binary-codes-of-size-k |
| 1461-check-if-a-string-contains-all-binary-codes-of-size-k |
| 0002-add-two-numbers |
| 0021-merge-two-sorted-lists |
| 0206-reverse-linked-list |
| 0233-number-of-digit-one |
| 0273-integer-to-english-words |
| 0509-fibonacci-number |
| 1545-find-kth-bit-in-nth-binary-string |
| 0139-word-break |
| 2452-words-within-two-edits-of-dictionary |
| 3043-find-the-length-of-the-longest-common-prefix |
| 3093-longest-common-suffix-queries |
| 0139-word-break |
| 0509-fibonacci-number |
| 1584-min-cost-to-connect-all-points |
| 3600-maximize-spanning-tree-stability-with-upgrades |
| 1483-kth-ancestor-of-a-tree-node |
| 1622-fancy-sequence |
| 2069-walking-robot-simulation-ii |
| 0207-course-schedule |
| 0210-course-schedule-ii |
| 0796-rotate-string |
| 3474-lexicographically-smallest-generated-string |
| 3464-maximize-the-distance-between-points-on-a-square |
| 0084-largest-rectangle-in-histogram |
| 0316-remove-duplicate-letters |
| 1081-smallest-subsequence-of-distinct-characters |
| 0743-network-delay-time |
| 3286-find-a-safe-walk-through-a-grid |
| 3161-block-placement-queries |
| 2097-valid-arrangement-of-pairs |
| 1833-maximum-ice-cream-bars |
| 3517-smallest-palindromic-rearrangement-i |
| 3737-count-subarrays-with-majority-element-i |
| 3739-count-subarrays-with-majority-element-ii |
| 2251-number-of-flowers-in-full-bloom |
| 3312-sorted-gcd-pair-queries |
| 3518-smallest-palindromic-rearrangement-ii |
| 0347-top-k-frequent-elements |
| 0451-sort-characters-by-frequency |
| 0347-top-k-frequent-elements |
| 0877-stone-game |
| 1140-stone-game-ii |
| 1406-stone-game-iii |
| 1140-stone-game-ii |
| 1406-stone-game-iii |
| 1140-stone-game-ii |
| 1406-stone-game-iii |