Total 3 rounds of technical interview.

First round was based on Tree traversal. Second round was from a hiring manager who asked to complete a language of his choice (GoLang), then to do a problem. You should write the code bug-free to get an offer; mine had some bugs which I resolved eventually, but it was not enough, I guess. The code that needed to be completed was not portrayed correctly (in Google Docs), which caused a lot of confusion. Finally, a puzzle-based question based on Robot landing.

Then, in the final round, another hiring manager asked to design a stack problem. Expects to ask a lot of questions.

Complete findMax, findPrev features of a Node. Then, in the Tree, complete printReverse method using the above methods.

This is a code sample from Go’s standard library:

// SliceIsSorted tests whether a slice is sorted. // // The function panics if the provided interface is not a slice. func SliceIsSorted(slice interface{}, less func(i, j int) bool) bool { rv := reflect.ValueOf(slice) n := rv.Len() for i := 0; i < n-1; i++ { if less(i+1, i) { return false } } return true }

Talk me through this code in as much detail as you can.

a := []int{4, 5, 6, 7, 8, 10}
less := function (arg1, arg2) { return ? }
if SliceIsSorted(a, less) {
}

To the best of your ability implement the following function in Go (or if you’re not comfortable making up Go then any language of your choosing…):

// itoa returns the string representation of i // itoa(132) == “132” func itoa(i int) string { }

Robots

Two robotic paratroopers land (at the same exact time) on an infinite, discrete, linear railroad. When they land, they drop their parachute where they stand. The robots are both running the same software once they land. The programming language has the following commands:

• GOTO label // A goto statement, jumps to the label
• ON PAR GOTO label // a conditional goto, jumps to the label if you’re on the parachute
• LEFT // move one unit left
• RIGHT // move one unit right

The LEFT and RIGHT instructions take 1 unit of time to execute. All other instructions take 0 units of time.

Write a program that will make the two robots meet.

start:

LEFT
LEFT
RIGHT
ON PAR GOTO fast:
GOTO start:

fast: LEFT GOTO fast:

Implement a Stack Library, wage description. Get detailed informations.