Ex: Input: 1 2 5 3 6 8 7
Output: 5 6 7 8
As given in Above example we need to find Longest Consecutive sequence in O(n)
I have implemented in O(n) considering by
Amazon Interview Question
Find min element in Sorted Rotated Array (With Duplicates)
Problem: Find the minimum element in a sorted and rotated array if duplicates are allowed:
Example: { 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 1, 1, 2} output: 0
Algorithm:
… Read More Example: { 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 1, 1, 2} output: 0
Algorithm:
This problem
Find min element in Sorted Rotated Array (Without Duplicates)
Problem: Find the minimum element in a sorted and rotated array if duplicates not allowed:
Example: {3, 4, 5, 6, 7, 1, 2} output: 1
… Read More Example: {3, 4, 5, 6, 7, 1, 2} output: 1
Algorithm:
This problem can be easily solved in O(n) time
Find Percentage of Words matching in Two Strings
There are two strings s1 and s2. Find the maximum of percentage word matching from s1 to s2 and s2 to s1.
Where, percentage word matching= (Total words matched in s2/total number of words in
CodeChef’ RRCOPY
Def:
You had an array of integer numbers. You also had a beautiful operations called “Copy-Paste” which allowed you to copy any contiguous sub-sequence of your array and paste it in any position of your
… Read More You had an array of integer numbers. You also had a beautiful operations called “Copy-Paste” which allowed you to copy any contiguous sub-sequence of your array and paste it in any position of your
Find next greater number with same set of digits
Given a number n, find the smallest number that has same set of digits as n and is greater than n. If x is the greatest possible number with its set of digits, then print
Print vertical sum of all the axis in the given binary tree
Print Vertical Sum of all the axis in the given binary Tree.
Most of times in written test , you will encounter this very good question.
given a binary tree.
(most of times a complete
N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks
Find the first circular tour that visits all petrol pumps
There are n petrol bunks arranged in circle. Each bunk is separated from the rest by a certain distance. You choose some mode of travel
robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it
Robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it.
Printing Longest Common Subsequence
Printing Longest Common Subsequence
Given two sequences, print the longest subsequence present in both of them.
Examples:
LCS for input Sequences “ABCDGH” and “AEDFHR” is “ADH” of length 3.
LCS for input Sequences “AGGTAB” and