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.
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 unsorted array, find the 2 max numbers in it.
If you want to distribute a large file (gigabytes) in a large (100+ machines) park how do you do it?
Write a program to count the number of words in a file.
How to detect loops in a linked list without using a data structure
You have 10 boxes of balls (each ball weighing exactly10 gm) with one box with defective balls (each one of the defective balls weigh 9 gm). You are given an electronic weighing machine and only one chance at it. How will find out which box has the defective balls?
Find 2 or more missing numbers in a set of 100 natural numbers
First three technicals were difficult,LOB also ok/ok.
Given a string, konylabsinterview write a program to return bool if a given pattern matches.pattern example - kon*lab*terview*
Viewing 51 - 60 interview questions