Given an array, print all unique subsets with a given sum. | Intermediate | 2020-01-26 22:16:21 |

Sum of length of subsets which contains given value K and all elements in subsets are less than equal to K. | Intermediate | 2020-01-20 21:59:47 |

Replace array elements with maximum element on the right. | Intermediate | 2020-01-18 20:26:28 |

Find all unique combinations of numbers (from 1 to 9 ) with sum to N | Intermediate | 2020-01-12 22:17:38 |

Number of Intervals in which given value lies | Beginner | 2020-01-10 23:19:08 |

Unique Integers in array that sum up to zero. | Intermediate | 2020-01-08 21:59:39 |

Activity Selection Problem | Intermediate | 2020-01-06 21:38:14 |

Find the sum of overlapping elements in two sets | Beginner | 2020-01-04 21:16:53 |

Given two coordinates, Print the line equation | Beginner | 2020-01-02 21:56:43 |

Check if Graph is Bipartite – Adjacency List using Breadth-First Search(BFS) | Expert | 2019-12-30 22:29:10 |

Articulation Points OR Cut Vertices in a Graph | Expert | 2019-12-28 13:07:06 |

Print all middle elements of the given matrix/2D array. | Beginner | 2019-12-26 21:19:54 |

Check If Given Undirected Graph is a tree | Intermediate | 2019-12-24 21:53:37 |

Find the number of distinct Islands OR connected components. | Expert | 2019-12-22 20:58:19 |

Check the completeness of given binary tree | Set 2 – Using Level Order Traversal | Intermediate | 2019-12-20 12:50:19 |

Depth-First Search (DFS) in 2D Matrix/2D-Array – Recursive Solution | Beginner | 2019-12-18 21:00:32 |

Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm | Intermediate | 2019-12-16 22:10:46 |

Print All Paths in Dijkstra’s Shortest Path Algorithm | Expert | 2019-12-14 15:47:26 |

Hamming Distance between two given integers | Beginner | 2019-12-12 21:32:06 |

Breadth-First Search (BFS) in 2D Matrix/2D-Array | Beginner | 2019-12-10 20:43:34 |

Check the completeness of given binary tree | Set 1 – Using Node Count | Intermediate | 2019-12-08 12:36:18 |

Number of Islands using BFS | Intermediate | 2019-12-06 20:25:30 |

Find all the Armstrong numbers in the given range | Beginner | 2019-12-04 21:48:33 |

Check if the given binary tree is Full or not. | Beginner | 2019-12-02 14:56:32 |

Check if given undirected graph is connected or not | Beginner | 2019-11-30 14:44:26 |

Check if Graph is Bipartite – Adjacency List using Depth-First Search(DFS) | Expert | 2019-11-28 15:07:24 |

Print boundary of given matrix/2D array. | Beginner | 2019-11-26 21:11:14 |

Depth-First Search (DFS) in 2D Matrix/2D-Array – Iterative Solution | Beginner | 2019-11-24 20:52:46 |

Longest substring with at most K unique characters | Intermediate | 2019-11-22 21:22:47 |

Collatz Conjecture – Maximum Steps takes to transform (1, N) to 1. | Intermediate | 2019-11-20 21:17:01 |

Given Graph – Remove a vertex and all edges connect to the vertex | Intermediate | 2019-11-18 14:37:51 |

Print Stack in reverse order. | Beginner | 2019-11-16 21:36:18 |

Sort a given stack – Using Recursion | Expert | 2019-11-14 21:10:27 |

Given an array, Print sum of all subsets | Beginner | 2019-11-12 20:59:23 |

Determine the given routing number belong to which bank | Intermediate | 2019-11-10 15:41:50 |

Check if interval is covered in given coordinates | Intermediate | 2019-11-08 20:48:40 |

Lexicographically previous permutation With One swap | Intermediate | 2019-11-06 23:01:11 |

Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N | Intermediate | 2019-11-04 21:27:11 |

Number’s Complement – 2 Approaches | Intermediate | 2019-11-02 20:56:52 |

Print all subsets of an array with a sum equal to zero | Intermediate | 2019-10-30 23:31:12 |

Social Network Problem | Expert | 2019-10-28 22:48:55 |

Maximum number edges to make Acyclic Undirected/Directed Graph | Beginner | 2019-10-27 00:33:10 |

Evaluation of Prefix Expressions (Polish Notation) | Set 2 | Intermediate | 2019-10-24 22:03:52 |

Hamming Distance between two given strings | Beginner | 2019-10-22 15:30:12 |

Breadth-First Search in Disconnected Graph | Intermediate | 2019-10-20 22:02:37 |

ZigZag OR Diagonal traversal in 2d array/Matrix using queue | Intermediate | 2019-10-18 22:43:43 |

Check if Number is divisible by its digits | Beginner | 2019-10-16 19:51:17 |

Check if the given number is Armstrong number or not | Beginner | 2019-10-14 23:17:43 |

Evaluation of Prefix Expressions (Polish Notation) | Set 1 | Intermediate | 2019-10-12 16:46:38 |

Minimum Boats Required to rescue people | Intermediate | 2019-10-10 21:36:39 |

Number of Islands | Intermediate | 2019-10-08 21:50:42 |

Minimum No of operations required to convert a given number to 1 – Integer Replacement Problem. | Intermediate | 2019-10-06 16:00:02 |

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 2 | Intermediate | 2019-10-04 23:35:14 |

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1 | Intermediate | 2019-10-03 00:44:00 |

Find all the numbers in the range which has prime set bits. | Beginner | 2019-09-30 20:31:04 |

Check if Graph is Bipartite – Adjacency Matrix using Depth-First Search(DFS) | Expert | 2019-09-28 23:25:58 |

