Filter interviews by
I was interviewed before Sep 2020.
Round duration - 30 minutes
Round difficulty - Easy
Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.
The first line contains an integer 'T' r...
Round duration - 30 minutes
Round difficulty - Easy
Tip 1 : Do Algorithms
Tip 2 : Keep basics clear
Tip 3 : be confident
Tip 1 : Exclude information like your birth date or marital status. You do not have to respond to questions about religion, race, or gender on an application.
Tip 2 : Keep it Clean
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.
Basic apti and logic and maths and python
Face to face basics and do all the projects in depth
I applied via campus placement at G Pulla Reddy Engineering College, Kurnool and was interviewed in Oct 2023. There were 2 interview rounds.
It was conducted through hackerrank platform which contains 5 programming questions
There were 3 sections
I applied via campus placement at Pune University and was interviewed in May 2023. There were 2 interview rounds.
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
posted on 16 Apr 2024
Level Order Traversal for Binary Tree is a method to visit all nodes level by level starting from the root.
Use a queue data structure to keep track of nodes at each level
Start by pushing the root node into the queue
While the queue is not empty, dequeue a node, visit it, and enqueue its children
Left join includes all records from the left table and matching records from the right table, while right join includes all records from the right table and matching records from the left table.
Left join keeps all records from the left table, even if there are no matches in the right table.
Right join keeps all records from the right table, even if there are no matches in the left table.
Example: If we have a table of em...
posted on 28 May 2024
Very easy coding test just like class 2 standard
Moderate
Moderate level of questions are come
I applied via Campus Placement
Coding test based on leet code 1 hard(mountain array)and 1 easy(balance the parentheses)
based on 7 reviews
Rating in categories
Software Engineer
14
salaries
| ₹1.7 L/yr - ₹5 L/yr |
Business Development Executive
11
salaries
| ₹2 L/yr - ₹3.6 L/yr |
Trainee
11
salaries
| ₹1 L/yr - ₹2.2 L/yr |
Software Developer
10
salaries
| ₹0.6 L/yr - ₹4 L/yr |
Intern
10
salaries
| ₹1 L/yr - ₹3 L/yr |
HCLTech
TCS
Wipro
Infosys