← Back to experiences
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/experiences/…$
Technical Phone Screen
Question similar to the Number of Islands problem from Leetcode but adding bridges in between of the island and finding the path with minimum number of islands crossed. Note that some islands may have bridges between themselves (for example an U shaped island with a bridge in between). In that case we only cross one island.
<details> <summary>For example</summary> 0 water, 1 land and 2 a bridge, find the path with less islands crossed from upper right corner lower right corner1,1,1,1,1,1,1,1,1 2,0,1,0,0,0,0,2,0 1,1,1,0,0,0,0,1,1 0,0,2,0,0,0,0,1,1 0,0,1,1,1,0,0,1,1 0,0,0,0,1,2,2,1,1
</details>Onsite Interview (5 rounds)
Round 1: Engineering Manager
Round 2: (Whiteboard session)
Round 3: (Architecture Interview)
Round 4: (Coding Interview)
Round 5 (Cultural and behavioral interview):