Check if Arithmetic Expression contains duplicate parenthesis | Intermediate | 2019-09-26 21:08:50 |

Introduction to Bipartite Graphs OR Bigraphs | Intermediate | 2019-09-25 20:54:08 |

Reverse the Directed Graph | Beginner | 2019-09-22 21:50:05 |

Round Price Problem | Expert | 2019-09-20 22:21:46 |

Smallest Number after Removing K digits | Expert | 2019-09-18 21:33:04 |

Find Third Smallest elements in a given array | Beginner | 2019-09-16 22:08:13 |

Determine the order of Tests when tests have dependencies on each other | Intermediate | 2019-09-14 23:57:36 |

Implement Graph Using Map – Java | Intermediate | 2019-09-12 20:30:54 |

Find the maximum number present in a String | Beginner | 2019-09-10 20:01:59 |

Count number of subgraphs in a given graph | Beginner | 2019-09-08 20:18:57 |

Reverse a Stack using recursion – In Place (Without using extra memory) | Expert | 2019-09-06 22:38:40 |

Check if given an edge is a bridge in the graph | Intermediate | 2019-09-04 20:59:33 |

Convert Prefix to Postfix Expression | Intermediate | 2019-09-02 23:01:26 |

Convert Roman Number to Integer | Beginner | 2019-08-31 01:35:12 |

Sort a given stack – Using Temporary Stack | Intermediate | 2019-08-30 19:49:53 |

Convert Postfix to Prefix Expression | Intermediate | 2019-08-28 20:59:02 |

K-Means Algorithm | Expert | 2019-08-24 22:40:20 |

Convert Integer to Roman | Intermediate | 2019-08-24 22:16:44 |

String to Integer (AtoI – ASCII to Integer) – Recursive Solution | Intermediate | 2019-08-22 23:40:21 |

Grouping of Anagrams | Intermediate | 2019-08-20 23:01:05 |

Print Processes and its messages from a given log file | Intermediate | 2019-08-18 23:49:12 |

Linear Search vs Binary Search | Beginner | 2019-08-16 23:52:54 |

Count the number of nodes in a given binary tree | Beginner | 2019-08-14 22:40:21 |

Sieve of Eratosthenes – Find all Prime Numbers less than equal to N | Set 2 | Intermediate | 2019-08-12 22:56:32 |

Longest contiguous character in a given String – O(N) Solution | Beginner | 2019-08-10 23:42:43 |

Convert Postfix to Infix Expression | Intermediate | 2019-08-08 23:27:35 |

Collatz Conjecture – Steps to transform Number to 1 | Beginner | 2019-08-06 23:48:10 |

String to Integer (AtoI – ASCII to Integer) | Beginner | 2019-08-04 01:07:26 |

Find all Prime Numbers less than equal to N | Set 1 | Beginner | 2019-07-28 00:42:00 |

Longest substring with at most two unique characters | Intermediate | 2019-07-24 00:14:11 |

Monotone Increasing Digits | Intermediate | 2019-07-15 23:33:05 |

Convert Prefix to Infix Expression | Intermediate | 2019-06-22 16:46:07 |

Convert Infix to Prefix Expression | Intermediate | 2019-06-12 23:49:19 |

Find third largest element in a given array | Beginner | 2019-05-29 20:21:18 |

Find duplicates Characters in the given String | Beginner | 2019-05-21 20:32:57 |

Max Flow Problem – Ford-Fulkerson Algorithm | Expert | 2019-05-16 22:05:48 |

Sum of all Unique elements in a given array | Beginner | 2019-05-07 21:13:04 |

Java program to find the largest element in array | Beginner | 2019-05-03 00:09:03 |

Convert Infix to Postfix Expression | Intermediate | 2019-04-23 23:28:26 |

Find three smallest elements in a given array | Beginner | 2019-04-16 00:07:24 |

Evaluation of Infix expressions | Intermediate | 2019-04-09 00:18:00 |

Stack Java Class – Explained | Beginner | 2019-04-03 21:59:05 |

Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 | Expert | 2019-04-01 21:59:32 |

Merge K sorted Linked List – Using Priority Queue | Expert | 2019-03-26 21:11:02 |

Infix, Postfix and Prefix Notations/Expressions | Beginner | 2019-03-24 23:20:58 |

Count Set bits in a given Number | Beginner | 2019-03-20 23:32:49 |

Check if array contains all unique or distinct numbers. | Beginner | 2019-03-16 23:47:03 |

Product of all Unique elements in a given array. | Beginner | 2019-03-03 22:36:36 |

Valid Multiple Parentheses | Intermediate | 2019-02-22 00:34:03 |

Reverse a given number – Java Code | Beginner | 2019-02-17 23:13:30 |

Check if given number is perfect square – O(√N) Solution | Beginner | 2019-02-09 13:48:09 |

Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1 | Expert | 2019-02-05 22:59:48 |

Find first three largest elements in a given array | Beginner | 2019-02-03 01:00:24 |

Selection Sort – Java Implementation | Beginner | 2019-01-29 22:46:26 |

Print Number with its Sign in Java | Beginner | 2019-01-28 00:55:46 |

Find the nearest building which has bike | Find nearest specific vertex from source in a graph. | Expert | 2019-01-26 23:13:34 |

Valid Brackets – Part 2 | Stack Method | Beginner | 2019-01-24 23:02:32 |

Find the roots of Quadratic Equation – Java Program | Beginner | 2019-01-23 20:52:50 |

Given two strings validate the output string | Beginner | 2019-01-21 20:33:39 |

Find Largest and Smallest word in a given String | Beginner | 2019-01-16 21:45:30 |

