i
Tydy
Filter interviews by
Be the first one to contribute and help others!
I applied via Naukri.com and was interviewed before Jun 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed in Jan 2022. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before Mar 2021. There were 4 interview rounds.
90 minute test on hacker rank consisting of 3 coding questions all of medium difficulty. Most candidates are required to solve more than 1 question.
Find the lowest common ancestor of a binary tree.
Traverse the tree recursively from the root node.
If the current node is null or matches either of the given nodes, return the current node.
Recursively search for the nodes in the left and right subtrees.
If both nodes are found in different subtrees, return the current node.
If both nodes are found in the same subtree, continue the search in that subtree.
Find first missing positive integer from an array of non-negative integers.
Create a hash set to store all positive integers in the array
Loop through the array and add all positive integers to the hash set
Loop through positive integers starting from 1 and return the first missing integer not in the hash set
Design a parking lot
Consider the size and capacity of the parking lot
Decide on the layout and organization of parking spaces
Implement a system to manage parking availability and reservations
Include features like ticketing, payment, and security
Consider scalability and future expansion
Find the largest island area in a grid representing an ocean using DFS or BFS.
Use Depth-First Search (DFS) or Breadth-First Search (BFS) to explore the grid.
Mark visited cells to avoid counting them multiple times.
Count the size of each island during the traversal.
Example: For a grid [[1,0,0],[1,1,0],[0,0,1]], the largest island has area 3.
Keep track of the maximum area found during the exploration.
Group list of strings into distinct anagrams.
Create a hash table with sorted string as key and list of anagrams as value.
Iterate through the list of strings and add each string to its corresponding anagram list in the hash table.
Return the values of the hash table as a list of lists.
posted on 28 Sep 2022
I applied via Campus Placement and was interviewed before Sep 2021. There were 4 interview rounds.
A regular aptitude test containing Verbal, Quants, and coding. Practice from Indiabix and go or any other aptitude exams website. Depending on your score in these sections you'll be shortlisted for the applied role. For BAs usually, the Verbal section is checked more thoroughly.
2o min round split into two rounds of two different topics: 1 abstract and 1 more based on current affairs.
posted on 27 Apr 2022
I applied via Campus Placement and was interviewed before Apr 2021. There were 2 interview rounds.
posted on 4 Jul 2022
I applied via Campus Placement and was interviewed before Jul 2021. There were 2 interview rounds.
Standard Aptitude topics, 30 mins - 30 questions
Designing a chess game involves defining rules, user interface, and game mechanics for an engaging experience.
Define the rules: Standard chess rules include piece movement, check, checkmate, and stalemate.
User interface: Create a visually appealing board and pieces, with options for 2D or 3D views.
Game mechanics: Implement turn-based play, timers, and difficulty levels for AI opponents.
Multiplayer options: Allow for on...
posted on 3 Aug 2021
I applied via LinkedIn and was interviewed in Jul 2021. There was 1 interview round.
posted on 24 Dec 2021
I applied via Referral and was interviewed in Jun 2021. There were 3 interview rounds.
posted on 1 Jul 2022
I appeared for an interview in Jan 2022.
Software Engineer
4
salaries
| ₹5.8 L/yr - ₹6 L/yr |
Project Manager
3
salaries
| ₹19 L/yr - ₹26.5 L/yr |
Senior Software Engineer
3
salaries
| ₹8.5 L/yr - ₹20 L/yr |
Quantiphi Analytics Solutions Private Limited
CMS IT Services
iMerit
Zidio Development