Find an algorithm to find the largest sum subarray in an array of integers. (Better than O(n^2) ).
Softwareentwickler 2 Interview Questions
512,120 softwareentwickler 2 interview questions shared by candidates
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.
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?
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 ?
Write some pseudo code to raise a number to a power.
Given an array of integer in which all numbers occur even times except for one number occurs odd times, find it.
Describe and code an algorithm that returns the first duplicate character in a string?
What is Little Endian and Big Endian?
How many golf balls can fit in a school bus?
Viewing 141 - 150 interview questions