Generate all the strings of length n from 0 to k-1. | Intermediate | 2019-01-13 22:53:11 |

Find two smallest elements in a given array | Beginner | 2019-01-05 23:41:24 |

Front and Back Search in an Array | Beginner | 2018-12-30 01:09:19 |

Print all Unique elements in a given array | Beginner | 2018-12-19 01:50:07 |

Multiply with power of 2 without using pow() or * operator | Beginner | 2018-12-16 21:16:20 |

Find Number of reverse pairs in an array | Intermediate | 2018-12-15 14:10:38 |

Find first two largest elements in a given array | Beginner | 2018-12-13 00:04:40 |

Calculate Logn base r – Java Implementation | Beginner | 2018-12-11 01:00:54 |

Max Flow Problem – Introduction | Expert | 2018-12-09 20:35:40 |

Dijkstra Algorithm Implementation – TreeSet and Pair Class | Expert | 2018-11-21 15:10:26 |

Java Program to find Sum the elements of an Array | Beginner | 2018-11-21 14:33:54 |

Insertion Sort – Java Implementation | Beginner | 2018-11-19 21:59:01 |

Find Largest and Smallest word in a given String | Beginner | 2018-11-03 23:18:30 |

Check if Given Number is power of 2. | Beginner | 2018-10-27 18:26:37 |

Rotate the given array in cycles | Beginner | 2018-09-21 18:22:28 |

Heap Sort – Java Implementation | Intermediate | 2018-09-11 21:21:41 |

Print First n numbers in Fibonacci Series | Beginner | 2018-09-05 20:00:55 |

Find the Area and Perimeter of Rectangle – Java Program | Beginner | 2018-09-02 00:01:41 |

Find no of reverse pairs in an array which is sorted in two parts in O(N) | Expert | 2018-08-26 21:03:09 |

Reverse the given String using Stack | Beginner | 2018-08-22 22:10:50 |

Stack Data Structure – Introduction and Implementation | Beginner | 2018-08-21 00:03:08 |

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation | Expert | 2018-08-17 22:46:01 |

Bubble Sort and Optimized Bubble Sort- Java Implementation | Beginner | 2018-08-15 22:01:39 |

Find the Area of Triangle using base and height – Java Program | Beginner | 2018-08-12 19:43:10 |

Get the Sum of Digits in a number till it become a single digit | Intermediate | 2018-08-08 23:49:57 |

Calculate Log2n without using built-in function | Beginner | 2018-08-05 13:09:27 |

Check if given number is Prime – O(√N) Solution – Java Program | Intermediate | 2018-08-04 12:30:15 |

Print First N Prime Numbers – Java Code | Beginner | 2018-08-02 22:05:53 |

Print My IP Address – Java Code | Beginner | 2018-07-31 23:04:52 |

Find the Circumference of a Circle – Java Program | Beginner | 2018-07-30 22:51:28 |

Check if two Strings are equal without using built-in function – Java | Beginner | 2018-07-30 22:36:52 |

Remove Vowels from a given String | Beginner | 2018-07-29 22:45:21 |

Linear Search Algorithm | Beginner | 2018-07-28 21:07:29 |

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation | Expert | 2018-07-25 21:38:54 |

Floyd’s Triangle – Java Implementation | Beginner | 2018-07-24 23:31:44 |

Print Numbers from 1 to N without using loop | Beginner | 2018-07-17 21:23:15 |

Swap two numbers using Bitwise XOR Operator | Intermediate | 2018-07-16 00:01:20 |

Java Program to determine if Given Year is Leap Year | Beginner | 2018-07-13 21:00:32 |

Find number of Distinct Permutations of a String | Intermediate | 2018-07-10 20:09:56 |

Find the Area of a Circle – Java Program | Beginner | 2018-07-08 00:52:58 |

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency Matrix – Java Implementation | Expert | 2018-07-05 21:32:16 |

Fizz Buzz Challenge – Java Implementation | Beginner | 2018-07-02 20:32:18 |

Divide with power of 2 without using pow() or / operator | Beginner | 2018-06-29 21:50:20 |

Maximum Difference between two elements in array – Largest Gap Problem | Beginner | 2018-06-27 23:26:53 |

Minimum number of guesses needed to find a specific number | Beginner | 2018-06-25 00:24:15 |

Left Shift (<<) and Right Shift (>>) Operators | Beginner | 2018-06-22 21:31:05 |

Djkstra’s – Shortest Path Algorithm (SPT) | Expert | 2018-06-20 11:08:44 |

Replace all vowels with next consonant in a given string | Intermediate | 2018-06-18 00:08:11 |

Find the Area of a Triangle Using coordinates | Beginner | 2018-06-16 20:00:23 |

Java Program to find if Triangle can be formed using given 3 sides | Beginner | 2018-06-16 14:08:18 |

Convert Number to base 3 String Representation | Beginner | 2018-06-16 13:59:13 |

Find the Area of a Triangle Given Three Sides – Heron’s Formula | Beginner | 2018-06-09 13:29:49 |

Find Factorial of a given Number | Beginner | 2018-06-09 12:39:24 |

Reverse a String using Recursion | Beginner | 2018-06-09 12:10:26 |

Find Sum of all Digits of a Number | Beginner | 2018-06-09 12:04:31 |

Print maximum occurring character in a String | Beginner | 2018-06-09 00:37:38 |

Kruskal’s Algorithm – Minimum Spanning Tree (MST) – Complete Java Implementation | Expert | 2018-05-29 21:03:52 |

Introduction to Minimum Spanning Tree (MST) | Intermediate | 2018-05-17 00:04:11 |

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV) | Expert | 2018-05-15 20:19:52 |

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key | Expert | 2018-05-13 15:56:05 |

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap | Expert | 2018-05-07 19:47:49 |

