I was asked to write an algorithm in C++ to sort an array. The function I was to write was to take in a string of letters "b" and "r". b = a red ball and r = a blue ball. The function was to return an integer with the least number of swaps needed to separate the balls to be next to their own colors... So for example, RBBR would return 1, since you only need to swap one of the letters to be RRBB or BBRR.
How would you test an elevator built in a hospital
test a function that inputs 3 sides of a triangle
why the lids of the gutter are circular?
What is your favorite product?
design a secure and usable login system
Given a series of numbers, replace each number with its nearest possible nuumber
How do you find your current job?
Lowest common ancestor of two given nodes within a binary tree.
The third question is a bit unexpected. I was spending a lot of time thinking how to write this efficiently, but didn't finish it. I should just write a straight forward one, and try to improve it later.
Viewing 1161 - 1170 interview questions