Given an array of integers, find the nearest smaller number for every element such that the smaller element is on left side.
Examples:
Input: arr[] = {1, 6, 4, 10, 2, 5}
Output: {-1, 1, … Read More Array
Calculate price of parking from parking start end time prices
Given a price rules of parking and start time and end time of parking. Calculate the price
(Below is the table of price rule) Come up with data structure you can store these price rules
There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration
With First look you think practical way of solving this question, and that is randomly taking a bolt and finding (by Looking at all nuts) perfect fit nut for it.
but does such logic to … Read More
Print Power Set of a Set
Print Power Set of a Set of character.
Power Set Power set P(S) of a set S is the set of all subsets of S. For example S = {a, b, c} then P(s) =
Stock Buy Sell to Maximize Profit
Stock Price on each day is given in an array.
Example : [ 10, 12, 7, 5, 9, 15, 13, 18 ]
Find the max profit that you can make by buying and selling in … Read More
Maximum difference between two elements s.t larger element appears after the smaller number
Find maximum profit if you can buy & sell share just once.
Given an array of integers, find out the difference between any two elements such that larger element appears after the smaller number.
Examples: … Read More
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[] =
Check if an array has duplicate numbers in O(n) time and O(1) space
We have array a[ ]= {1, 2, 3, 4, 5, 6, 7, 8, 4, 10};
And we need to find a number which is duplicate in O(n) and Space complexity O(1)
Method 1 ) Sorting
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 Maximum of all subarrays of size k
Given an array and an integer k, find the maximum for each and every contiguous subarray of size k.
Input :
arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6}
k = 3
… Read More Input :
arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6}
k = 3