Prim’s – Minimum Spanning Tree (MST) |using Adjacency Matrix | Expert | 2018-04-25 22:29:57 |

Prim’s Algorithm – Minimum Spanning Tree (MST) | Expert | 2018-04-21 21:40:54 |

Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) | Expert | 2018-04-15 13:23:01 |

Disjoint Set | Union-Find Algorithm – Union by rank and path compression | Expert | 2018-04-12 00:28:01 |

Disjoint Set Data Structure – Union Find Algorithm | Expert | 2018-04-07 23:27:03 |

Graph – Count all paths between source and destination | Intermediate | 2018-04-05 21:07:39 |

Graph – Find Number of non reachable vertices from a given vertex | Intermediate | 2018-04-02 20:19:14 |

Graph – Detect Cycle in a Directed Graph using colors | Expert | 2018-03-29 22:21:43 |

Graph – Detect Cycle in an Undirected Graph using DFS | Intermediate | 2018-03-26 23:17:41 |

Graph – Detect Cycle in a Directed Graph | Intermediate | 2018-03-21 21:54:43 |

Graph – Software Installation Problem | Intermediate | 2018-03-18 19:54:38 |

Snake and Ladder Problem | Expert | 2018-03-14 21:14:11 |

Weighted Graph Implementation – JAVA | Beginner | 2018-03-13 22:23:16 |

Graph – Depth First Search in Disconnected Graph | Intermediate | 2018-03-11 13:43:04 |

Topological Sort | Intermediate | 2018-03-06 22:16:05 |

Graph – Depth First Search using Recursion | Beginner | 2018-03-04 10:13:52 |

Graph Implementation – Adjacency Matrix | Set 3 | Beginner | 2018-03-01 22:51:52 |

Java Pair Class | Beginner | 2018-02-25 20:43:10 |

Graph Implementation – Adjacency List – Better| Set 2 | Beginner | 2018-02-22 22:30:55 |

Minimum Copy Paste Operations | Intermediate | 2018-02-17 18:39:55 |

Count and print all Subarrays with product less than K in O(n) | Expert | 2018-02-12 23:10:46 |

Sliding Window Algorithm (Track the maximum of each subarray of size k) | Expert | 2018-02-10 18:38:00 |

Deque Implementation – Java | Beginner | 2018-02-08 22:29:57 |

Print all sub sequences of a given String | Intermediate | 2018-02-05 22:23:27 |

Graph – Print all paths between source and destination | Intermediate | 2018-02-04 13:48:30 |

Graph – Depth First Traversal | Intermediate | 2018-02-01 22:19:03 |

Print all sub sequences of a given array | Expert | 2018-01-28 22:34:36 |

Print all substrings of a given string | Intermediate | 2018-01-26 00:08:36 |

Sum of all sub arrays in O(n) Time | Expert | 2018-01-22 18:09:42 |

Print all subarrays of a given array | Intermediate | 2018-01-19 17:47:19 |

Text Justification Problem (OR Word Wrap Problem) | Expert | 2018-01-16 17:37:39 |

Dynamic Programming – Egg Dropping Problem | Expert | 2018-01-13 22:24:22 |

Nuts & Bolts Problem (Lock & Key problem) | Beginner | 2018-01-10 20:29:28 |

Divide and Conquer – Rearrange array elements in special order | Intermediate | 2018-01-05 20:18:16 |

Dynamic programming – Printer Problem | Expert | 2018-01-01 12:57:02 |

Remove Duplicates from a string | Intermediate | 2017-12-28 19:12:11 |

Find median of two sorted arrays of same size | Intermediate | 2017-12-23 14:01:30 |

Dynamic programming – Minimum Jumps to reach to end | Expert | 2017-12-17 13:42:17 |

Dynamic programming – Remove Boxes Problem | Expert | 2017-12-03 14:02:46 |

Find two non-repeating numbers in an array in O(n) time and O(1) space | Expert | 2017-10-29 09:24:47 |

Number of bit to be flipped to convert one number to another. | Beginner | 2017-09-14 20:51:42 |

Separate even and odd integers in a given array | Beginner | 2017-09-12 22:20:38 |

Find three elements in an array that sum to a zero. | Beginner | 2017-09-11 22:10:00 |

All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space | Expert | 2017-09-07 19:56:04 |

Separate 0’s and 1’s in a given array | Beginner | 2017-09-05 22:14:03 |

Find local minimum or local maximum in O(1). | Intermediate | 2017-09-04 14:27:54 |

Find three elements in an array that sum to a given value | Beginner | 2017-09-03 22:09:56 |

Majority Element- Boyer–Moore majority vote algorithm | Intermediate | 2017-09-01 19:31:15 |

Majority Element – Part 1 | Beginner | 2017-09-01 19:23:38 |

Find the local minima in a given array | Intermediate | 2017-09-01 19:15:53 |

Check whether the given number is a perfect square | Beginner | 2017-08-26 23:15:50 |

Check if array is sorted using recursion | Beginner | 2017-08-26 23:07:00 |

Find the Index from which 0 starts | Beginner | 2017-08-26 23:01:16 |

Find the increasing OR decreasing point in an array | Beginner | 2017-08-26 22:51:47 |

Find the only element in array which appears only once | Beginner | 2017-08-26 22:43:36 |

Algorithm to calculate power(k,n). | Beginner | 2017-08-26 22:35:13 |

Find remainder without using modulo operator | Beginner | 2017-08-26 22:27:31 |

Swap two numbers without using extra variable | Beginner | 2017-08-26 22:21:01 |

Number of 1’s in bit representation of a number | Beginner | 2017-08-26 17:23:17 |

