**Background**: 2.8 Years Experienced\n**Education**: CSE Grad from a Tier 3 college\n\n\n**Round-1: Online Hackerrank round**\n\nThis round had 3 coding questions to be solved in 1 hour. First 2 questions were easy and the third one was hard. I was able to solve the first 2 questions.\n\nDon\'t exactly remember the first two questions. \n\nThe third question was this: An inverted apple tree with two branches arising from each node is given. Basically a binary tree. An apple can be normal, nearly overhydrated or neary underhydrated. Penalties for overhydrated and underhydrated apple are given. You have to water just one node in tree such that the sum of overhydrated and underhydrated penalties for the whole tree is minimized. Input for tree is given in the form of a parent array and another array denotes the status of each of the apple node as 0 (neutral), -1 (under hydrated) and 1 (overhydrated)\n\n \n\n**Round-2: Technical Interview**\n\n1) https://www.***.org/minimum-number-platforms-required-railwaybus-station/\n\n2) https://www.***.org/root-to-leaf-path-sum-equal-to-a-given-number/\n\n \n\n**Round 3: Technical Interview**\n\n1) https://www.***.org/kth-largest-element-in-a-stream/\n\n2) Why strings in java are immutable ?\n\n3) How to create a immutable class in Java ?\n\n4) Is Java, call by value or call by reference ?\n\n \n\n**Round 4: Managerial Interview**\n\n1) Many questions(HLD/LLD) on previous projects.\n\n1) https://www.***.org/maximum-length-chain-of-pairs-dp-20/\n\n \n\n**Round 5: HR interview**\n\nQuestions on why I want to leave my current company, why I want to join Arcesium, and Salary expectations, etc

Background: 2.8 Years Experienced\nEducation: CSE Grad from a Tier 3 college\n\n\nRound-1: Online Hackerrank round\n\nThis round had 3 coding questions to be so