#!process Google TM
1 messages · Page 1 of 1 (latest)
Jan 21st
congratulations what was the level of questions asked and what were the topics
congrats! which rec did you have?
Questions were medium with hard-ish follow ups. r1 was greedy, r2 q1 was array with optimal being segment tree but acceptable solutions were hash map and Doubly linked list r2 q2 was graph disjoint set
ML