Stock Single Sell Problem – O(n) Solution | Expert | 2017-08-26 17:12:14 |

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer | Expert | 2017-08-26 16:59:09 |

Maximum difference between two elements where larger element appears after the smaller element | Intermediate | 2017-07-30 16:24:30 |

Find the right most unset bit OR zero bit of a number | Beginner | 2017-07-30 16:16:12 |

Find the two repeating elements in a given array | 6 Approaches | Intermediate | 2017-07-24 19:07:06 |

Find the right most set bit of a number | Beginner | 2017-07-23 14:39:04 |

Find two elements whose sum is closest to zero | Intermediate | 2017-07-09 18:50:31 |

Find the element which appears maximum number of times in the array. | Intermediate | 2017-06-26 20:06:29 |

Find duplicates in an given array in O(n) time and O(1) extra space. | Intermediate | 2017-06-18 12:08:44 |

Find the last non repeating character in a given string. | Beginner | 2017-06-11 19:21:28 |

Find the last repeating character in a given string. | Beginner | 2017-05-29 20:34:49 |

Find the first non repeating character in a given string | Beginner | 2017-05-27 15:08:59 |

Find the first repeating character in a given string | Beginner | 2017-03-08 00:09:32 |

K-Means Algorithm | Expert | 2017-03-02 21:56:54 |

k-Nearest Neighbors | Expert | 2016-12-30 00:01:34 |

Find longest Snake sequence in a given matrix | Intermediate | 2016-08-08 00:24:22 |

Dynamic Programming – Count all paths in 2D Matrix with Obstructions in it | Intermediate | 2016-06-20 19:37:31 |

Dynamic Programming – Count all paths from top left to bottom right of a mXn matrix | Intermediate | 2016-06-19 10:29:43 |

Reverse the given Array without using built in function | Beginner | 2016-06-19 10:17:23 |

Print All Diagonals of a given matrix | Intermediate | 2016-06-17 22:55:55 |

Dynamic Programming – Edit Distance Problem | Expert | 2016-05-14 20:11:10 |

Dynamic Programming – Coin In a Line Game Problem | Expert | 2016-05-08 18:08:55 |

Dynamic Programming – Box Stacking Problem | Expert | 2016-04-17 17:23:51 |

Dynamic Programming – Split the String into Minimum number of Palindromes. | Expert | 2016-04-10 12:20:39 |

Dynamic Programming – Highway Billboard Problem | Expert | 2016-04-05 14:20:47 |

Dynamic Programming – Maximum Subarray Problem | Intermediate | 2016-04-03 19:00:09 |

Kadane’s Algorithm – Maximum Subarray Problem | Intermediate | 2016-03-31 01:18:59 |

Convert Binary Tree into Threaded Binary Tree | Expert | 2016-03-24 18:55:05 |

Double Threaded Binary Tree Complete Implementation | Expert | 2016-03-21 20:53:09 |

Single Threaded Binary Tree Complete Implementation | Expert | 2016-03-19 16:56:28 |

Introduction to Threaded Binary Tree | Intermediate | 2016-03-19 16:33:38 |

Implement Stack Using Linked List | Beginner | 2016-03-19 13:18:13 |

Doubly Linked List Complete Implementation | Beginner | 2016-03-18 20:34:04 |

Circular Linked List Complete Implementation | Beginner | 2016-03-15 23:18:33 |

Swap Nodes in pairs in a Linked List by changing links | Intermediate | 2016-03-13 20:09:38 |

Convert BST to Greater Sum Tree | Intermediate | 2016-02-27 20:45:26 |

Shortest Range in K-sorted Lists | Expert | 2016-02-19 22:54:24 |

Reverse Alternative ‘k’ nodes in a Linked List. | Intermediate | 2016-02-18 19:25:06 |

Reverse a Linked List in groups of given size ‘K’ | Intermediate | 2016-01-03 20:47:34 |

Generate Maximum revenue by selling K tickets from N windows | Intermediate | 2016-01-03 20:22:26 |

Get the Sum of all left leaves in a Binary tree | Beginner | 2015-12-06 11:44:36 |

Convert binary tree to its Sum tree | Intermediate | 2015-12-06 11:32:11 |

Binary Tree-Postorder Traversal – Non Recursive Approach | Beginner | 2015-12-05 14:57:45 |

Binary Tree – Preorder Traversal – Non Recursive Approach | Beginner | 2015-12-05 12:33:53 |

Binary Tree-Inorder Traversal – Non Recursive Approach | Beginner | 2015-12-04 23:59:57 |

Delete the Binary Tree | Beginner | 2015-12-04 23:25:34 |

Search the Element in a binary tree – With and Without Recursion | Beginner | 2015-12-04 23:10:45 |

Tree Traversals | Beginner | 2015-11-08 13:01:11 |

Find the Size of a Binary Tree without Recursion | Beginner | 2015-11-08 12:33:19 |

Dynamic Programming — Longest Palindromic Subsequence | Expert | 2015-08-04 22:15:53 |

Dynamic Programming – Maximum Product Cutting Problem. | Intermediate | 2015-07-11 10:16:50 |

Dynamic Programming – Minimum Numbers are Required Whose Square Sum is Equal To a Given Number | Expert | 2015-07-03 21:35:20 |

Dynamic Programming – Longest Common Substring | Intermediate | 2015-06-29 21:29:51 |

Dynamic Programming – Longest Common Subsequence | Intermediate | 2015-06-28 11:43:44 |

Dynamic Programming – Rod Cutting Problem | Intermediate | 2015-06-27 17:59:36 |

Dynamic Programming – Coin Change Problem | Intermediate | 2015-06-27 15:06:04 |

Dynamic Programming – Minimum Cost Path Problem | Intermediate | 2015-06-14 17:51:12 |

All N Length Strings from Given String of Length K | Intermediate | 2015-06-10 21:40:01 |

Generate Well Ordered Passwords of a Given Length K | Intermediate | 2015-06-10 21:34:53 |

Print All N Length Strings from Given Number K | Expert | 2015-06-10 21:19:49 |

Print All Possible Subsets with Sum equal to a given Number | Expert | 2015-06-08 20:56:00 |

Dynamic Programming – Maximum size square sub-matrix with all 1s | Intermediate | 2015-05-10 13:47:45 |

Dynamic Programming – Subset Sum Problem | Expert | 2015-05-10 13:34:32 |

The Word Break Problem | Expert | 2015-05-10 13:15:51 |

Dynamic Programming – Longest Increasing Subsequence | Intermediate | 2015-05-10 02:14:14 |

Backtracking – Knight’s Tour Problem | Expert | 2015-05-10 01:28:37 |

Backtracking – Search a Word In a Matrix | Expert | 2015-05-10 01:09:13 |

Backtracking – N Queens Problem – Better Solution | Expert | 2015-05-10 00:55:54 |

Backtracking – N Queens Problem | Expert | 2015-05-10 00:43:48 |

Find the Kth Smallest/Largest Element in an Array | Beginner | 2015-05-10 00:31:22 |

Priority Queue in Data Structure | Beginner | 2015-05-10 00:21:29 |

Find the Second Largest Element in an Array | Beginner | 2015-05-09 23:52:38 |

Breadth-First Search/Traversal in a Graph. | Expert | 2015-05-09 23:44:09 |

Breadth-First Search/Traversal in a Binary Tree | Beginner | 2015-05-09 23:16:32 |

Sort Names by their Last Names. | Beginner | 2015-05-08 18:45:42 |

Backtracking – Rat In A Maze Puzzle | Expert | 2015-04-13 15:03:35 |

Backtracking – SUDOKU Solver | Expert | 2015-03-16 20:24:30 |

Introduction To Backtracking Programming | Beginner | 2015-03-16 20:13:31 |

Dynamic Programming – Stairs Climbing Puzzle | Beginner | 2015-03-16 20:04:44 |

Dynamic Programming – Minimum Coin Change Problem | Intermediate | 2015-03-16 19:57:27 |

Introduction To Dynamic Programming – Fibonacci Series | Beginner | 2015-03-16 19:44:12 |

Merge K Sorted Arrays | Expert | 2015-03-14 15:33:24 |

Find the Deepest Left Node in a Binary Tree. | Intermediate | 2015-03-14 15:24:00 |

Find a Number occurring odd number of times in a Given array | Beginner | 2015-03-14 15:11:50 |

Rearrange the Array of Given Range N, such that A[i]=i | Intermediate | 2015-03-14 15:06:50 |

Find a Missing Number From a Sequence of Consecutive Numbers | XOR Method | Beginner | 2015-03-14 14:44:19 |

Find the Max element in a Given Binary Tree | Beginner | 2015-03-14 14:40:48 |

Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node | Expert | 2015-03-14 14:36:20 |

Check If One Binary is Mirror Tree of another Binary Tree. | Beginner | 2015-03-14 14:21:10 |

Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number | Intermediate | 2015-03-14 14:14:08 |

Diameter Of a Binary Tree | Expert | 2015-03-14 14:08:57 |

Reverse Level Order Traversal | Intermediate | 2015-03-14 03:02:16 |

Find the Deepest Node in a Binary Tree. | Intermediate | 2015-03-14 02:15:48 |

Find the Height of a tree without Recursion | Intermediate | 2015-03-14 02:11:36 |

Print All The Full Nodes in a Binary Tree | Beginner | 2015-03-14 02:02:33 |

Binary Min – Max Heap | Expert | 2015-02-22 17:21:28 |

Magic Index – Find Index In Sorted Array Such That A[i] = i. | Beginner | 2015-02-22 17:06:00 |

Find numbers which are palindrome in both their decimal and octal Representations | Beginner | 2015-02-22 16:02:07 |

Find All the Well Ordered Permutations of a Given String. | Intermediate | 2015-02-22 14:35:09 |

Find Increasing Triplet Sub-sequence | Intermediate | 2015-02-22 14:19:19 |

Construct a Special Triangle from a Given Array | Beginner | 2015-02-22 14:10:01 |

Colorful Numbers | Expert | 2015-02-22 00:14:01 |

Print All the Subsets of a Given Set (Power Set) | Expert | 2015-02-21 23:59:01 |

Goldbach’s Conjecture | Beginner | 2015-02-21 23:50:23 |

Convert Decimal into Irreducible Fraction | Beginner | 2015-02-21 00:21:16 |

Clock Angle Problem | Beginner | 2015-02-20 19:28:47 |

Print All Combinations of subset of size K from Given Array | Expert | 2015-02-20 19:07:29 |

Track the Maximum Element in a Stack. | Intermediate | 2015-02-16 16:24:07 |

Print All Possible Valid Combinations Of Parenthesis of Given ‘N’ | Expert | 2015-02-05 14:14:38 |

Graph Representation – Adjacency Matrix and Adjacency List | Beginner | 2015-02-02 17:38:37 |

Counting Sort | Intermediate | 2015-02-02 16:21:13 |

Towers Of Hanoi | Beginner | 2015-02-02 16:15:09 |

Generate All Strings of n bits. | Intermediate | 2015-02-01 15:57:18 |

Find The Missing Duplicate in a Given Array. | Beginner | 2015-02-01 15:40:25 |

