Filter interviews by
I applied via Campus Placement and was interviewed in Nov 2023. There were 2 interview rounds.
5 MCQ questions, and 1 coding question similar to Leetcode medium-hard level (topic-greedy).
I was interviewed before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical round that lasted for around 60 minutes. The interviewer asked me questions based on DSA and OOPS concepts.
Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...
Round duration - 60 minutes
Round difficulty - Easy
Technical round that lasted for around 60 minutes. The interviewer asked me questions based on SQL and OOPS concepts.
Round duration - 30 minutes
Round difficulty - Easy
HR round that lasted for around 30 minutes. The interviewer asked questions to know more about me. We also discussed a puzzle.
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 Jan 2021.
Round duration - 75 minutes
Round difficulty - Easy
Simple question based on strings was given. MCQs based on basic aptitude and programming questions were asked.
Tips: Time management is important. Remember all the syntaxes
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Round duration - 60 minutes
Round difficulty - Easy
It was a good experience.
Tips: If you don't know something just tell them. Don't try to answer something if you don't know anything about it
Given two strings, A
and B
, determine whether A
can be transformed into B
by performing at most one of the following operations (including zero operations):
1. Delete a ch...
You are provided a string STR
of length N
, consisting solely of lowercase English letters.
Your task is to remove all duplicate occurrences of characters i...
Round duration - 30 minutes
Round difficulty - Easy
It was easy. I could answer the first question. Second one I answered really badly
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Revise C++/Java.
Tip 3 : If you don't know much of C++/Java at least write the codes in C.
Tip 4 : Go through all the previous interview experiences from Codestudio and Leetcode.
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.
Top trending discussions
posted on 15 Nov 2024
I applied via Referral and was interviewed in Oct 2024. There were 2 interview rounds.
Merge two sorted linked lists into a single sorted linked list
Create a new linked list to store the merged result
Iterate through both input linked lists and compare nodes to determine the order in which they should be added to the result list
Handle cases where one list is longer than the other
To check if parentheses are balanced, use a stack data structure to keep track of opening and closing parentheses.
Use a stack to push opening parentheses and pop when encountering a closing parenthesis
If stack is empty when encountering a closing parenthesis, return false
After iterating through all parentheses, if stack is empty, return true
The right view of a Binary Search Tree shows the nodes that are visible when viewing the tree from the right side.
The right view of a Binary Search Tree includes the rightmost node at each level.
Nodes at each level that are not visible from the right side are not included in the right view.
Example: For the Binary Search Tree with values 1, 2, 3, 4, 5, the right view would be 1, 3, 5.
posted on 12 Jan 2025
Creating a Web App using React JS and Java Servlets
posted on 22 Oct 2024
I applied via Campus Placement
1 hr , 3 sum leetcode question
I was interviewed in Feb 2021.
Round duration - 60 minutes
Round difficulty - Medium
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
Given a binary tree, determine the length of its diameter. The diameter is defined as the longest path between any two end nodes in the tree. The path's length is re...
The basic idea of this approach is to break the problem into subproblems.
Now, there are three possible cases:
Let us define a recursive function, ‘getDiamter’, which takes the root of the binary tree as input parameter and return...
Given an array of integers ARR
of length N
and an integer Target
, your task is to return all pairs of elements such that they add up to the Target
.
The first line ...
Round duration - 35 minutes
Round difficulty - Medium
The nature of the interviewer was very kind, helped me when I stuck. The round was proctored, our webcam and mic were on, and shared my screen.
Tip 1 : Do at least 1 projects at any technology
Tip 2 : Learn DSA at least these topics Array, LL, Tree, DP
Tip 1 : At least mention the projects or internships on your resume.
Tip 2 : Avoid unnecessary details like Hobbies, declaration, date.
I applied via Walk-in and was interviewed before Jul 2021. There were 2 interview rounds.
DSA Problems on LinkedList and Stack.
I applied via Campus Placement
There was a very basic aptitude test ,but time was very low.
For round 2 there were given 2 questions which were very easy, any beginner programmer can do it.
posted on 3 Jul 2023
based on 1 interview
Interview experience
Software Engineer2
305
salaries
| ₹15 L/yr - ₹45 L/yr |
Software Engineer
259
salaries
| ₹12 L/yr - ₹50.3 L/yr |
Senior Software Engineer
243
salaries
| ₹13.9 L/yr - ₹53 L/yr |
Software Engineer III
229
salaries
| ₹17 L/yr - ₹66 L/yr |
Data Scientist
167
salaries
| ₹15 L/yr - ₹55 L/yr |
Paytm
Razorpay
Visa
MasterCard