i
Coditas Technologies
Filter interviews by
Find duplicates in a list of elements.
Iterate through the list and keep track of elements seen so far
If an element is already in the seen elements, it is a duplicate
Use a hash set to efficiently check for duplicates
Check if any two strings in the list are anagrams of each other
Iterate through the list and for each string, sort the characters and check if it already exists in a hashmap
If it exists, then the current string is an anagram of the existing string
Return true if anagrams are found, false otherwise
Top trending discussions
I applied via campus placement at National Institute of Technology (NIT), Raipur 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
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.
based on 8 reviews
Rating in categories
Software Engineer
353
salaries
| ₹4.5 L/yr - ₹12 L/yr |
Associate Software Engineer
148
salaries
| ₹1 L/yr - ₹9.1 L/yr |
Software Developer
119
salaries
| ₹5 L/yr - ₹20.5 L/yr |
Senior Software Engineer
108
salaries
| ₹10.8 L/yr - ₹30 L/yr |
QA Engineer
64
salaries
| ₹2.5 L/yr - ₹9.3 L/yr |
TCS
Infosys
Wipro
HCLTech