Sort 3 Integers without using if condition OR use only Max() function. | Beginner | 2015-02-01 15:30:49 |

Euclidean algorithm – Greatest Common Divisor(GCD) | Beginner | 2015-01-31 23:46:08 |

Implement Queue Using Stacks | Intermediate | 2015-01-31 23:38:08 |

Alternate Splitting of a given Linked List | Intermediate | 2015-01-31 23:03:46 |

Reverse The Doubly Linked List | Intermediate | 2015-01-31 21:48:00 |

Swap Kth Node from the front with the Kth Node from the End | Intermediate | 2015-01-31 21:25:09 |

Print the Bottom View of the Binary Tree. | Intermediate | 2015-01-30 03:38:05 |

Delete X Nodes After Y Nodes In a Linked List | Beginner | 2015-01-29 13:11:27 |

Merge Sort in a Linked list | Intermediate | 2015-01-29 12:55:27 |

Merge a Linked list into another Linked List at Alternate Positions. | Intermediate | 2015-01-05 20:22:52 |

AVL Tree – Insertion | Expert | 2014-12-30 23:10:35 |

Construct a binary tree from given Inorder and Level Order Traversal | Expert | 2014-12-30 21:46:58 |

Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) | Expert | 2014-12-30 05:55:03 |

Construct Binary Search Tree from a given Preorder Traversal using Recursion | Expert | 2014-12-30 05:45:40 |

Print The Top View of a Binary Tree | Intermediate | 2014-12-30 05:29:07 |

Construct a Binary Tree from Given Inorder and Depth-First-Search. | Expert | 2014-12-30 05:16:11 |

Depth First Search/Traversal in Binary Tree | Beginner | 2014-12-30 05:03:06 |

Inorder Predecessor and Successor in Binary Search Tree | Expert | 2014-12-29 22:08:55 |

Check if Array Contains All Elements Of Some Given Range | Intermediate | 2014-12-29 20:44:38 |

Check if Array is Consecutive Integers | Beginner | 2014-12-29 20:37:11 |

In an Array, find the Contiguous Subarray with Sum to a Given Value. | Intermediate | 2014-12-29 20:28:35 |

In an Array, find the Smallest Subarray with Sum Greater than the Given Value | Intermediate | 2014-12-29 20:18:37 |

Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space | Expert | 2014-12-28 06:21:34 |

Find intersection between Two Sorted Arrays. | Beginner | 2014-12-28 06:09:47 |

Find Kth Smallest or Largest element in an Array. | Intermediate | 2014-12-28 06:02:44 |

Given an array arrA[], find the maximum j – i such that arr[j] > arr[i]. | Intermediate | 2014-12-28 05:53:26 |

Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number. | Expert | 2014-12-28 03:15:17 |

Search an Element in a Rotated Sorted Array | Intermediate | 2014-12-28 02:53:10 |

Print All The Nodes Which are X distance from the Given Node | Expert | 2014-12-08 23:37:27 |

Print All The Nodes Which are X distance from the Leaf Nodes | Intermediate | 2014-12-08 23:24:13 |

Print All The Nodes Which are X distance from the Root | Intermediate | 2014-12-08 23:16:50 |

Find the Distance between Two Nodes of a Binary Tree. | Expert | 2014-12-08 23:05:02 |

Find The Distance From Root To Given Node of a Binary Tree. | Intermediate | 2014-12-08 22:55:07 |

Construct a binary tree from given Inorder and Postorder Traversal | Expert | 2014-12-08 22:44:15 |

Print the Vertical Sum in binary Tree . | Intermediate | 2014-12-08 22:19:30 |

Print the Binary Tree in Vertical Order Path. | Intermediate | 2014-12-08 22:11:03 |

Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). | Expert | 2014-11-18 08:52:45 |

Lowest Common Ancestor in a Binary Search Tree. | Intermediate | 2014-11-18 08:28:54 |

Make a Binary Tree from Given Inorder and Preorder Traveral. | Expert | 2014-11-18 08:06:33 |

Given a binary tree, find out the maximum sum of value from root to each leaf. | Intermediate | 2014-11-18 07:50:13 |

Reverse Alternate levels of a given Binary Tree. | Intermediate | 2014-11-18 07:28:37 |

Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree. | Intermediate | 2014-11-18 07:03:24 |

Given a binary tree, Convert it into its Mirror Tree | Beginner | 2014-11-18 03:46:41 |

Given a binary tree, Print All the Nodes that don’t have Siblings. | Beginner | 2014-11-18 02:46:53 |

Convert a Sorted Doubly Linked List to Balanced BST. | Intermediate | 2014-11-18 02:30:44 |

Given a binary tree, Find the Maximum Path Sum between Any Two Leaves | Intermediate | 2014-11-18 01:00:34 |

Print Left View of a given binary tree | Intermediate | 2014-11-18 00:46:23 |

Print Right View of a given binary tree | Intermediate | 2014-11-17 23:33:25 |

In a Binary Tree, Check if Two nodes has the same parent or are siblings | Intermediate | 2014-11-17 23:12:16 |

In a Binary Tree, Check if two nodes are Cousins | Intermediate | 2014-11-17 22:46:45 |

Check if Two BST’s are Identical | Beginner | 2014-11-17 21:45:02 |

Print Paths from root to all leaf nodes in a binary tree. | Intermediate | 2014-11-17 21:14:09 |

Print All The Permutations Of a String | Expert | 2014-11-14 22:06:29 |

Sort an Given Array in the order defined by another array | Intermediate | 2014-11-14 21:02:52 |

Sort an Array such that the odd numbers appear first followed by the even numbers . The odd numbers in ascending order and the even numbers in descending order. | Intermediate | 2014-11-11 08:08:33 |

