Ho presentato la mia candidatura online. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Arista Networks (Vancouver, BC) nel mese di ago 2022
Colloquio
Total 3 rounds of technical interview. First round was based on Tree traversal. Second round was from a hiring manager who asks to complete a language of his choice(goLang), then told 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 needs to complete was not portrayed correctly(in google docs), which made a lot of confusion. Finally, a puzzle based qn based on Robot landing.
Then in the final round, another hiring manager asked to design a stack problem. Expects to ask a lot of qns.
Domande di colloquio [5]
Domanda 1
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:
Ho presentato la mia candidatura tramite un selezionatore. Ho sostenuto un colloquio presso Arista Networks (Austin, TX) nel mese di apr 2026
Colloquio
basics of c printfs. The patterns used in clg days was a bit confusing for a 15 yrs exp person like me. Dont know if its of any use on daily work as a SDE. Then BST programs 30mins 3 programs. Had written 2 and half and its correct for sure. Did ask for 5 extra mins to complete. But was denied.
Keep strong in basics and expect interviewer a SE asian to be strict on time. I thought i would be in for 2nd given i answered most of them. But was rejected.
First round: three medium level questions from Leetcode.
Second round: how to implement a stack with generic elements; how to use gcc to debug.
Third round: the interviewer not showing up.
Domande di colloquio [1]
Domanda 1
First round: three medium level questions from Leetcode.
Second round: how to implement a stack with generic elements; how to use gcc to debug.
Third round: the interviewer not showing up.
Ho presentato la mia candidatura tramite un'altra fonte. Ho sostenuto un colloquio presso Arista Networks (Bangalore Rural) nel mese di feb 2026
Colloquio
There were 3 rounds. First was DSA and C++ round. Second was design round LLD and HLD and last was the manager round. I got out in the first round. There were some c++ questions and one dsa of linked list
