Lynk Logistics Interview Experience for SDE (On-campus) 2022

So Lynk Logistics came to our campus for hiring.

First Round: Online Test 

• Platform: HackerEarth
• Time: 1.5 hours 

3 Coding Questions 

• https://www.geeksforgeeks.org/count-pairs-in-array-whose-sum-is-divisible-by-k/
• https://leetcode.com/problems/rotting-oranges/
• Find two max elements in an array. if both are the same, remove them. else subtract and insert the absolute value of the difference between the two numbers

I solved all 3 in 20 mins.

12 people were shortlisted for round 2 (physical interview)

Round 2 ( Tech round ): The interviewer was very calm and composed. He asked about my introduction and then proceeded by asking 2 DSA questions 

• Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses – https://leetcode.com/problems/generate-parentheses/
• Design a stack that supports push, pop, top, and retrieving the minimum element in constant time – https://leetcode.com/problems/min-stack/

I solved the first one with backtracking + recursion within 10 mins. The interviewer asked me to write down the code on paper and explain the approach. For the second question, I first told him O(N) approach. He asked me to optimize it using O(1) approach. I took a lot of time to come up with a solution and then I asked for a hint. After that, I was able to figure out the answer 

Round 3( Tech Round): The interviewer introduced himself and then asked me to introduce myself. He scanned through my resume and found that I cleared GATE CS despite being from an ECE background. He started asking about it. How I cleared, What I studied etc. Then he started questioning with DBMS. He asked about the Primary key, Foreign key. Then, He asked only one DSA question 

• Given an array that consists of 0s, 1s, and 2s in a shuffled manner. Sort it without using any sorting algorithms  – https://leetcode.com/problems/sort-colors/

For this one, I started with 2 pointer approach, and then I was getting a wrong answer. Then I showed him where I went wrong. He gave a clue to use one more variable. It took me a while. But I figured it out and showed him the dry run of the approach. He dint ask me to code it. And then the interview ended 

Round 4(Tech Round): The interview started by introducing myself. and then she gave 2 coding questions 

• Given an integer array nums of unique elements, return all possible subsets. The solution set must not contain duplicate subsets. – https://leetcode.com/problems/subsets/
• Find the lowest common ancestor in a binary tree – https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/

I solved both problems quickly and then she asked a few questions about how will I store an infinite number of words optimally. I said N-ary Tree and tried to explain it as much as I can. I really dint know what was the right answer.. finally, she was satisfied with my answer.

The interview ended. 

Result: SELECTED!