Round 2 : FTF Technical Round (45 minutes) 1 Discussion on the questions solved and not solved in online coding round. 2 Asked about pointers and dynamic memory allocation in C. 3 Implement LRU Cache(Used queue) 4 Implement Web Crawler(Gave him a DFS based approach) 5 Asked about OOP’s concepts. 6 Given 6 digit no find duplicates in O(n) time and minimum space(He wanted an approach based on bit array). 7 Different types of scheduling algorithms in OS 8 How to implement a dynamic array(vector) in C 9 Memory layout of program(Stack Heap and other sections) Round 3 : FTF Techinal and HR Round (30 minutes) 1 Print elements of BST in sorted order.(Inorder traversal) 2 Print vertical traversal of binary tree(Both recursive and iterative) 3 Store phone no in phone directory such that you can retrieve information based on phone numbers 4 Maintain k most frequently dialed numbers in a phone 5 Question based on trie trees 6 Given an array of numbers find no of subarrays that begin with 3 and end with 6 7 Display all running process in linux (use top command) 8 Difference between zombie and orphan process 9 Why do you want to join Arista??