i
Zopper
Filter interviews by
Detect cycle in a linked list by using Floyd's Tortoise and Hare algorithm.
Use two pointers, slow and fast, to traverse the linked list
If there is a cycle, the two pointers will eventually meet at some point
Time complexity of this algorithm is O(n)
To find the starting point of a cycle in a linked list, we can use Floyd's Tortoise and Hare algorithm.
Use Floyd's Tortoise and Hare algorithm to detect a cycle in the linked list
Once a cycle is detected, reset one pointer to the head and move both pointers at the same pace until they meet at the starting point of the cycle
Top trending discussions
I applied via Company Website and was interviewed before Jul 2021. There were 3 interview rounds.
5 coding questions you have to complete atleast 4
Basic aptitude questions
I applied via Referral and was interviewed in Mar 2022. There were 6 interview rounds.
Time and Speed, Percentages, Averages, Ratio and Proportion, Time and Work etc.
Platform was Mettle Assessment, Topics were Tree and Binary Search
Work from office vs Work from Home
TCP (Transmission Control Protocol) and UDP (User Datagram Protocol) are protocols used for data transmission over networks.
TCP is a connection-oriented protocol that guarantees reliable delivery of data.
UDP is a connectionless protocol that does not guarantee reliable delivery of data.
The main difference between TCP and UDP is that TCP provides reliable, ordered, and error-checked delivery of data, while UDP does not.
...
Print the bottom view of a Binary Search Tree.
Use a map to store the horizontal distance and the bottom-most node at that distance.
Traverse the tree in level order and update the map with each node's horizontal distance and level.
Print the nodes in the map in ascending order of their horizontal distance.
I believe working from the office allows for better collaboration and communication with colleagues.
Better collaboration and communication with colleagues
Opportunity for face-to-face interactions
Easier access to resources and equipment
Faster problem-solving through immediate discussions
Building stronger relationships with team members
I have the technical skills, experience, and passion for software engineering that make me a valuable asset to your team.
I have a strong background in computer science and software development
I have experience working on various software projects and have a proven track record of delivering high-quality code
I am a quick learner and can adapt to new technologies and programming languages
I am a team player and can effect...
Yes
When I received a promotion at work but also had to deal with the loss of a loved one
When I achieved a personal goal but also faced criticism from others
When I received positive feedback on a project but also experienced imposter syndrome
I applied via Recruitment Consulltant and was interviewed in Aug 2023. There were 3 interview rounds.
MCQ questions on Linux Networking and SQL
I applied via Job Fair and was interviewed before Aug 2023. There were 2 interview rounds.
Find two numbers in an array that add up to a specific target value.
Use a hashmap to store the difference between the target value and each element in the array.
Iterate through the array and check if the current element's complement exists in the hashmap.
Return the indices of the two numbers that add up to the target value.
No, a circular loop is not present in a linked list.
A linked list does not have a circular loop by default.
If a linked list has a circular loop, it is considered a circular linked list.
Circular linked lists can be detected using Floyd's Cycle Detection Algorithm.
To identify duplicates in a circular linked list, use a hash set to keep track of visited nodes.
Traverse the circular linked list while adding each node to a hash set.
If a node is already in the hash set, it is a duplicate.
Consider edge cases such as an empty list or a list with only one node.
posted on 2 Jul 2024
A normal aptitude test
A normal coding interview
posted on 27 Feb 2024
I applied via Naukri.com and was interviewed before Feb 2023. There were 3 interview rounds.
Multiple Choice Questions
Right side view of a binary search tree
posted on 7 Sep 2024
I applied via LinkedIn and was interviewed in Mar 2024. There were 4 interview rounds.
First round was coding test conducted by their IDE where you can program in any language like on hackerrank IDE . 5 question were asked from easy to hard
Stack is used for static memory allocation and stores local variables, while heap is used for dynamic memory allocation and stores objects.
Stack memory is allocated in a contiguous block and is faster to access compared to heap memory.
Variables stored on the stack have limited scope and lifetime, while objects on the heap can persist beyond the scope of the function.
Stack memory is managed by the compiler, while heap m...
Compiler translates entire code into machine code before execution, while interpreter translates code line by line during execution.
Compiler translates entire code into machine code before execution
Interpreter translates code line by line during execution
Compiler generates error messages after scanning entire code
Interpreter stops at first error encountered
Examples: C, C++ use compilers; Python, Ruby use interpreters
I applied via Naukri.com and was interviewed before Sep 2021. There were 6 interview rounds.
1 hr time limit. Some technical mathematical question, english grammar related, genral knowledge.
After clearing apti, they will assign machine test. 1 hr time limite.
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Relationship Manager
57
salaries
| ₹2.8 L/yr - ₹5 L/yr |
Software Engineer
52
salaries
| ₹5 L/yr - ₹17.2 L/yr |
Territory Sales Manager
33
salaries
| ₹3.2 L/yr - ₹6.5 L/yr |
Area Sales Manager
28
salaries
| ₹5 L/yr - ₹9.2 L/yr |
Senior Software Engineer
28
salaries
| ₹13.1 L/yr - ₹37 L/yr |
Duck Creek Technologies
Ascent HR Technologies Private Limited
FinThrive
Vyapar