Filter interviews by
I applied via Campus Placement and was interviewed before Dec 2023. There were 4 interview rounds.
It was c++ coding test
I appeared for an interview in Oct 2020.
Round duration - 150 minutes
Round difficulty - Medium
Owing to the lockdown announced in view of the Covid-19 pandemic drive was conducted virtual.
Total Marks: 232 out of which 32 were for MCQ's and 200 for coding.
The time allowed: 2.5 hrs.
It was online proctored test and no tab switching is allowed.
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...
Given 'N' ropes of varying lengths, find the minimum cost to connect all ropes into one single rope.
Sort the lengths of ropes in ascending order.
Keep connecting the two shortest ropes at each step.
Add the cost of connecting the two ropes to the total cost.
Repeat until all ropes are connected.
Return the total cost as the minimum cost to connect all ropes.
You are provided with a N x 2 2-D array called Jobs
consisting of N
jobs. In this array, Jobs[i][0]
represents the deadline of the i-th job, while Jobs[i][1]
indicates the...
The objective is to determine the maximum profit by scheduling jobs within their deadlines.
Sort the jobs array based on the profit in descending order.
Iterate through the sorted array and schedule jobs based on their deadlines.
Keep track of the maximum profit achieved by scheduling jobs within their deadlines.
Round duration - 45 minutes
Round difficulty - Easy
On the day of interview I have revised all the core subjects and data structures and algorithms. Interview happened for 45 minutes and it went well.
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...
Delete a specific node from a singly linked list given the reference to the node.
Traverse the linked list to find the node to be deleted.
Update the pointers to skip over the node to be deleted.
Print the modified linked list after deletion.
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively until each array has only one element.
Merge the sorted halves to produce a completely sorted array.
Time complexity of Merge Sort is O(n log n).
Given an array or list ARR
of N
positive integers and an integer K
, your task is to rearrange all elements such that those with the K-th
bit (considering the rightmost bit as '1st' bit) eq...
Rearrange elements in an array based on the value of the K-th bit, with 0s coming before 1s.
Iterate through the array and separate elements based on the K-th bit value.
Use bitwise operations to check the K-th bit of each element.
Maintain the relative order of elements within each group.
Combine the two groups to get the final rearranged array.
Round duration - 30 minutes
Round difficulty - Easy
Immediately after clearing 2nd round they called me for next round which went for 30 minutes. Interviewer is flexible and everything went well.
Round duration - 20 minutes
Round difficulty - Easy
After successfully clearing 2 rounds of technical interview there was HR round which took place for 20 minutes.
Tip 1 : Do 300 problems in Coding Platforms (4 a day).
Tip 2 : Participate in codechef, codeforces contests.
Tip 3 : Work on core subjects and communication skills.
Tip 1 : Highlight your key accomplishments and most relevant skills within top half.
Tip 2 : Mention one full stack project which you can explain clearly.
Tip 3 : Keep it simple and clean. Be honest.
Tip 4 : Only list hobbies if they are professionally relevant.
Top trending discussions
posted on 7 May 2022
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Basic aptitude knowledge
Strong in java
I applied via Naukri.com and was interviewed before Sep 2019. There were 6 interview rounds.
posted on 15 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
It happens in very friendly manner.
Given an 'M x N' matrix, print all the possible paths from the top-left corner to the bottom-right corner. You can only move either right (from (i,j) to (i,j+1)) or dow...
Print all possible paths from top-left to bottom-right in a matrix by moving only right or down.
Use backtracking to explore all possible paths from top-left to bottom-right in the matrix.
At each cell, recursively explore moving right and down until reaching the bottom-right corner.
Keep track of the current path and add it to the result when reaching the destination.
Yes, I can create 2 tables in SQL and perform operations like INSERT, SELECT, UPDATE, and DELETE.
Create Table 1: CREATE TABLE employees (id INT, name VARCHAR(50), salary DECIMAL(10,2));
Create Table 2: CREATE TABLE departments (dept_id INT, dept_name VARCHAR(50));
Insert Data: INSERT INTO employees VALUES (1, 'John Doe', 50000);
Select Data: SELECT * FROM employees WHERE salary > 40000;
Update Data: UPDATE employees SET...
Round duration - 90 minutes
Round difficulty - Medium
No problem occur very friendly environment.
Round duration - 90 minutes
Round difficulty - Hard
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Explore all possible directions (up, down, left, right) from each cell.
Add the current direction to the path and recursively explore further.
If the destination is reached, add the path to the list of valid paths.
Tip 1 : Competitive programming plays a major role when you are appearing for coding rounds as a fresher. In the coding rounds, you won't get direct problems copied from Geeksforgeeks or Leetcode. You would be required to use your logical thinking to go ahead in the process. This is where competitive programming helps.
Tip 2 : Coding rounds are all about Coding + Timing. Most people fail to excel due to the pressure of a timer ticking on your head. So, instead of just solving problems, try to participate in timed contests. This will help you be used to the pressure of the timer.
Tip 3 : Many big companies like Microsoft, Amazon, and even Google expect you to be good at standard problems. So, once you are done with coding round by your logical skills and competitive programming, you must be well versed with some standard problems in order to excel.
Application resume tips for other job seekersTip 1 : Make it short, crisp, and simple. It is always good to have a 1 pager resume.
Tip 2 : Resume must comprise of the following: Educational Qualifications, Technical skills, Projects, Work experience (if any), Achievements. Other than this, you may include some extra co-curricular achievements.
Developed a web-based project management tool for a startup
Used React for the frontend and Node.js for the backend
Implemented user authentication and authorization using JWT
Integrated with third-party APIs such as Trello and Slack
Implemented real-time updates using WebSockets
Deployed on AWS using EC2 and RDS
I am a software engineer with experience in developing web applications and mobile apps.
Proficient in programming languages such as Java, Python, and JavaScript
Skilled in using frameworks like React, Angular, and Spring Boot
Experienced in working with databases such as MySQL and MongoDB
Familiar with Agile development methodologies and DevOps practices
My dream is to build innovative software solutions that positively impact people's lives.
Developing cutting-edge technology
Creating user-friendly interfaces
Solving complex problems
Collaborating with talented individuals
Making a difference in society
Continuous learning and growth
posted on 13 Jan 2015
based on 1 interview experience
Difficulty level
Duration
based on 4 reviews
Rating in categories
Software Engineer
397
salaries
| ₹6.1 L/yr - ₹20 L/yr |
Senior Software Engineer
284
salaries
| ₹9.5 L/yr - ₹36 L/yr |
Software Engineer2
193
salaries
| ₹9.8 L/yr - ₹21.3 L/yr |
Software Engineer III
185
salaries
| ₹13 L/yr - ₹35 L/yr |
Software Engineer II
153
salaries
| ₹9.2 L/yr - ₹23 L/yr |
DXC Technology
Sutherland Global Services
Optum Global Solutions
Virtusa Consulting Services