There will be a meeting at New York and San Francisco offices. We will have to fly the participants to either one of these two offices. Let's say each office can accommodate half of the participants. Our goal is to assign each participant to an office in a way that the total travel cost for the company is minimized. What is this minimal cost? SF NY A 500 700 B 200 600 C 400 500 D 600 200 Output : 1400 (A:500 + B:200 + C:500 +D: 200)
Find an algorithm to find the largest sum subarray in an array of integers. (Better than O(n^2) ).
Questions were asked to check basic knowledge of OOPS concepts, String manipulation, Data Structures. Not very hard questions but were good enough to check concept.
Count bits in a byte.
written test on basic java you can crack if you are average concept in java.
Say I have a deck of 52 cards, regular deck of cards. I put a joker in the deck somewhere and shuffle it up. Now I start dealing you cards until the joker shows up. Once it shows up, I stop dealing you cards. What is the probability that you have, in your set of cards, all 4 aces?
Write some pseudo code to raise a number to a power.
Given a set of n jobs with [start time, end time, cost] find a subset so that no 2 jobs overlap and the cost is maximum ?
Describe and code an algorithm that returns the first duplicate character in a string?
Given an array of integer in which all numbers occur even times except for one number occurs odd times, find it.
Viewing 161 - 170 interview questions