Your seniors at National Institute of Technology (NIT), Warangal were your true well-wishers, they shared their placement interview questions for you. 🙏
Q8. If we are give a link list such that a few nodes from end are common....and both are of unknown different length....how to find first common node....
Round: Test Experience: It was online coding round....we were given two problems and asked to sole any one of them. If you keep your cool you can solve both in the given code problems were not difficult. Tips: Keep yourself cool. Duration: 120 minutes
Round: Technical Interview Experience: This round was in college itself just after the written exam & he asked me the following questions: In an array there is a number which is guaranteed to be repeated more than n/2 times. find the number in o(n) time and o(1) space complexity. We r given 3 arrays of equal size, a number k, we have to find 3 number one from each array which add up to k. Give the best solution. I first gave n3 and n2 solution.
Round: Technical Interview Experience: This round was just after the first round. We are given a number of balloons with different sizes and only one parameter to indicate size.we can fit smaller balloon in larger...we have to make minimum number of sets such that in a such after fitting into each other they reduce to one balloon . Asked me to explain 01 knapsack problem in detail.
Round: Technical Interview Experience: Half an hour after HR round I got the call....this was a difficult one to face as we have to hold phone and concentrate and explaining is also very difficult. I am given day high and day low of past 10 years of a share script. If I could buy and sell only once when would I like to buy and sell to maximize my profit tell in o(n). We are given two circles with center and radius of them and we have to tell whether they are completely apart/touch externally/cut/touch internally/one is inside other, if they cut then find the points of intersection. One question of travelling person based on dijkstra`s algorithm then asked me to explain dijkstra`s algorithm. Then asked what if negative cycles are there and then said find the complexity in terms to number of edges.
Round: HR Interview Experience: this was a small interaction just to make us familiar in mumbai office. She asked about me,what do you think about directi,what r ur favorite subjects,what language do u prefer.
Round: Presentation Experience: First they shown a presentation about the bad ways of writing code...then they gave code snippets to identify wrong code writing practices and to modify the code . After this we were asked to choose on technical topic of our own choice which they expected to be out of our academics...and speak on it for 10 minute....after we finish speaking they will ask questions....about what we said... I did very bad in this round.....as I could not get a good topic.
Round: Technical Interview Experience: This was taken by CEO of company itself....he asked a few things...but all in depth. Given an array having +ve as well as –ve numbers ....find the maximum subsequence sum......if there are two subsequence such that both sum up to maximum....print the smaller one....only one scan allowed.....asked to write the code after listening to algorithm....then said to optimize code.... Asked about multithreading.....how is it helpful....then said...if we have only one processor and there is no read write....we have just computations. Wwhy would we use threading. Then said we have 100 computations and 2 processors which one will do faster one thread/two thread/three thread ...and why. Compare bst and hashing...asked me to give 7 differences and how to improve hashing if we have many collisions. I said linear chaining/linear probing/quadratic probing....he was not happy then I said to use bst in place of linear chain...and then I said multiple hashing...and he was happy.
Skill Tips: Be present in online coding communities. Solve problems on careercup.com. Let interviewer know whatever you are thinking. Whether it is the way you are approaching problem or u r tensed or you did bad in last round and want to make most of it whatever that makes you feel free and if you don’t no one wins. Play smart. If you know the good solution to a problem. Don't tell the solution in first shot, first give some bad solution and then give good one. Make him feel that you faced the problem first time and you thought over here only. College Name: NIT WARANGAL
Round: Test Experience: Technical round was more of a coding round. They asked us to create login at codechef.com and uploaded two problems,out of which we were supposed to do one. Duration: 120 minutes
Round: Technical Interview Experience: Technical interview consisted mostly of Algo questions. Apart from that simple questions from OOPS(Inheritance,Polymorphism,Virtual Function), DBMS(like design of tables for a specific scenario,ACID properties), Networks(TCP/UDP Protocol) and OS(Multithreading) were asked. Coming to the Algo questions, most of them were the ones we saw at CAREERCUP.COM.
Round: HR Interview Experience: The HR interview was not all that a serious one. Usual HR questions were asked like Tell me about yourself,Your ambition etc. The interviews were interesting and I enjoyed them throughly. But the whole process gets pretty hectic. In 2 days, I just got 56 hrs to sleep.
Skill Tips: 1. Start coding at online coding competitions. 2. Prepare all questions from CAREERCUP.COM. 3. Be prepared with basic fundas in OS,Networks,DBMS and OOPS. 4. Be confident and don't get stressed by continuous interviews. College Name: NIT WARANGAL