years of experience: 6 months( full stack profile)
company: tier 2 company
college: tier 1+
graduation year:2021
Round 1:Online Coding HackerRank Test
ques1>maximum Path Sum in a Tree(LeedCode Hard)
ques2>given a number as a string find next greatest number which is a palindrome(Leetcode medium)

Round2:Technical Interview(1 hour)
ques1>related to meeting rooms2 but modified. dont remember the exact question.
ques2>A sorted but rotated Array is given . find the peak element(most optimized soln was expected and it wasnt mentioned that this was a sorted and rotated array)
2 behaivioural questions

Round 3:Technical Interview(1 hour)
ques1:find the last node in each column formed in a tree(tricky question, not that straight forward as one might think in one go)(dont think this is finding all the leaf nodes) question is different from that.
ques2:return maximum avg sum of a subtree for a given tree.(Leetcode medium)
2 behaivioural questions

Round 3:bar Raiser(1 hour)
the interviewer was in rush. 15 mins for each techincal question and 15 min for each behaivioural question
ques1:a 2D matrix is given and all the elemnets are 0. only one element is 1. Given an algorithm which will find this 1 quickly.
ques2: coin change problem(straight forward Leetcode)
2 behaivioural questions.

Round4: Hiring Manager Round(45 mins)
ques1: difference between horizontal scaling and vertical scaling
ques2: what is segmentation? how is it different from paging.
ques3: couple of database questions.
ques4:questions related to multi threading.
couple of behaivioural questions.

final verdict:Got an Offer
CTC-48LPA with 24 Base