The numbers 1-5 are inserted, in order, into a stack. Numbers are removed from the stack one-by-one and pushed into another array (numbers could be removed at any time, even before all the numbers have been added to the stack). What order of numbers in the array could NOT be produced by this scenario? Write code to determine if a sequence of numbers could have been produced by this scenario.
You have a function f(p) that returns an array of linked pages e.g f(homepage) = {page1, page2, page3}. Or f(page1) = {page4, page5}. If there is no linked pages function will return null. And we say one site is a good site if we can get to any page of that site in a less than 6 clicks. The task was to write a function that will check is it a good site or not using f(p).
You have 10 bags that weighs the same except for one that weighs less. With a scale, what's the shortest number of tries to find the bag that weighs less?
Very very hard, they ask you to do a poker project for 8 hours and give no feedback after and ask you to leave
Given a string of the form: "{Valery,Jason,Peter} was in {good,bad} mood and he went to the {beach, party, library}"; Print out all the permutations of the string. Eg: Valery was in good mood and he went to the beach.
why should i hire you
In interview, for DS: link list , stack, queues , Quicksort etc, JAVA(core) .
Algorithms question was probably the trickiest thing. Given an array of integers of length N from 1 to N-1, how would you detect a single duplicate in the array?
The Codility challenge had 3 problems: 1 - A SQL query, 2 - A development problem, equivalent to a medium difficulty in Leetcode and 3 - Finding a bug in a function.
1.difference between abstract class,interface
Viewing 1151 - 1160 interview questions