Given a string write a function which prints all the subsets of the string. Now make the function to return only unique solutions. For example if they give you "abc" you print out a ab abc ac b bc c Now for the unique solution constraint, if they give you "aba" the output should be: a ab aba b
How do you see 5 years from now?
Given N credits cards, determine if more than half of them belong to the same person/owner. All you have is an array of the credit card numbers, and an api call like isSamePerson(num1, num2).
Question is verbose, uses search engine, string matching etc., but at the end boils down to this: There is two dimensional array where each sub array (row) is sorted, i.e. [[1 1000 2000] [20 10001 5000] [55 10002 222222]] Find a minimum range contain a number from each row. For above array it should be (1000-1002) range.
What a fibonacci function which return N th position number both in recursive and loop, also give the explanation on both implementation on their time efficiency.
Online coding interview: Given an array of integers. Find the largest increasing sub sequence of integers in the array. // 10, 3, 7, 9, 0, 15 // return index 1&3
Signed an NDA, so I will not post the questions.
I signed NDA for online assessments. For the phone interview, questions about DS and string manipulation. Should be good if can solve medium level HackerRank or Leetcode problems.
i) Given a value v, in a BST find the next value in order.
Given a (potentially large) array of integers, all but one repeating an even number of times, how would you find the one repeating an odd number of times in an efficient way? eg [1 2 3 3 2 2 1 4 2] should return 4
Viewing 531 - 540 interview questions