InfoEdge Interview Experience for Software Engineer | On-Campus

Round 1:

• One easy to medium ques based on filling buckets according to queries made by the user (approx. 25 mins) (I was able to pass 7 / 9 test cases)
• One hard question based on a greedy algorithm for the max sweetness of sweets. Given 3 vectors, A that has the time taken to make the ith sweet, B that contains the sweetness level of ith sweet, C that contains the time that the sweet-maker has to make the sweet. Returning the max sweetness level of the sweets can be made satisfying all the conditions. (approx 45 mins) (I was able to pass 1 / 9 test cases)
• 4 sections for MCQ. 5 mins per section and 7 ques per section. Topics: Linux, Computer Fundamentals, DS, MySql queries

17 were selected

Round 2: Technical Interview

Time: 1 hour

Since I had web development projects and had written Javascript and React as my skills, the first few questions were based on that.

• Introduce yourself, what were your accomplishments in college?
• I see you have done web development projects, you have written javascript and react. What do you do exactly? What are the technologies you work on?
• When was the last time you worked on your projects?
• In which version of reacting you worked in?
• What’s the current version now?
• Where do you write API calls? What are lifecycle methods?  In which react Lifecycle method will you declare your API calls?
• What are the different parts of the Reactjs file?
• What are the different components in React?
• Tell me the features of OOPs
• Difference between data abstraction and data encapsulation?
• You have a linked list, you need to swap the alternate nodes and print it. Input: 1 -> 2 -> 3 -> 4 -> null Output : 2 -> 1 -> 4 -> 3 -> null

(I told him my approach and I coded it. Unfortunately, I was facing some compilation error so he asked me to dry run the code.)

• Do you know about trees? I said basic knowledge only. He asked to find the max sum of the nodes of the tree. (Something of this sort, I don’t remember properly) I said I can’t do it so he changed my ques.
• He gave me a string, he told me to print the characters with an increasing order of their frequencies Input:  “hhhheehheeellllo”  Output: “hello” Explanation: ‘h’ has the highest frequency so it comes first followed by e, l, and o.
• What happens when you type an URL? How is the website shown to us?
• How it will check if the user is logged in, the same URL is shown in both the cases.
• Do you have any questions for me? (I asked about his experience in infoEdge and if he wants to give me any feedback)

6  were selected

Round 3: Technical round

Time: 40 mins

• Introduce yourself.
• What were your projects? I said I made a portfolio website.
• He asked what technologies did you use?
• Can you design an API? Where does your interest lie in web development?
• Did he ask about closures in JavaScript? Why do we need it?
• What’s the need for a function inside a function?
• Write the code for string anagram.
• Write an optimized code for the Fibonacci series. Should be able to give the output till n = 100 in seconds.
• Tell the output of this code:

Var x = 10;
Function foo(){
alert(x);
Var x = 20;
}
foo();

• Can you implement Fibonacci with Closures? (I said C++ doesn’t have closures) He told me to code in JavaScript.
• What’s memoization?
• After this one more technical round was there of approx 1 hour and then 15 mins HR

Rejected, Only 4 were selected

My Personal Notes arrow_drop_up

Save