Experience - 1year
graduated - 2023 / Tier 3 college
saw a opening oin linkdin and Apply thorugh a refrall from a employe
got a call from hr after some day , 1st interview was scheduled

1. 1 round is for Problem solving
   interviwere came and start with introduction , and interview moved directly to the DSA problem
   question -
   An integer array A of size N denoting the heights of N trees is given.You need to chop down B metres of wood. It is an easy job for you since you have a new woodcutting machine that can take down forests like wildfire. You are only allowed to cut a single row of trees.
   The machine works as follows: Once you sets a height parameter H (in metres), and the machine raises a giant sawblade to that height and cuts off all tree parts higher than H (of course, trees not higher than H meters remain intact). You can then takes the parts that were cut off. For example, if the tree row contains trees with heights of 20, 15, 10, and 17 metres, and you raises his sawblade to 15 metres, the remaining tree heights after cutting will be 15, 15, 10, and 15 metres, respectively, while you will take 5 metres off the first tree and 2 metres off the fourth tree (7 metres of wood in total).You are ecologically minded, so you don't want to cut off more wood than necessary. That's why you want to set his sawblade as high as possible. find the maximum integer height of the sawblade that allows you to cut off at least B metres of wood.
   Output Format
   Return a single integer denoting the maximum integer height of the sawblade that still allows you to cut off at least B metres of wood.
   Example Input
   Input 1:
   A = [20, 15, 10, 17]
   B = 7
   Example Output
   Output 1: 15
   i was able to solve this question using binary search then wrote the code in java for this, and explained the Time and space complexity
   2nd question :
   Given two integers arrays A and B of size N each.
   Find the maximum N elements from the sum combinations (Ai + Bj) formed from element in array A and B.
   1 <= N <=2^ * 105
   -1000 <= A[i] B[i] <= 1000
   Input 1:
   A = [1, 4, 2, 3]
   B = [2, 5, 1, 6]
   output: [10, 9, 9 8]
   i was ablr to solve this question using heap , and then discussed the solution , and complexity.
   and fished the 1st round
   got a call frojm hr for 2nd round as 1st round was positive
   2. **2nd round is for CS and OOPS fundamentals **
   interview started with inroductions and then some question regarding my experience in my company and then interviewer asked me to design Netflix , i asked the requirment and then start with entities , their properties and methods
   and then interview told me to write the code , i started wring the classes , and wrote some methos , then times up
   Verdict : not selected , not sure what they wanted