2 Technical Interview Rounds having focus on implementation and code writing asked some easy questions based on heap, tree, graph, dp and greedy algorithms and we have to solve it and explain the thought process