Filter interviews by
I applied via Campus Placement and was interviewed in Nov 2021. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Apr 2022. There were 3 interview rounds.
They provide you the topic on that basis GD start and they select some of them
I am a trained classical dancer
I have been learning Bharatanatyam for the past 10 years
I have performed in various cultural events and competitions
Dance has taught me discipline, focus and perseverance
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 applied via Referral and was interviewed before Aug 2020. There was 1 interview round.
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.
I applied via LinkedIn and was interviewed in Dec 2021. There were 4 interview rounds.
I applied via Referral and was interviewed before Jan 2021. There were 4 interview rounds.
I have given aptitude test which has 30 questions
based on 3 interviews
Interview experience
based on 41 reviews
Rating in categories
Sales Manager
43
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Graphic Designer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
HR Recruiter
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Sales Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
JLL
CBRE
Knight Frank
ANAROCK Property Consultants