Competitive-Programming

KO | EN

gitlite — search

#typescript #ai-agents #deepseek-harness #dsh-plugin #open-source #ai #claude-code #cli #windows #codex #developer-tools #dsh

Competitive-Programming

★ 41 Open GitHub ↗

Competitive Programming || Day to day problem solving Data Structure, Algorithms & Top Interview Questions. 💤 Contributors are always invited. ✔ | Learn | Help | Grow | Target commits: 1000+ | Challenge Solving 450QUESTIONS by Babbar! | Day 15 Today's Questions in Readme |

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

<h1 align="center">
 Don't just push your CODE
 
 Push your limits too!
 
</h1>

 Get access to Topic by Topic resource including explaination and top questions by opening topic folder

[<img src="https://img.shields.io/badge/WhatsApp-25D366?style=for-the-badge&logo=whatsapp&logoColor=white">](https://chat.whatsapp.com/F5CTKT3cFYY5Zn1TIT7CC4) [<img src="https://img.shields.io/badge/Discord-7289DA?style=for-the-badge&logo=discord&logoColor=white">](https://discord.gg/nj4CSsqZ2b)

![Contributors](https://img.shields.io/github/contributors/Ratndeepk/Competitive-Programming)
![Size](https://img.shields.io/github/repo-size/Ratndeepk/Competitive-Programming)
[![GitHub license](https://img.shields.io/github/license/Naereen/StrapDown.js.svg)](https://github.com/Ratndeepk/Competitive-Programming/blob/master/LICENSE)

### Old questions are available in [wiki](https://github.com/Ratndeepk/Competitive-Programming/wiki)!  ![Stars](https://img.shields.io/github/stars/Ratndeepk/Competitive-Programming?style=social)  🐞

## Day 15 (450Q Babbar) 🚀
* https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1
* https://practice.geeksforgeeks.org/problems/transform-to-sum-tree/1
* https://practice.geeksforgeeks.org/problems/construct-tree-1/1
* https://www.geeksforgeeks.org/minimum-swap-required-convert-binary-tree-binary-search-tree/#:~:text=Given%20the%20array%20representation%20of,it%20into%20Binary%20Search%20Tree.&text=Swap%201%3A%20Swap%20node%208,node%209%20with%20node%2010.
* https://practice.geeksforgeeks.org/problems/sum-tree/1

### Books:
* [Handbook](https://drive.google.com/file/d/1tii1TyA5ETd4LtzN9MGrCVl5s0PsUI_X/view)  
* [Cracking the Coding Interview](https://cin.ufpe.br/~fbma/Crack/Cracking%20the%20Coding%20Interview%20189%20Programming%20Questions%20and%20Solutions.pdf) 🔥
* [DBMS Sheet](https://whimsical.com/dbms-roadmap-by-love-babbar-FmUi8ffVop33t3MmpVxPCo)
### Important Links
* [CP-Algorithms](https://cp-algorithms.com/) 
* [Geeksforgeeks (Top Interview Questions)](https://www.geeksforgeeks.org/must-do-coding-questions-for-companies-like-amazon-microsoft-adobe/) 
* [Leetcode (Top Interview Questions)](https://leetcode.com/explore/interview/card/top-interview-questions-hard/) 
* [Coding Simplified](https://thecodingsimplified.com/)

## Important Subjects:
* [DataStructure & Algorithms](https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/index.htm)
* [Operating System](http://www.uobabylon.edu.iq/download/M.S%202013-2014/Operating_System_Concepts,_8th_Edition%5BA4%5D.pdf)
* [Computer Networks](http://index-of.es/Varios-2/Computer%20Networks%205th%20Edition.pdf)
* [DataBase Management Systems](http://pages.cs.wisc.edu/~dbbook/openAccess/thirdEdition/solutions/ans3ed-oddonly.pdf)
* [Object Oriented Programming](https://www.youtube.com/watch?v=-DP1i2ZU9gk&t=1084s&ab_channel=MITOpenCourseWare)
## Contributors: 
<a href="https://github.com/Ratndeepk/Competitive-Programming/graphs/contributors">
 <img src="https://contributors-img.web.app/image?repo=Ratndeepk/Competitive-Programming" /></a>

## Topics Covering Soon:

[Array](https://github.com/Ratndeepk/Competitive-Programming/tree/master/array):

Subarray with given sum ,
Count the triplets ,
Kadane’s Algorithm ,
Missing number in array ,
Merge two sorted arrays ,
Rearrange array alternatively ,
Number of pairs ,
Inversion of Array ,
Sort an array of 0s, 1s and 2s ,
Equilibrium point ,
Leaders in an array,
Minimum Platforms,
Reverse array in groups,
K’th smallest element,
Trapping Rain Water,
Pythagorean Triplet,
Chocolate Distribution Problem,
Stock buy and sell,
Element with left side smaller and right side greater,
Convert array into Zig-Zag fashion,
Last Index of 1,
Spirally traversing a matrix,
Largest Number formed from an Array,

[String](https://github.com/Ratndeepk/Competitive-Programming/tree/master/string) :

Reverse words in a given string,
Permutations of a given string,
Longest Palindrome in a String,
Recursively remove all adjacent duplicates,
Check if string is rotated by two places,
Roman Number to Integer,
Anagram,
Remove Duplicates,
Form a Palindrome,
Longest Distinct Characters in the string,
Implement Atoi,
Implement strstr,
Longest Common Prefix,

[Linked List](https://github.com/Ratndeepk/Competitive-Programming/tree/master/linkedlist) :

Finding middle element in a linked list,
Reverse a linked list,
Rotate a Linked List,
Reverse a Linked List in groups of given size,
Intersection point in Y shaped linked lists,
Detect Loop in linked list,
Remove loop in Linked List,
n’th node from end of linked list,
Flattening a Linked List,
Merge two sorted linked lists,
Intersection point of two Linked Lists,
Pairwise swap of a linked list,
Add two numbers represented by linked lists,
Check if Linked List is Palindrome,
Implement Queue using Linked List,
Implement Stack using Linked List,
Given a linked list of 0s, 1s and 2s, sort it,
Delete without head pointer,

[Stack and Queue](https://github.com/Ratndeepk/Competitive-Programming/tree/master/linkedlist) :

Parenthesis Checker,
Next larger element,
Queue using two Stacks,
Stack using two queues,
Get minimum element from stack,
LRU Cache,
Circular tour,
First non-repeating character in a stream,
Rotten Oranges,
Maximum of all subarrays of size k,

Tree :

Print Left View of Binary Tree,
Check for BST,
Print Bottom View of Binary Tree,
Print a Binary Tree in Vertical Order,
Level order traversal in spiral form,
Connect Nodes at Same Level,
Lowest Common Ancestor in a BST,
Convert a given Binary Tree to Doubly Linked List,
Write Code to Determine if Two Trees are Identical or Not,
Given a binary tree, check whether it is a mirror of itself,
Height of Binary Tree,
Maximum Path Sum,
Diameter of a Binary Tree,
Number of leaf nodes,
Check if given Binary Tree is Height Balanced or Not,
Serialize and Deserialize a Binary Tree,

Heap :

Find median in a stream,
Heap Sort,
Operations on Binary Min Heap,
Rearrange characters,
Kth largest element in a stream,
Merge K sorted linked lists,
Kth largest element in a stream,

Recursion :

Flood fill Algorithm,
Number of paths,
Combination Sum – Part 2,
Special Keyboard,
Josephus problem,

Hashing :

Relative Sorting,
Sorting Elements of an Array by Frequency,
Largest subarray with 0 sum,
Common elements,
Find all four sum numbers,
Swapping pairs make sum equal,
Count distinct elements in every window,
Array Pair Sum Divisibility Problem,
Longest consecutive subsequence,
Array Subset of another array,
Find all pairs with a given sum,
Find first repeated character,
Zero Sum Subarrays,
Minimum indexed character,
Check if two arrays are equal or not,
Uncommon characters,
Smallest window in a string containing all the characters of another string,
First element to occur k times,
Check if frequencies can be equal,

Graph :

Depth First Traversal,
Breadth First Traversal,
Detect cycle in undirected graph,
Detect cycle in a directed graph,
Topological sort,
Find the number of islands,
Implementing Dijkstra,
Minimum Swaps,
Strongly Connected Components,
Shortest Source to Destination Path,
Find whether path exist,
Minimum Cost Path,
Circle of Strings,
Floyd Warshall,
Alien Dictionary,
Snake and Ladder Problem,

Greedy :

Activity Selection,
N meetings in one room,
Coin Piles,
Maximize Toys,
Page Faults in LRU,
Largest number possible,
Minimize the heights,
Minimize the sum of product,
Huffman Decoding,
Minimum Spanning Tree,
Shop in Candy Store,
Geek collects the balls,

Dynamic Programming :

Minimum Operations,
Max length chain,
Minimum number of Coins,
Longest Common Substring,
Longest Increasing Subsequence,
Longest Common Subsequence,
0 – 1 Knapsack Problem,
Maximum sum increasing subsequence,
Minimum number of jumps,
Edit Distance,
Coin Change Problem,
Subset Sum Problem,
Box Stacking,
Rod Cutting,
Path in Matrix,
Minimum sum partition,
Count number of ways to cover a distance,
Egg Dropping Puzzle,
Optimal Strategy for a Game,
Shortest Common Supersequence,

Divide and Conquer :

Find the element that appears once in sorted array,
Search in a Rotated Array,
Binary Search,
Sum of Middle Elements of two sorted arrays,
Quick Sort,
Merge Sort,
K-th element of two sorted Arrays,

Backtracking :

N-Queen Problem,
Solve the Sudoku,
Rat in a Maze Problem,
Word Boggle,
Generate IP Addresses,

Bit Magic :

Find first set bit,
Rightmost different bit,
Check whether K-th bit is set or not,
Toggle bits given range,
Set kth bit,
Power of 2,
Bit Difference,
Rotate Bits,
Swap all odd and even bits,
Count total set bits,
Longest Consecutive 1’s,
Sparse Number,
Alone in a couple,
Maximum subset XOR,

Some More Questions on Arrays :

Find Missing And Repeating,
Maximum Index,
Consecutive 1’s not allowed,
Majority Element,
Two numbers with sum closest to zero,
Nuts and Bolts Problem,
Boolean Matrix Problem,
Smallest Positive missing number,
Jumping Caterpillars,

Some More Questions on Strings :

Most frequent word in an array of strings,
CamelCase Pattern Matching,
String Ignorance,
Smallest window in a string containing all the characters of another string,
Design a tiny URL or URL shortener,
Permutations of a given string,
Non Repeating Character,
Check if strings are rotations of each other or not,
Save Ironman,
Repeated Character,
Remove common characters and concatenate,
Geek and its Colored Strings,
Second most repeated string in a sequence,

Some more Questions on Trees :

Mirror Tree,
Longest consecutive sequence in Binary tree,
Bottom View of Binary Tree,
Lowest Common Ancestor in a Binary Tree,
Binary to DLL,

Competitive-Programming

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README