Round 1: https://www.geeksforgeeks.org/find-distance-between-two-nodes-of-a-binary-tree/ Round 2: Questions on previous projects? Question on technology choices. Comparison between frameworks? What’s the size of the thread pool you choose?… Read More
Tag Archives: Medlife
Round 1:Online Coding Round This round was conducted on hackerearth.com consisting of 3 programming questions and 15 MCQs from(CN, OS, DBMS) . Time alloted for… Read More
Round 1: Online Coding Round This round was on hackerearth.com consisting of 15 MCQs from various Computer Science related topics like OS, CN, etc and… Read More
Round 1: This round consisted of an online test on Hackerrank. There were 10 MCQs and 2 Programming questions. The MCQs had questions from OS,… Read More
Round 1: Q1: Sliding window, Q2: Reverse stack with constant space and only Push and Pop function, Q3: Implementation of HashMap, Q4: Basics of… Read More
The Selection Sort algorithm sorts maintain two parts. The first part that is already sorted The second part is yet to be sorted. The algorithm… Read More
Online Test: It was a Technical Round. (I didn’t attend this. I went for Interview of this company through Walkins) Interview consisted of three rounds.… Read More
Selection sort is a simple and efficient sorting algorithm that works by repeatedly selecting the smallest (or largest) element from the unsorted portion of the… Read More
