You can use the Github editor or Directly upload your Files.
Please use your branch for commits.
Its collabarative work, please express and ask.
-Priytosh Tripathi
-
Kadane's Algorithm.
-
Egg Dropping Problem.
-
Stock Market / Skyline Problem.
-
Convert BST to Heap in Linear Time.
-
Exchange A[i] with A[A[i]] without extra space , if 0 <= A[i] <= (n-1).
-
Coin Change Problem.
-
Given a number , find the next largest prime number.
-
Given a number , find the next largest pallindrom number.
-
Rain Water Trapping Problem.
-
Find the Number of Unique pallindromic substring in a given string.
-
Find if there is a loop in a Linked list (Single).
-
If there's a loop, find the starting Point.
-
Find the Kth element from the last of the linked list in a Single Traversal.
-
Quick Search.
-
Max Heap / Heapify Procedure.
-
Find the Left view of a Binary Tree.
-
Find the Bottom view of a Binary Tree.
-
Given a String, break it into Substrings wherever you encounter a Special Character and Print those Substrings.
-
Given a Binary Matrix , find the largest rectangle of 0's.
-
Given a Binary Matrix , find the largest Square of 0's.
-
Given a Binary Matrix , find the largest Island of 0's.
-
Sieve of Erasthothenus.
-
Minimum number of Platforms needed for every train can hault at the given Station.
-
Longest Common subsequence / Minimum edit distance.
-
Kth smallest element in an Array.
-
Merge K sorted Array.
-
Aggressive Cows Problem ( SPOJ : AGGRCOW ).
-
Painter's Puzzle.
-
Convert a given String of Numerals to a Pallindrom with least number of Changes.
-
Find the Intersection point of two Linked List.
-
Diameter of a Binary Tree.
-
Level Order Traversal.
-
Set Kth Bit.
-
Lowest Common Ancestor.
-
Maximum ___________ XOR for an Array of Even Numbers.