← Back to experiences
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/experiences/…$
Status: MS in CS Position: L60 Software Engineer at Microsoft Location: Redmond, WA Date: February 21
Online Assesment:
On-site rounds:
Round 1: One Behavioural and Level Order on Tree and BFS on Graph N-ary Tree Level Order Traversal Second question: imaging the above input as Graph. i.e. two nodes will have the same child. so should not visit it if already visited.
Round 2: One Behavioural and Linked List Reversal and Reverse in K Groups Reverse Reverse in K Groups
Round 3: One Behavioural and Given Char array and list of delimeters, split the array using the delimeters
/*input:
char[] arr = {'a', 'b', 'c', '-', 'd', 'e', '/','a', ':', 'b', 'c','*', 'd', 'e'};
char[] delimiters = {'/', '*', ':', '-'}