Recently I got to know about the Research Engineer Position being open to freshers at LG Soft India and I applied for the position through a referral. The main work was in C/C++ development. It was clearly mentioned in the Job Description that the candidate should be familiar with C/C++ Concepts, Object Oriented Programming (C++), and Data Structures and Algorithms using C++.
Online Assessment
I read through various interview experiences for LG Soft India and almost all of them had an aptitude test, a few MCQ-based questions, and 1-2 coding questions for their online assessment tests. The online assessment that I gave had just 3 coding problems ( 1 Binary Search, 1 Dynamic Programming, and 1 Graph-based). So one should be prepared for such situations if the test pattern is not disclosed by the company beforehand. I do not remember the rest two problems except the graph one so I am mentioning it below.
Q) Graph-Based
You are given an array of N numbers where among them two numbers will be hosting a championship and the rest have to reach either of the two. Then all the possible flights between any two countries were mentioned. Then in the next few lines, the venues hoisting the championship were mentioned. We have to find out the total minimum time taken for the rest to reach either of the two hoisting venues. Traveling from 1 to 2 below will take up 1 unit of time.
Input
4 (4 numbers given)
1 --- 2( Flights were both ways)
2--- 3
3--- 4
2 3 (In this case 2 and 3 are hoisting)
1 2
Output
2
3
Reason: In the first output we see that if 2 and 3 are hoisting then 1 and 4 have to reach either 2 or 3 whichever's nearest. So minimum for 1 is 1---2( flight available). Similarly for 4, flight to three available. So each have to take just one flight and hence total 2 units of time.
In the second output we see that 3 and 4 have to reach either 1 or 2. Nearest to 3 via flight is 2 (direct) so 1 unit of time. Nearest to 4 is also ( 4--->3--->2). So 2 units of time. Total time is 2+1= 3 units.
I was only able to pass a few test cases in the first two questions.
After this round among 40, 4 were selected who moved to further rounds (Interviews).
Round 2 (Technical Round-1)
The interviews were held on site on the same day as the online assessment. Focus was largely on concepts of Object Oriented Programming and Operating System.
The interviewer was pretty chill and friendly and gave hints whenever I was stuck and even engaged in healthy discussion on some topics with me.
He asked questions on-
- Virtual Functions
- V- tables in c++
- Difference between encapsulation and abstraction and implement them via an example.
- How are abstract classes and interface different from each other and how can abstraction be achieved using interfaces?
- Some example codes in OOPs
- Two easy level leet code questions.
- Find the first occurence of a repeating character in an array
- Rotate an array K times)
- Questions on what are mutex and semaphore, how are they different and code to implement them.
- Basics of multithreaded programming in C++
- A few basic questions from GIT
- Lastly he asked me about the online assessment and the questions that were asked and asked me to explain my approach on the graph problem.
This round lasted for around 45 minutes.
Round 3 (Technical Round 2)
The second technical round consisted of more questions from the OOPs concepts. Questions from resume were also asked in this round. Questions about previous internship experience was asked. This round lasted around 20 minutes after which I was called for the HR round.
Round 4 (HR Round)
This round basically revolved around questions from resume and why I wanted to join LG. The HR told me about the compensation breakup and other benefits. I was told that I might have another round and if not they would roll out an offer letter.
In the end they didn't take any further round and gave an offer for the position to me.
My advice would be to stick to the JD and prepare thoroughly whatever the JD says is required.