Filter interviews by
Clear (1)
I was interviewed 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
posted on 21 Mar 2015
I was interviewed before Aug 2016.
I was interviewed in Apr 2017.
I am a software developer with a passion for coding and problem-solving. My family is supportive and has always encouraged my career in tech.
Experienced software developer
Passionate about coding and problem-solving
Supportive family that encourages my career in tech
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This was an easy round which went really smooth.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iteratively calculate F(n) using F(n-1) and F(n-2).
Ensure the input N is within the constraints 1 <= N <= 10000.
Example: For N = 5, the 5th Fibonacci number is 5 (1, 1, 2, 3, 5).
Given a positive integer N
, your task is to determine and return all prime numbers less than or equal to N
.
N = 10
2 3 5 7
N = 20
Implement a function to return all prime numbers less than or equal to a given positive integer N.
Create a function that takes a positive integer N as input
Iterate from 2 to N and check if each number is prime
Use a helper function to determine if a number is prime
Return an array of all prime numbers less than or equal to N
A merge join in SQL is a method of combining two sorted datasets by matching corresponding rows based on a specified condition.
Merge join is used when joining two large datasets that are already sorted.
It is more efficient than other join methods like nested loop join or hash join for sorted datasets.
The join condition must be an equality condition.
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.id = table2.i
Round duration - 30 minutes
Round difficulty - Easy
The round went excellent. I really enjoyed it. Just be confident about whatever you answer
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This round went well. Interview depends on your basic knowledge of C/C++.
Given two sparse matrices MAT1
and MAT2
of integers with dimensions 'N' x 'M' and 'M' x 'P' respectively, the goal is to determine the resulting matrix produced by their multipl...
Implement a function to multiply two sparse matrices and return the resulting matrix.
Create a function that takes two sparse matrices as input and returns the resulting matrix after multiplication
Iterate through the non-zero elements of the matrices to perform the multiplication efficiently
Handle the edge cases such as empty matrices or matrices with all zero elements
Ensure the dimensions of the matrices are compatible
Tanmay and Rohit are best buddies. Tanmay gives Rohit a challenge involving an array of N natural numbers. The task is to perform and answer a series of queries on the ...
Count the number of even or odd numbers in a range of an array based on given queries.
Create an array to store the input numbers.
Iterate through the queries and update or count even/odd numbers based on the query type.
Output the count of even or odd numbers for each query of type 1 or 2.
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed in Jul 2017.
I was interviewed in Apr 2017.
Firmware is a type of software that is embedded in hardware devices to control their functionality.
Firmware is a combination of hardware and software.
It is used to control the behavior of hardware devices.
Firmware is typically stored in non-volatile memory, such as ROM or flash memory.
Examples of devices that use firmware include routers, printers, and digital cameras.
I am a passionate software developer with experience in building web applications and solving complex problems.
Experienced in programming languages such as Java, JavaScript, and Python
Familiar with front-end technologies like HTML, CSS, and React
Strong problem-solving skills and ability to work in a team environment
Previous projects include developing a customer management system for a small business
I applied via Campus Placement
I applied via Campus Placement
based on 1 review
Rating in categories
Software Engineer
77
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
35
salaries
| ₹0 L/yr - ₹0 L/yr |
E-Commerce Analyst
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
18
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech