Find all unique combinations of numbers (from 1 to 9 ) with sum to N
Objective: Given an integer N, Write an algorithm to select numbers from 1 to 9 and make combinations such that its sum to N. Example: N= 5 Output: [1, 4] [2, 3] [5] N...
Category: Top Companies
Number of Intervals in which given value lies
Objective: Given a list of intervals with start and end for each interval. You have given a value V, write an algorithm to find the number of intervals in which the value V lies. ...
Unique Integers in array that sum up to zero.
Objective: Given an integer N, write a function to return an array containing N unique integers that sum up to zero. There are many possible arrays that sum up to 0 for any N,...
Articulation Points OR Cut Vertices in a Graph
Objective: Given a graph, write an algorithm to find all the articulation points or cut vertices. Articulation Points: In a graph, a vertex is called an articulation point if removal of that vertex (along...
Check If Given Undirected Graph is a tree
Objective: Given an undirected graph, Write an algorithm to determine whether its tree or not. An undirected graph is a tree if it has properties mentioned below There is no cycle present in the...
Find the number of distinct Islands OR connected components.
Objective: Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of distinct or unique islands. Island: An island is surrounded by water and is formed by connecting adjacent lands...
Check the completeness of given binary tree | Set 2 – Using Level Order Traversal
Objective: Given a binary tree, write an algorithm to determine whether the tree is complete or not using Level order traversal. Earlier we had solved this problem by counting the number of nodes in...
Print All Paths in Dijkstra’s Shortest Path Algorithm
Objective: Given a graph and a source vertex write an algorithm to find the shortest path from the source vertex to all the vertices and print the paths all well. Example: We strongly recommend reading...
Check the completeness of given binary tree | Set 1 – Using Node Count
Objective: Given a binary tree, write an algorithm to determine whether the tree is complete or not. Complete Binary Tree: A binary tree T with n levels is complete if all levels except possibly...
Number of Islands using BFS
Objective: Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. Assume...
Check if Graph is Bipartite – Adjacency List using Depth-First Search(DFS)
Objective: Given a graph represented by the adjacency List, write a Depth-First Search(DFS) algorithm to check whether the graph is bipartite or not. Earlier we have solved the same problem using Adjacency Matrix (Check...
Longest substring with at most K unique characters
Objective: Given a string, write an algorithm to find the longest substring with at most K characters. Example: Input: aabbaacdeeeeddded, K = 3 Output: Longest substring with 3 most unique characters is: cdeeeeddded with...
Collatz Conjecture – Maximum Steps takes to transform (1, N) to 1.
Objective: Given a number N, write an algorithm to find the maximum number of steps it takes to transform (1, N) to 1 using Collatz Conjecture. The Collatz conjecture is a conjecture in mathematics...
Sort a given stack – Using Recursion
Objective: Given a stack of integers, write an algorithm to sort the stack using recursion. Example: Original Stack: [14, 9, 67, 91, 101, 25] Sorted Stack: [9, 14, 25, 67, 91, 101] Original Stack:...
Determine the given routing number belong to which bank
Objective: Given the banks and range of routing numbers for each bank. You have given a routing number, write a program to determine which bank it belongs to. Input: Given a list of routing...