Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Jun 2023. There were 4 interview rounds.
4 questions :- 3 were string based and one DP
1. characters and it's frequency were given in key value format in a string, print the total frequency of each character in lexicographical order.
2. Minimum Jump to reach end of the array(search Jump game from leetcode)
3. Partion the given string into 2 parts such that both parts are present in list of words provided. Print all the ways of partitioning.
Use stack to find next greater element for each element in the array
Create an empty stack to store indices of elements
Iterate through the array and for each element, pop elements from stack until finding a greater element
Store the next greater element in a result array
Use three pointers to find triplets with sum 0 in an array.
Sort the array first to easily find triplets.
Use three pointers - one fixed, one moving from left, one moving from right.
Check if the sum of the three pointers is 0, if not adjust pointers accordingly.
Top trending discussions
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 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
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
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 haven't appeared but this website asking me everytime that's why giving review but I wanted to know what are the ratings for this company
I applied via LinkedIn and was interviewed in Nov 2024. There was 1 interview round.
General aptitude focused on mathematics.
based on 1 interview
Interview experience
Accounts Manager
134
salaries
| ₹0 L/yr - ₹0 L/yr |
Key Account Manager
91
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Regional Manager
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
23
salaries
| ₹0 L/yr - ₹0 L/yr |
MagicBricks
Impact Guru
Netmeds.com
Tracxn