Filter interviews by
I applied via Walk-in and was interviewed in Aug 2022. There were 2 interview rounds.
Programming question on Arrays and matrix
Top trending discussions
I appeared for an interview before Mar 2021.
Round duration - 75 minutes
Round difficulty - Medium
This was an online coding round where we had 2 questions to solve under 75 minutes. I found both the questions to be of Easy to Medium level of difficulty.
You are given several sets of points on a 2D plane, each set represented as a list of coordinates. Your task is to determine if there exists a line parallel to the Y-axis...
The task is to determine if there exists a line parallel to the Y-axis that reflects given points symmetrically.
Iterate through each test case and check if a vertical reflection line exists for the given points
Calculate the midpoint of the x-coordinates and check if it reflects the points symmetrically
Consider edge cases where points are on the reflection line or have the same x-coordinate
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.
Mark visited cells to avoid redundant traversal.
Increment island count whenever a new island is encountered.
Round duration - 60 minutes
Round difficulty - Medium
This round had 2 coding questions followed by some questions from DBMS.
You are given an array/list HEIGHTS
of length N
, where each element represents the height of a histogram bar. The width of each bar is considered to be 1.
Find the area of the largest rectangle that can be formed within the bounds of a given histogram.
Iterate through the histogram bars and calculate the area of the largest rectangle that can be formed using each bar as the height.
Use a stack to keep track of the indices of the bars in non-decreasing order of height.
Pop elements from the stack and calculate the area until a smaller height bar is encountered.
Update the max...
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
The first line contains an...
The task is to determine if a given string consisting of parentheses is balanced or not.
Iterate through the characters of the string and use a stack to keep track of opening parentheses.
If an opening parenthesis is encountered, push it onto the stack.
If a closing parenthesis is encountered, check if it matches the top of the stack. If it does, pop the stack, else the string is not balanced.
At the end, if the stack is e...
ACID properties in DBMS ensure data integrity and consistency in transactions.
Atomicity: All operations in a transaction are completed successfully or none at all.
Consistency: Data is always in a valid state before and after a transaction.
Isolation: Transactions are isolated from each other to prevent interference.
Durability: Once a transaction is committed, changes are permanent and survive system failures.
Example: If...
Levels of data abstraction in a DBMS refer to the different views of data provided to users and applications.
Physical level: Deals with how data is stored on the storage media. Example: data blocks, pages, indexes.
Logical level: Focuses on how data is represented to users. Example: tables, views, constraints.
View level: Provides a customized view of the database for specific users or applications. Example: queries, rep
Round duration - 60 minutes
Round difficulty - Medium
Standard DS/Algo round with 2 coding questions followed by 2 interesting puzzles.
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...
Detect if an undirected graph contains a cycle by exploring all possible paths.
Use Depth First Search (DFS) algorithm to traverse the graph and detect cycles.
Maintain a visited set to keep track of visited vertices and a parent pointer to avoid visiting the same vertex twice.
If a visited vertex is encountered that is not the parent of the current vertex, a cycle is present.
Consider edge cases like disconnected graphs a
Given a matrix ARR
with dimensions N
* M
, consisting only of 0s and 1s where each row is sorted, determine the index of the row that contains the highest number of 1s. If multi...
Find the row with the maximum number of 1s in a sorted matrix.
Iterate through each row of the matrix and count the number of 1s in each row
Keep track of the row index with the maximum number of 1s
Return the index of the row with the highest count of 1s
By lighting both wires at the same time, the shorter wire will burn out first, allowing you to measure a specific duration of time.
Light both wires at the same time
Measure the time it takes for the shorter wire to burn out completely
The remaining length of the longer wire will indicate the specific duration of time
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 applied via Company Website and was interviewed before Dec 2020. There were 5 interview rounds.
posted on 13 Jan 2015
I applied via Referral
Data structures are a way to organize and store data efficiently.
Data structures are used to store and manipulate data in a structured manner.
They provide different ways to access and perform operations on the data.
Examples include arrays, linked lists, stacks, queues, trees, and graphs.
Developed a web-based project management tool for tracking tasks and deadlines
Used React.js for front-end development
Implemented RESTful APIs using Node.js and Express for back-end
Utilized MongoDB for database management
Incorporated user authentication and authorization features
Integrated real-time notifications using Socket.io
My name is John Smith.
Full name is John Smith
Common name in English-speaking countries
Easy to remember and pronounce
The question is unrelated to the medical field and is not a puzzle or riddle.
The question is asking about the meaning of the interviewer's name.
You can ask the interviewer about the origin or cultural significance of their name.
You can also mention that names often have different meanings in different languages or cultures.
My strengths include problem-solving skills, attention to detail, and strong communication abilities.
Strong problem-solving skills - I enjoy tackling complex issues and finding creative solutions.
Attention to detail - I am meticulous in my work and strive for accuracy in all tasks.
Strong communication abilities - I can effectively convey ideas and collaborate with team members.
posted on 16 Dec 2015
I appeared for an interview in Sep 2016.
Developed a web application for tracking student attendance and performance
Used React.js for front-end development
Implemented RESTful APIs using Node.js and Express for back-end
Utilized MongoDB for database storage
Integrated authentication and authorization features for secure access
Executive Software Engineer
34
salaries
| ₹2.8 L/yr - ₹5.5 L/yr |
Software Engineer
32
salaries
| ₹2.2 L/yr - ₹5.2 L/yr |
Software Developer
19
salaries
| ₹3 L/yr - ₹5.3 L/yr |
Software Engineer Trainee
15
salaries
| ₹2 L/yr - ₹4.5 L/yr |
Executive Accountant
5
salaries
| ₹2 L/yr - ₹4 L/yr |
Cognizant
Sutherland Global Services
Optum Global Solutions
Hexaware Technologies