Print All Nodes Between Two Given Levels | Intermediate | 2014-11-11 07:54:34 |

Find the maximum width of a binary tree | Intermediate | 2014-11-11 05:23:43 |

Find the number of occurrences of a number in a given sorted array. | Intermediate | 2014-11-11 03:14:09 |

Find all common numbers in given three sorted arrays. | Beginner | 2014-11-11 03:05:11 |

Level Order Traversal in Zig Zag pattern OR Print in Spiral Pattern | Expert | 2014-11-10 20:04:05 |

Find the first repeated element in an array by its index | Intermediate | 2014-11-10 18:58:58 |

Minimum number that cannot be formed by any subset of an array | Beginner | 2014-11-10 18:21:30 |

Determine whether given binary tree is binary search tree(BST) or not | Intermediate | 2014-09-27 20:58:54 |

Find the Size of the Binary Tree | Beginner | 2014-09-27 19:12:28 |

Given two binary trees, check if one binary tree is a subtree of another | Intermediate | 2014-09-27 18:18:22 |

Print a path from Root to Node in Binary Tree | Intermediate | 2014-09-27 18:04:50 |

Inorder Successor in Binary Search Tree without Using Parent link | Expert | 2014-09-27 16:46:09 |

Inorder Successor in Binary Search Tree Using Parent link | Expert | 2014-09-27 16:46:01 |

Inorder Successor in Binary Tree | Intermediate | 2014-09-27 16:45:50 |

Sorted Array to Binary Search Tree of Minimal Height | Intermediate | 2014-09-27 15:51:19 |

In a Binary Tree, Create Linked Lists of all the nodes at each depth. | Expert | 2014-09-22 21:38:14 |

Level Order Traversal, Print each level in separate line. | Intermediate | 2014-09-21 08:03:34 |

Find whether if a Given Binary Tree is Balanced? | Intermediate | 2014-09-21 01:16:54 |

Get the Height of a Node in a Binary Tree | Intermediate | 2014-09-20 17:05:05 |

Find the Maximum Depth OR Height of a Binary Tree | Beginner | 2014-09-19 15:53:16 |

Add two numbers represented by a linked list, Numbers are Stored in FORWARD order | Intermediate | 2014-09-16 22:59:40 |

Add two numbers represented by a linked list, Numbers are Stored in REVERSE order | Intermediate | 2014-09-16 22:28:49 |

Reverse the binary representation of a number. | Intermediate | 2014-09-16 20:32:30 |

Binary Search Tree (BST) Complete Implementation. | Beginner | 2014-09-16 00:38:04 |

Reverse a Linked List – Part 2 | Beginner | 2014-09-14 03:13:55 |

Swap Every Kth Node in a LinkedList | Intermediate | 2014-09-14 03:02:40 |

Delete a Node in the Middle of a linked list, Given only access to that Node | Beginner | 2014-09-12 17:16:37 |

Find the n’th Node from the end of a given Linked List | Beginner | 2014-09-12 06:40:00 |

Remove Duplicates from an Unsorted Linked list | Beginner | 2014-09-11 17:06:30 |

Check if one string is Rotation of another string | Beginner | 2014-09-09 23:29:04 |

String Compression using count of repeated characters – Run Length Encoding | Beginner | 2014-09-09 02:49:24 |

Replace all spaces in a String with ‘%20’ | Intermediate | 2014-09-08 05:26:30 |

Find Whether Two Strings are Permutation of each other | Beginner | 2014-09-08 05:19:13 |

Find Intersection Point in Two Linked List | Intermediate | 2014-09-06 17:41:44 |

Find the Loop in a Linked list, find its length and Break the Loop | Intermediate | 2014-09-05 21:49:36 |

Reverse a Linked List | Beginner | 2014-08-28 16:54:29 |

Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths | Intermediate | 2014-08-25 04:11:48 |

Print All Paths from Top left to bottom right in Two Dimensional Array | Intermediate | 2014-08-13 14:43:45 |

Merge or Combine Two Sorted Linked Lists | Intermediate | 2014-08-12 14:58:31 |

Singly Linked List Implementation | Beginner | 2014-08-12 14:34:27 |

Rearrange Positive and Negative Numbers of Array On Each Side in O(nlogn) | Expert | 2014-08-04 17:50:28 |

Find The Longest Sequence Of Prefix Shared By All The Words In A String | Arrays, Strings | 2014-08-04 17:37:31 |

Print All Elements of Two Dimensional Array in Spiral | Intermediate | 2014-08-04 17:11:31 |

Find a pair of numbers from an array whose sum equals k | Beginner | 2014-08-04 02:01:38 |

Check If String has All Unique Characters | Beginner | 2014-08-03 05:49:14 |

Quick Sort Implementation | Intermediate | 2014-08-03 02:22:30 |

Valid or Well Formed Parentheses | Part – 1 | Intermediate | 2014-07-23 19:08:54 |

Find an Element in 2 dimensional sorted array | Intermediate | 2014-07-20 22:27:52 |

Find Whether Given String is palindrome or Not. | Beginner | 2014-07-20 22:19:24 |

Find a peak element in a Given Array | Beginner | 2014-07-20 22:12:23 |

Find two Missing Numbers in a Sequence of Consecutive Numbers | Beginner | 2014-07-20 22:05:30 |

Find a Missing Number From a Sequence of Consecutive Numbers | Beginner | 2014-07-20 22:00:05 |

Hash Table Implementation | Beginner | 2014-07-20 21:54:06 |

Merge Sort – Updated – Most Efficient ways to Implement | Intermediate | 2014-07-20 21:41:14 |

Binary Search | Beginner | 2014-07-20 15:35:10 |