Given an integer array, write a program that returns an array with elements = product of the integers in input array except the one in its position. Ex: Given input: [2, 3, 10, 4, 5], output: [600, 400, 120, 300, 240] What is the complexity of your program? When will your program not work? Below is what I presented (O(n)), but it did not qualify me for the next round.
If a batsman given super powers so that he can hit any run[6,4 ,etc] and he wants to score highest run for himself , how he'll do that in 50 over game?
Given a collection of numbers, it has two functions: insert() and getMedian(). Choose a data structure to construct this collection and design the insert() and getMedian() function. Explain the time complexity of each function.
This round consists of 6 competitive coding questions and you need to solve at least 4 to get you through.
What is java?
public class Person { Person father; Person mother; Gender gender; Integer age; List<Person> children; int level = 0; public enum Gender { Male, Female; } } For the above class, you basically have to implement 2 methods. public List<Person> getOldestSisters() public List<Person> getGreatestAncestors()
Given a string s="my name is anny" print it in this manner: m n i a y a s n m m e y ie first letter of every word in the string
basics
Basic Java Questions: Annonymous Classes, Nested Classes etc.
MCQ Round had programming questions of moderate difficulty
Viewing 701 - 710 interview questions