i
greytHR
Filter interviews by
I was interviewed in Jul 2021.
Round duration - 60 minutes
Round difficulty - Easy
It was a different and unique kind of mcq and coding test that I was gone through. It was like a chat application where Bot was sending some mcq question and I had to select the correct answer, sometimes when my answer goes wrong it gave another chance on the same time. All the mcq questions were based on HTML, CSS and JavaScript. And the last question was a JavaScript coding question in which we have to find the most occurred word in the given sentence.
Given a paragraph consisting of letters in both lowercase and uppercase, spaces, and punctuation, along with a list of banned words, your task is to find th...
Find the most frequent word in a paragraph that is not in a list of banned words.
Split the paragraph into words and convert them to uppercase for case-insensitivity.
Count the frequency of each word, excluding banned words.
Return the word with the highest frequency in uppercase.
Round duration - 45 minutes
Round difficulty - Easy
Discussion on Projects that i have specified in my resume and also the interviewer asked question based on JavaScript concept along with few easy kind of DSA problem.
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
The string 'S' should be evaluated in a case...
Validate if a given string is a palindrome after removing special characters, spaces, and converting to lowercase.
Remove special characters and spaces from the input string
Convert the string to lowercase
Check if the modified string is equal to its reverse to determine if it's a palindrome
Tip 1 : If currently in college do some development along with the DSA. Some good projects (1-2 is enough) will give your resume higher chances to get shortlisted.
Tip 2 : Be good with your JavaScript skills.
Tip 3 : HTML/CSS should be proficient.
Tip 1 : Put at least 2 nice projects.
Tip 2 : Should be to the point.
Top trending discussions
I applied via LinkedIn and was interviewed in Dec 2023. There was 1 interview round.
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
DSA, arrays, Graphs 3 rounds duration 1hr with mcqs
Advanced Graphs 2 questions mcqs 1hr
Hackerrank, html, javascript, css
I applied via Company Website and was interviewed in Sep 2023. There were 3 interview rounds.
Two problems in JavaScript to solve
Medium to hard questions based on arrays, dp
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
Divides array into smaller sub-arrays based on a pivot element
Recursively sorts sub-arrays
Combines sorted sub-arrays to get final sorted array
Time complexity: O(n log n) on average, O(n^2) worst case
Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Rotate a matrix by 90 degrees in place
Transpose the matrix
Reverse each row of the transposed matrix
posted on 4 Jan 2025
I applied via Company Website and was interviewed before Jan 2024. There were 2 interview rounds.
Online technical aptitude test
I applied via Campus Placement and was interviewed in Jul 2022. There was 1 interview round.
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 Job Fair and was interviewed in Oct 2024. There were 2 interview rounds.
It was an online test for interview
Dijkstra's algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
Dijkstra's algorithm uses a priority queue to select the node with the smallest distance from the start node.
It maintains a list of tentative distances to each node and updates them as it explores the graph.
The algorithm is commonly used in routing and network protocols to find the shortest path between nodes.
Example:...
Implementation Engineer
40
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Executive
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Implementation Specialist
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Zoho
Ramco Systems
PeopleStrong
SAP