sort an array N consists of four numbers, each number can be repeated k times, where k < n. Example: sort 1111144422223 to 1111122223444. Try to be as efficient as you can, not just O(n^2)
Software Development Interview Questions
37,282 software development interview questions shared by candidates
You have two intersecting linked lists. Describe a function that returns a pointer to the node where they intersect.
Connect Four is a game where two players take turns dropping their color discs into a vertically suspended grid. The game ends when a player adds a disc to the playing grid that connects four discs of their color. The connected discs can be in a horizontal, vertical or diagonal line. Write a function to be called after every turn that returns true if the game is over (and false otherwise).
You have 16 race horses and a racetrack which only fits 4 horses at one time. Find the top 4 horses in the fewest number of races.
How would you sort an array if you had infinite RAM? Infinite memory?
The challenge was comprised of two tasks; one code challenge and one puzzle.
On ado.net and asp.net they interviewed and programs
Find the intersection of two linked lists. Follow up: if the linked lists are doubly-linked lists.
Given an array of n unsorted ints, with the condition that each number is at most k positions away from its final sorted position, give an efficient sorting algorithm.
If you have eight objects that all weigh the same except for one (which is heavier) and a two-sided scale, what is the minimal number of times you can use the scale to determine the odd item out?
Viewing 271 - 280 interview questions
See Interview Questions for Similar Jobs
Systems DeveloperJava DeveloperC DeveloperPython DeveloperHadoop DeveloperDevops EngineerSoftware EngineerTechnical Program ManagerMobile DeveloperAtg DeveloperSoftware Applications EngineerSoftware ProgrammerSoftware Test EngineerMobile EngineerIt DeveloperApplications Support EngineerComputer ScientistSenior DeveloperSoftware Qa Engineer