Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.
Basic aptitude with tracing program
3 problem with easy to hard
I applied via Walk-in and was interviewed in May 2024. There were 2 interview rounds.
Was bit tough and need to concentrate on work time
Was about coding in any language such as Java python
I applied via Campus Placement and was interviewed in Jun 2022. There were 3 interview rounds.
Consists of 5 questions of DSA
1 Knapsack, 1 bitwise, 1 string , 1 basic mathematics, 1 dynamic programming
Top trending discussions
I was interviewed before Apr 2021.
Round duration - 45 minutes
Round difficulty - Easy
This was a test where 2 coding questions were to be solved in 45 minutes.
Given a column title as it appears in an Excel sheet, your task is to return its corresponding column number.
S = "AB"
28
The seq...
Convert Excel column title to corresponding column number.
Iterate through the characters in the input string from right to left
Calculate the value of each character based on its position and multiply by 26^index
Sum up the values to get the final column number
Determine if two given strings, str1
and str2
, are permutations of each other.
Two strings are permutations of each other if the characters of one string can be re...
Check if two strings are permutations of each other.
Create character frequency maps for both strings.
Compare the frequency maps to check if they are permutations.
Handle edge cases like empty strings or strings of different lengths.
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 Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
It comprised of general aptitude questions and two coding questions. It was an offline test.
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not attack each other.
Generate and print valid configurations where queens are placed safely.
Consider constraints and time limit for efficient solution.
Exam...
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Achieve sorting in a single scan over the array without using any extra space.
Round duration - 60 minutes
Round difficulty - Easy
After having a technical discussion about my CV. He gave me two questions to code.
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...
Find all unique contiguous substrings of size two from a given string.
Iterate through the string and extract substrings of size two
Use a set to store unique substrings
Return the set as an array of strings
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, there is a cycle in the linked list.
If one of the pointers reaches the end of the list (null), there is no cycle.
Round duration - 30 minutes
Round difficulty - Easy
This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code.
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
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.
Launch modes on Android determine how a new instance of an activity is associated with the current task.
Standard: Creates a new instance of the activity in the task's stack
SingleTop: If an instance of the activity already exists at the top of the stack, it will not be recreated
SingleTask: Activity is always at the root of the task and no other activities can be on top of it
SingleInstance: Similar to SingleTask, but the
Questios based on Activity backstacks
Data structure - rainwater trapping
Design a car parking lot system
Determine the size and capacity of the parking lot
Create a database to store information about available spots and occupied spots
Develop a system to track the entry and exit of vehicles
Implement a payment system for parking fees
Incorporate security measures such as CCTV cameras and security personnel
Provide a user-friendly interface for customers to locate available spots and make payment
I was interviewed in Mar 2022.
Round duration - 120 Minutes
Round difficulty - Medium
Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach
Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question
Round duration - 60 Minutes
Round difficulty - Medium
2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE
Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...
The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.
Use dynamic programming to solve the problem efficiently.
The number of structurally unique BSTs can be calculated using Catalan numbers.
For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.
Example: For N=3, the number of structurally unique BSTs is 5.
You are provided with a string 'STR'
that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...
Generate all possible subsequences of a given string.
Use recursion to generate all possible subsequences by including or excluding each character in the string.
Maintain a current index to keep track of the characters being considered.
Append the current character to each subsequence generated so far.
Recursively call the function with the next index to include or exclude the next character.
Base case: When the current ind...
Round duration - 60 Minutes
Round difficulty - Easy
HIRING MANAGER ROUND
Discussion about the organisation now questions
Tip 1 : Practice is they to success, every person will need a different path for preparation, the resources that you should use will depend upon your current expertise.
Tip 2 : For Machine Coding Rounds speed is key, you need to practice atleast 20 questions, Try to figure out techniques to common out code, code out your first question, and then spend good 2-3 hours in reducing no of lines and removing redundancy, try to note down methods you used to achieve less redundancy and for all the next questions you practice try to achieve that same quality from the beginning which will automatically increase your speed
Tip 3 : Do company wise preparation, look for interview experiences and try to map out commonly asked questions and categories of those questions and practice accordingly
Tip 1 : If applying for any non FE role (or any role that does not require designing or creative skills) keep a minimalistic resume
Tip 2 : Ensure to add a summary at the top which mentions all the criterias HRs consider while short listing resumes (Experience, Degree and Branch, Languages you have experience in, City, Willingness to Relocate, Notice Period, If already on notice period mention your last working day)
posted on 26 Sep 2024
I am a software developer with 5 years of experience in Java and Python. I have a passion for problem-solving and creating innovative solutions.
5 years of experience in Java and Python
Passionate about problem-solving
Innovative solutions driven
In 5 years, I see myself as a senior software developer leading a team and working on cutting-edge technologies.
Leading a team of developers on innovative projects
Working with cutting-edge technologies like AI and blockchain
Continuing to learn and grow in my career
Possibly pursuing further education or certifications
Contributing to open source projects
I applied via Referral and was interviewed before Aug 2023. There were 2 interview rounds.
Basic JavaScript Interview
Closure is a function that has access to its own scope, as well as the outer scope in which it was defined.
Closure allows a function to access variables from its outer scope even after the outer function has finished executing.
It is created whenever a function is defined within another function.
Closure is commonly used in JavaScript for maintaining state in asynchronous operations.
Promises are objects representing the eventual completion or failure of an asynchronous operation.
Promises are used to handle asynchronous operations in JavaScript.
They can be in one of three states: pending, fulfilled, or rejected.
Promises can be chained together using .then() method.
They help avoid callback hell and make code more readable.
Example: Fetching data from an API returns a promise that resolves with the da
based on 3 interviews
1 Interview rounds
based on 3 reviews
Rating in categories
MEP Engineer
95
salaries
| ₹0 L/yr - ₹0 L/yr |
Property Manager
61
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer experience Manager
54
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Manager
45
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Manager
42
salaries
| ₹0 L/yr - ₹0 L/yr |
CoLive
Nestaway
NoBroker
CommonFloor