Filter interviews by
I appeared for an interview before May 2021.
Round duration - 50 Minutes
Round difficulty - Easy
50 questions - 1 hour
You are provided with a non-empty grid consisting of only 0s and 1s. Your task is to determine the maximum area of an island within the given grid.
An island consists of a...
Find the maximum area of an island in a grid of 0s and 1s.
Iterate through the grid and perform depth-first search (DFS) to find connected 1s.
Keep track of the area of each island found and return the maximum area.
Consider all four directions (horizontal, vertical, and diagonal) while exploring the island.
Handle edge cases like grid boundaries and already visited cells during DFS.
If no island is present, return 0 as the
Round duration - 60 Minutes
Round difficulty - Easy
2 question of coding - 1 hour
You have a robot currently positioned at the origin (0, 0) on a two-dimensional grid, facing the north direction. You are given a sequence of moves in the form of a string ...
Determine if a robot's movement path is circular on a 2D grid given a sequence of moves in the form of a string.
Create a variable to track the robot's position (x, y) and direction (north, east, south, west).
Iterate through the move sequence and update the position and direction based on the current move.
Check if the robot returns to the starting position after completing the move sequence.
Return true if the robot ends
You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string.
S : abcdg
1...
The task is to find the frequency of each character from 'a' to 'z' in a given string.
Create an array of size 26 to store the frequency of each character from 'a' to 'z'.
Iterate through the string and increment the count of the corresponding character in the array.
Print the array of frequencies as the output for each test case.
Round duration - 20 Minutes
Round difficulty - Easy
Introduction
Projects
DBMS
Oops
Given an integer K
, and two numbers A
and B
, count the occurrences of the digit K
in the range [A, B].
Include both the lower and upper limits in the count.
Count occurrences of a digit in a given range.
Iterate through the range [A, B] and count occurrences of digit K.
Convert integers to strings for easier digit comparison.
Handle edge cases like when A or B is equal to K.
Optimize by considering the position of K in the range.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Alternatively, you can use built-in functions like reverse() or slicing in some programming languages.
Remember to handle different types of characters like alphabets, numbers, and special characters.
Ensure to consider the constraints on the input
Round duration - 40 Minutes
Round difficulty - Easy
Introduction
Projects (describe all mention in resume)
Polymorphism (definition, types and real world example)
Joins (left & right)
Use of groupby
JVM (JDK & JRE)
You are provided with an array named BINARYNUMS
consisting of N
unique strings. Each string represents an integer in binary, covering every integer from 0 to N except for ...
Find the missing integer in binary form from an array of unique binary strings.
Iterate through the binary strings and convert them to integers.
Calculate the sum of all integers from 0 to N using the formula (N*(N+1))/2.
Subtract the sum of integers in the array from the total sum to find the missing integer.
Convert the missing integer to binary form and return it as a string.
Given an array of unique integers where each element is in the range [1, N], and the size of the array is (N - 2), there are two numbers missing from this array....
Given an array of unique integers with two missing numbers, identify and return the missing numbers.
Iterate through the array and mark the presence of each number in a separate array.
Find the missing numbers by checking which numbers are not present in the marked array.
Return the missing numbers in increasing order.
Tip 1 : Main focus on DS algo
Tip 2 : Do Subject also (dbms, os, etc)
Tip 3 : Do some good projects
Tip 1 : Highlight your strong points
Tip 2 : Change resume according to required skills by comapny
Top trending discussions
I applied via Company Website and was interviewed in Oct 2021. There were 3 interview rounds.
20 questions and 40 minutes time, questions were asked from computer science basics and aptitude
5 coding questions and 1 hr time. Questions were easy to medium level and mostly asked on topics like array, strings and basic data structures
I applied via Campus Placement and was interviewed in Jul 2022. There were 5 interview rounds.
Basic Aptitude questions mainly on quantitative
Google docs was shared which has 5 coding questions mainly on array and string.
The question is about finding the occurrence of characters in a string.
Iterate through the string and count the occurrence of each character.
Use a hash table to store the count of each character.
Consider the case sensitivity of the characters.
Handle special characters and spaces as required.
The angle between hour and minute hand of a clock at a given time.
Calculate the angle made by the hour hand with 12 o'clock
Calculate the angle made by the minute hand with 12 o'clock
Find the difference between the two angles
If the difference is greater than 180 degrees, subtract it from 360 degrees
The result is the angle between the hour and minute hand
Printing all the subsequences in an array with a given sum.
Use recursion to generate all possible subsequences.
Check if the sum of each subsequence is equal to the given sum.
Print the subsequences that satisfy the condition.
Time complexity: O(2^n).
The task is to print a string without any repeating characters.
Iterate through the string and keep track of the characters seen so far.
If a character is already seen, skip it.
Otherwise, add it to the output string.
Return the output string.
Sort an array of 0s and 1s in one loop using two pointers.
Use two pointers, one starting from the beginning and the other from the end.
Swap the values at the pointers if the value at the beginning pointer is greater than the value at the end pointer.
Continue until the pointers meet in the middle.
Time complexity is O(n).
I appeared for an interview in Aug 2022.
Find the first non-repeating character in a string.
Create a hash table to store character frequency
Iterate through the string and update the hash table
Iterate through the string again and return the first character with frequency 1
Find the longest substring that is a palindrome in a given string.
Use dynamic programming to solve the problem efficiently.
Create a 2D boolean array to store the results of subproblems.
Check for palindromes of length 1 and 2 separately.
For substrings of length greater than 2, check if the first and last characters are the same and the substring between them is also a palindrome.
Update the result if a longer palindrome
5 coding questions in the first round
A prime number is a number greater than 1 that is divisible only by 1 and itself.
Start with a loop to iterate through numbers
Check if each number is divisible by any number from 2 to its square root
If not divisible, add it to the list of prime numbers
I applied via Job Fair and was interviewed in May 2022. There were 2 interview rounds.
1hr duration, test can be attempted in any language. I have attempted in python.
I applied via Campus Placement and was interviewed in Feb 2024. There was 1 interview round.
Basic coding question on array and string.
Code Snept question with 3-4 Reasoning question. Google form
Pen paper coding round. String , Array . Linkedlist , graph, questions
To find the nearest prime number, iterate from the given number in both directions until a prime number is found.
Start iterating from the given number in both directions to find the nearest prime number.
Check if a number is prime by dividing it by all numbers less than its square root.
Keep track of the closest prime number found during the iteration.
Find the second maximum number in an array of strings.
Convert the array of strings to an array of integers.
Sort the array in descending order.
Return the second element in the sorted array.
posted on 28 Nov 2024
DSA questions such as Map, linked list
posted on 29 Nov 2024
I applied via Campus Placement
Three were basic questions around strings and arrays
based on 1 review
Rating in categories
Software Engineer
80
salaries
| ₹4.2 L/yr - ₹13.2 L/yr |
Senior Software Engineer
35
salaries
| ₹8 L/yr - ₹20.5 L/yr |
E-Commerce Analyst
35
salaries
| ₹4 L/yr - ₹7 L/yr |
Business Analyst
19
salaries
| ₹2.4 L/yr - ₹10 L/yr |
QA Engineer
18
salaries
| ₹4 L/yr - ₹9 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services