Given a Binary Search Tree (BST) and a positive integer k, find the k’th largest element in the Binary Search Tree.
Amazon Interview Question
Count number of ways to reach a given score in a game
Consider a game where a player can score 3 or 5 or 10 points in a move. Given a total score n, find number of ways to reach the given score.Examples:
Input: n = 20
… Read More Input: n = 20
Mirror of Tree
Count Possible Decodings of a given Digit Sequence
Find number of ways a string can be decoded into, if A=1, B=2, C=3 … Z=25 and encoding number is 123 ways decoding can be done is
1 2 3 = A B C
1
… Read More 1 2 3 = A B C
1
Find the element that appears once others appears thrice
Given an array where every element occurs three times, except one element which occurs only once. Find the element that occurs once.
Expected time complexity is O(n) and O(1) extra space.
Examples:
Input: arr[] =
… Read More Expected time complexity is O(n) and O(1) extra space.
Examples:
Input: arr[] =
Find the smallest window in a string containing all characters of another string
Given two strings string1 and string2, find the smallest substring in string1 containing all characters of string2 efficiently.For Example:
Input string1: “this is a test string”
Input string2: “tist”
Output string: “t stri”
Find if a binary tree is height balanced ?
A Height Balanced Tree is tree where for each node this condition is true.
– The difference between heights of left subtree and right subtree for any node is not more than 1.So we can
… Read More – The difference between heights of left subtree and right subtree for any node is not more than 1.So we can
Word Break Problem
Given an input string and a dictionary of words, find out if the input string can be segmented into a space-separated sequence of dictionary words. See following examples for more details.
This is a famous
… Read More This is a famous
Longest Increasing Subsequence
The longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order.For example, length of LIS
… Read More Level order traversal in Spiral form
Write a function to print spiral order traversal of a tree or Write function for Tree traversal in Spiral ZigZag form
For below tree, function should print 1, 2, 3, 7, 6, 5, 4.
For below tree, function should print 1, 2, 3, 7, 6, 5, 4.
[1]