I have around 3 years and 4 months of experience as a software developer. I recently interviewed with ixigo for the position of SDE2 backend Java profile. The interview experience is as follows....
There are many ways of classifying algorithms and a few of them are shown below:...
Given a mountain array arr[] and an integer X, the task is to find the smallest index of X in the given array. If no such index is found, print -1....
Given a set of strings S and a string patt the task is to autocomplete the string patt to strings from S that have patt as a prefix, using a Ternary Search Tree. If no string matches the given prefix, print “None”.Examples:...
Prerequisites: Segment TreeGiven a number N which represents the size of the array initialized to 0 and Q queries to process where there are two types of queries:...
Given an in-order traversal of a cartesian tree, the task is to build the entire tree from it....
Given an integer k and a monotonic increasing sequence: f(n) = an + bn [log2(n)] + cn^3 where (a = 1, 2, 3, …), (b = 1, 2, 3, …), (c = 0, 1, 2, 3, …) Here, [log2(n)] means, taking the log to the base 2 and round the value down Thus, if n = 1, the value is 0. if n = 2-3, the value is 1. if n = 4-7, the value is 2. if n = 8-15, the value is 3. The task is to find the value n such that f(n) = k, if k doesn’t belong to the sequence then print 0....
Given positive integers k, a and b we need to print last k digits of a^b ie.. pow(a, b)....
Given a Roman numeral, the task is to find its corresponding decimal value....
Google Maps is a unique web-based mapping service brought to you by the tech giant, Google. It offers satellite imagery, aerial photography, street maps, 360° panoramic views of streets, real-time traffic conditions, and route planning for traveling by foot, car, bicycle, or public transportation....
Given an array arr[] of size N and an integer K, the task is to find the length of the longest subarray having Bitwise XOR of all its elements equal to K....
Given a range of values [L, R] and a value K, the task is to count the numbers in the given range which are divisible by at least K of the digits present in the decimal representation of that number....
