Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There was 1 interview round.
Submission of PPAP documentation to Customer & Level involves thorough review, organization, and communication.
Ensure all required documents are included in the submission package
Review each document for accuracy and completeness
Organize the documents in a clear and logical manner
Communicate with the Customer & Level regarding any questions or clarifications needed
Follow the specific submission guidelines provided by t...
COQ stands for Cost of Quality, which includes the costs associated with ensuring product quality and the costs resulting from poor quality.
COQ includes prevention costs, appraisal costs, internal failure costs, and external failure costs.
Prevention costs are incurred to prevent defects from occurring, such as training employees or implementing quality control processes.
Appraisal costs are incurred to detect defects, s...
I applied via Recruitment Consulltant and was interviewed before Feb 2022. There were 4 interview rounds.
Top trending discussions
posted on 16 Sep 2021
I was interviewed in Nov 2020.
Round duration - 90 minutes
Round difficulty - Medium
The online test was scheduled on 10:00 AM. Total 304 students were eligible who appeared for the test. 93 students were shortlisted in this round. MCQs were asked and two coding question
MCQs were of medium to hard level.
OOPS(2 Question)
DBMS(2 questions)
Networking(2 Questions)
Operating System(2 Questions),
Aptitude(2 Questions)
Given an array arr
of length N
consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Find the sum of the subarray with the maximum sum among all subarrays in a given array.
Iterate through the array and keep track of the maximum sum subarray seen so far.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Consider the case where all elements in the array are negative.
Handle the case where the array contains only one element.
Gary has N coins placed in a straight line. Some coins have their head side up, and others have the tail side up.
Convention:
1 denotes the HEAD side is up.
0 denotes the TAIL sid...
Find the maximum number of head-side up coins by flipping a continuous segment of coins.
Iterate through the array and calculate the maximum number of head-side up coins without flipping.
Iterate through the array and calculate the maximum number of head-side up coins after flipping a continuous segment.
Compare the results from the above two steps to find the maximum number of head-side up coins obtainable.
Round duration - 60 minutes
Round difficulty - Medium
It was technical interview round, which was purely based on coding followed by 1 SQL query. Duration of round was of 1 hour from 10 AM-11AM. Interviewer asked me 2 Coding questions one to solve and run on Hackerrank codepair platform and for another one she asked only my approach to solve problem. In the remaining last 10 minutes interviewer asked me 1 SQL query on JOIN. Total 28 students were shortlisted in this round.
You are provided with an integer array ARR
of length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T...
Find the smallest positive integer missing from an array of integers.
Iterate through the array and mark positive integers as visited by changing the sign of the corresponding index.
After marking, iterate again to find the first positive integer with a positive value, which will be the smallest missing positive integer.
Handle edge cases like all negative numbers, duplicates, and missing 1 separately.
Given a strictly increasing sequence of integers VEC
, identify the Kth
missing contiguous integer element that is not present in the sequence, starting from the ...
Find the kth missing element in a sequence of integers.
Iterate through the sequence to find missing elements.
Keep track of the count of missing elements found.
Return the kth missing element once count reaches k.
Tip 1 : Do practice a lot of competitive programming.
Tip 2 : Revise complete Data Structures at least 3-4 times.
Tip 3 : Do practice SQL queries.
Tip 4 : Do at least 1 Internship from a good company.
Tip 5 : Maintain CGPA up to 7.5
Tip 1 : Keep it short, Do not repeat the same achievements in different sections.
Tip 2 : Do participate in extracurricular activities and Hackathons.
I applied via Approached by Company and was interviewed before Jul 2023. There were 3 interview rounds.
Reasoning with English
The number of cubes that can fit into a room depends on the size of the room and the size of the cubes.
The number of cubes that can fit into a room can be calculated by dividing the volume of the room by the volume of each cube.
For example, if the room is 10ft x 10ft x 10ft and each cube is 1ft x 1ft x 1ft, then 1000 cubes can fit into the room.
Consider the dimensions of the cubes and the room to determine the maximum
Guestimates are rough estimates used to quickly check the power of analysis.
Use simple math to make quick calculations
Round numbers for easier calculations
Estimate based on known data points
Use common sense and logic
Provide a range of possible values
I was interviewed in Feb 2024.
I was interviewed in Apr 2024.
Easy to moderate and question were lengthy
Easy to clear this round 1
I applied via Approached by Company and was interviewed before Mar 2022. There were 2 interview rounds.
I was interviewed in Dec 2016.
The number of 0s in 1 to 1000 is 192.
There are 1000 numbers from 1 to 1000.
Every 10 numbers have one 0 in the units place.
Every 100 numbers have ten 0s in the tens place.
Every 1000 numbers have one hundred 0s in the hundreds place.
Therefore, there are 1 + 10 + 100 + 81 = 192 0s in total.
Cut the cake in half, then cut each half in half again. Repeat once more to get 8 equal parts.
Use a long, sharp knife to make clean cuts.
Start by cutting the cake in half vertically.
Then cut each half in half horizontally.
Repeat the process once more to get 8 equal parts.
Use a cake divider or toothpicks to mark where to cut for even slices.
Core is not the best fit for our current needs and goals.
Our current focus is on expanding our reach to new markets.
Core may not have the necessary features to support our growth plans.
We have evaluated multiple options and found a better fit for our requirements.
based on 4 interviews
Interview experience
based on 29 reviews
Rating in categories
Production Engineer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Junior Manager
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
EXL Service
Access Healthcare
AGS Health
Straive