Filter interviews by
I applied via LinkedIn and was interviewed in Apr 2022. There were 4 interview rounds.
A comprehensive article about 1000 words
Top trending discussions
I applied via Recruitment Consulltant and was interviewed before Sep 2021. There were 6 interview rounds.
Hacker rank test on Python, SQL and Aptitude , English
Focused more on Logics and DSA
I was interviewed in Oct 2021.
Round duration - 105 minutes
Round difficulty - Medium
There were 3 problems .
One was easy but the other two were of medium level.
Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...
The problem requires assigning aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.
Sort the array of stall positions in ascending order.
Use binary search to find the largest minimum distance between cows.
Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.
If it is possible, update the maximum distance and continue binary search ...
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...
The problem is to find the shortest path between two houses in an unweighted graph.
The graph represents the city of Ninjaland with houses connected by roads.
The input consists of the number of test cases, number of houses and roads, starting and ending house, and the roads between houses.
The output is a vector of nodes representing the shortest path from the starting house to the ending house.
If there are multiple shor...
Given a positive integer N
, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...
The task is to count the total number of '1' in the binary representation of all numbers from 1 to N.
Convert each number from 1 to N into its binary representation
Count the number of '1' bits in each binary representation
Sum up the counts of '1' bits for all numbers
Return the sum modulo 1e9+7
Round duration - 60 minutes
Round difficulty - Easy
The interviewer was very polite and straightforward.
Firstly he introduced himself and then asked me to introduce myself and then he jumped to the coding problems.
After the coding problems, he asked some questions from the OS and DBMS.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
The task is to reverse the words in a given string, removing any leading or trailing spaces and replacing multiple spaces between words with a single space.
Split the string into words using spaces as delimiters
Reverse the order of the words
Join the reversed words with a single space between them
Remove any leading or trailing spaces
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...
The task is to reverse a linked list in groups of size K.
Iterate through the linked list in groups of size K
Reverse each group using a helper function
Connect the reversed groups to form the final reversed linked list
Round duration - 60 minutes
Round difficulty - Medium
The interviewer was very polite and straightforward, firstly he introduce himself and then ask me to introduce myself and then ask some ques on my projects and then he jumps to the coding problems.
Given a string STR
consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters from the string a...
The task is to remove consecutive duplicate characters from a given string and return the new string.
Iterate through the characters of the string
Compare each character with the next character
If they are the same, skip the next character
If they are different, add the current character to the new string
Return the new string
Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...
The question asks to find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row of a given matrix.
Iterate through each cell in the first row and calculate the maximum sum path ending at that cell
For each cell, calculate the maximum sum path ending at that cell by considering the three possible directions
Store the maximum sum path ending at each cell in a se...
Tip 1 : Deep knowledge of the projects mentioned in your resume is a must.
Tip 2 : Practice must do GFG coding questions.
Tip 3 : Practice as many problems as you can from Leetcode.
Tip 1 : Mention 1 or 2 projects in your resume.
Tip 2 : Don't put false things in your resume.
I applied via Walk-in and was interviewed in Oct 2023. There were 3 interview rounds.
Vlookup is a function in Excel used to search for a value in a table and return a corresponding value.
Syntax: =VLOOKUP(lookup_value, table_array, col_index_num, [range_lookup])
lookup_value: The value to search for in the first column of the table.
table_array: The range of cells that contains the data.
col_index_num: The column number in the table from which to retrieve the value.
range_lookup: Optional. TRUE for approxim...
HLOOKUP is a function in Excel used to search for a value in the top row of a table and return a value in the same column from a specified row.
HLOOKUP stands for Horizontal Lookup.
It is used to search for a value in the top row of a table and return a value in the same column from a specified row.
Syntax: =HLOOKUP(lookup_value, table_array, row_index_num, [range_lookup])
Example: =HLOOKUP(123, A1:D4, 3, FALSE) will searc...
Assignment 1 ,3 and 3
Payroll realated questions and answers
I was interviewed in May 2022.
Round duration - 120 Minutes
Round difficulty - Easy
Given a list of rectangles, where each rectangle is represented by an array of four integers indicating its bottom-left and top-right corners, calculate the total area covered b...
Calculate total area covered by a list of rectangles on a plane.
Iterate through each rectangle and calculate its area
Check for overlapping areas between rectangles
Sum up the total area covered by all rectangles
Round duration - 60 Minutes
Round difficulty - Medium
Oops concepts and 1 DSA problem
You are provided with a string, termed as DIGIT_PATTERN
, which consists solely of digits. The objective is to identify the first digit that repeats in the sequence. If there's no...
Identify the first repeating digit in a given string of digits.
Iterate through the string and keep track of seen digits using a set.
Return the first digit that repeats, or -1 if no digit repeats.
Time complexity: O(n), where n is the length of the input string.
Round duration - 60 Minutes
Round difficulty - Medium
Firstly Some general questions and then suddenly a cosing question with modifications
Given an input string STR
, generate and print all possible permutations of the string.
str
All permutations of the input string, each on a new line.
Generate and print all possible permutations of a given input string.
Use recursion to generate all permutations by swapping characters in the string.
Maintain a visited array to keep track of characters already used in a particular permutation.
Print each permutation as it is generated.
Handle duplicate characters by skipping swapping if the character is already in the current position.
Tip 1 : You should be perfect in what you know
Tip 2 : Prepare atleast DSA standard questions very well
Tip 3 : Don't ignore OOPs, they are asked very frequently.
Tip 1 : Add good projects
Tip 2 : Must mention all your coding profiles and github where you worked.
I applied via Campus Placement and was interviewed before Feb 2022. There were 4 interview rounds.
I applied via LinkedIn and was interviewed before Aug 2023. There were 2 interview rounds.
Data extraction, solid questions, oops
Product Specialist
74
salaries
| ₹0 L/yr - ₹0 L/yr |
Accounts Manager
71
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Consultant
57
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
55
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
50
salaries
| ₹0 L/yr - ₹0 L/yr |
PeopleStrong
SAP SuccessFactors
greytHR
Sumtotal Systems