Filter interviews by
I applied via Campus Placement
1)Balanced Stack 2)Coin change type 3)DSU codeforces question(very hard)
Remove duplicates in O(1) space complexity and create user id from array of strings.
To remove duplicates in O(1) space complexity, we can use a hash set to keep track of unique elements while iterating through the array.
To create a user id, we can concatenate the first few characters of each string in the array and add a unique identifier like a timestamp or random number.
Example: Array of strings ['john.doe', 'jane.do...
I applied via Company Website and was interviewed in Sep 2023. There was 1 interview round.
Use Dutch National Flag algorithm to sort 0, 1, 2 in single traversal
Initialize three pointers low, mid, high at start, mid, end of array respectively
Iterate through array and swap elements based on their values and pointers
Continue until mid crosses high pointer
Inorder traversal of a binary tree without using recursion.
Use a stack to simulate the recursive process of inorder traversal
Start with the root node and keep pushing left child nodes onto the stack until reaching a leaf node
Pop nodes from the stack, process them, and then move to the right child node if it exists
I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Feb 2020. There were 6 interview rounds.
I applied via Referral and was interviewed before Jan 2021. There were 5 interview rounds.
I applied via Approached by Company and was interviewed before Oct 2021. There were 2 interview rounds.
I have X years of domain experience.
I have worked in this domain for X years.
During my time in this domain, I have gained expertise in various areas such as...
I have worked on projects related to...
I have experience working with clients in this domain.
I keep myself updated with the latest trends and developments in this domain.
I applied via Company Website and was interviewed before Feb 2020. There was 1 interview round.
I applied via Walk-in and was interviewed before Sep 2019. There were 5 interview rounds.
I applied via Company Website and was interviewed in Oct 2020. There were 3 interview rounds.
Recursion is a process in which a function calls itself. Inheritance is a mechanism in OOP where a class inherits properties of another class. Heap is a region of memory used for dynamic memory allocation.
Recursion can be used to solve problems that can be broken down into smaller sub-problems.
Inheritance allows for code reuse and helps in creating a hierarchy of classes.
Heap is used for dynamic memory allocation in la...
based on 2 interviews
Interview experience
based on 3 reviews
Rating in categories
2-3 Yrs
Not Disclosed
8-10 Yrs
Not Disclosed
7-8 Yrs
Not Disclosed
TCS
Accenture
Wipro
Cognizant