Filter interviews by
I applied via Campus Placement and was interviewed before Mar 2021. There were 3 interview rounds.
Do some previous year asked questions
DO some DSA
Do some Dsa
Top trending discussions
I applied via Campus Placement
Coding test based on leet code 1 hard(mountain array)and 1 easy(balance the parentheses)
I applied via campus placement at Lovely Professional University (LPU) and was interviewed in Mar 2024. There were 5 interview rounds.
Code and aptitude round it was.
I applied via Walk-in and was interviewed in Jan 2024. There were 2 interview rounds.
Online assignment questions was easy
Basic apti and logic and maths and python
Face to face basics and do all the projects in depth
I applied via LinkedIn and was interviewed before Aug 2023. There was 1 interview round.
Creating a given geometry using Solidworks software
Open Solidworks software
Select the appropriate tools for creating the geometry
Use dimensions and constraints to accurately define the geometry
Apply materials and textures for realistic rendering
Save the file in the desired format
I applied via LinkedIn and was interviewed in Jun 2024. There was 1 interview round.
posted on 28 May 2024
Very easy coding test just like class 2 standard
Moderate
Moderate level of questions are come
posted on 16 Sep 2021
I was interviewed in Jan 2021.
Round duration - 90 minutes
Round difficulty - Easy
Aptitude + Coding round:
Aptitude Questions (30 questions in 30 minutes), easy-medium level. Just after finishing the Coding round was there, 4 coding questions in 60 minutes.
Try to solve the problem in 'Single Sca...
Count the number of 0s, 1s and 2s in the given array. Then store all the 0s in the beginning followed by all the 1s then all the 2s.
I used Kadane's algorithm.....Luckily I solved same question some days before the test.
We are going to have two loops outer-loop and inner-loop
The idea is to find all substrings and insert each substring into a HashSet. Since there will be no duplicates possible into the HashSet, after we have inserted all the substrings in the HashSet the size of the HashSet will be equal to the number of distinct substrings.
The steps are as follows :
Round duration - 30 minutes
Round difficulty - Easy
He started with "Hello Rahul, Tell me about yourself briefly". Then he asked few theoretical questions and asked me about my favourite subject in engineering and why i like it. I named DS and Algorithms and reason is problem solving. He shared two coding questions in chatbox and asked me to write the code on given platform.
I wrote code and he then he asked me to look for corner cases. I said if n is large then programme will run for long time and optimized code accordingly.
Round duration - 45-60 minutes
Round difficulty - Hard
He started round with coding question + SQL + Coding question and some questions from my projects.
Given n number of rows containing data in this "cityname1 cityname2 distance" format and data is redundant. You have to think about a data structure to store them efficiently.
He asked me choose one tech to solve like coding language or SQL, i preferred c++ and used Unordered_map to store the data.
Tip 1 : Be very good with basic data structures.
Tip 2 : Try writing code on notepad sometimes.
Tip 3 : Focus on problem solving, during interview speak out your approach simultaneously while you are thinking about approach
Tip 1 : Write only what you know.
Tip 2 : Make it short.
I applied via Campus Placement
Coding test based on leet code 1 hard(mountain array)and 1 easy(balance the parentheses)
Technical Consultant
47
salaries
| ₹5.2 L/yr - ₹11.6 L/yr |
Senior Technical Consultant
43
salaries
| ₹9.9 L/yr - ₹23.5 L/yr |
Quality Engineer
24
salaries
| ₹5.5 L/yr - ₹9.4 L/yr |
Associate Technical Consultant
24
salaries
| ₹5 L/yr - ₹7.4 L/yr |
Associate Consultant
13
salaries
| ₹3.7 L/yr - ₹6.4 L/yr |
Infosys
TCS
Wipro
HCLTech