i
OodlesTechnologies
Filter interviews by
I applied via Naukri.com and was interviewed in Aug 2021. There was 1 interview round.
I appeared for an interview in Jan 2021.
Round duration - 40 minutes
Round difficulty - Easy
Given a singly linked list of integers, your task is to implement a function that returns the index/position of an integer value 'N' if it exists in the linked list. Return -1 i...
Implement a function to find the index of a given integer in a singly linked list.
Traverse the linked list while keeping track of the index of each element.
Compare each element with the target integer 'N'.
Return the index if 'N' is found, otherwise return -1.
Handle cases where the list is empty or 'N' is not found.
Consider the constraints on the number of test cases and the length of the linked list.
Your task is to implement a Stack data structure using a Singly Linked List.
Create a class named Stack
which supports the following operations, each in O(1...
Implement a Stack data structure using a Singly Linked List with operations in O(1) time.
Create a class named Stack with getSize, isEmpty, push, pop, and getTop methods.
Use a Singly Linked List to store the elements of the stack.
Ensure each operation runs in constant time complexity (O(1)).
Handle edge cases like empty stack appropriately.
Example: For input '5', '3 10', '5', '1', '2', '4', the output should be '10', '1'
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 has a cycle using O(N) time complexity and O(1) space complexity.
Use Floyd's Tortoise and Hare algorithm to detect cycle in linked list
Maintain two pointers, slow and fast, moving at different speeds
If there is a cycle, the two pointers will eventually meet
If one of the pointers reaches the end of the list (null), there is no cycle
Round duration - 20 minutes
Round difficulty - Easy
Given a binary tree of integers, the task is to return the top view of the given binary tree. The top view of the binary tree is the set of nodes visible when viewed from the top.
...Return the top view of a binary tree given in level-order format.
Traverse the binary tree in level-order and keep track of the horizontal distance of each node from the root.
Use a map to store the nodes at each horizontal distance, and only keep the first node encountered at each distance.
Return the values of the nodes stored in the map in sorted order of their horizontal distance.
Example: For the given binary tree, th
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...
Given a singly linked list of integers and a reference to a node, delete the specified node from the linked list.
Traverse the linked list to find the node to be deleted
Update the pointers to skip over the node to be deleted
Print the modified linked list after deletion
Tip 1 : Practice Questions as much as you can
Tip 2 : Do at least 2 projects
Tip 3 : Do practice a lot of questions on linked list and stacks as these are two most important data structures asked in the interview.
Tip 4 : Also, try to implement it yourself without seeing the solution.
Tip 5 : Also prepare for Computer Science subjects like Operating System, Database Management System, Computer Networks, etc. I prepared them through Coding Ninjas notes which were simpler and easy to understand.
Tip 1 : Keep your resume short and up to mark and check spellings before submitting it for the interview process.
Tip 2 : Have projects and internships on your resume
Tip 3 : Never lie in your resume
I applied via Naukri.com and was interviewed in Jun 2021. There were 4 interview rounds.
OodlesTechnologies interview questions for popular designations
I applied via Walk-in and was interviewed before May 2022. There were 3 interview rounds.
Basic python programming language and basic python programs
I applied via Naukri.com and was interviewed in Aug 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Jun 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Aug 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed in Jan 2021. There was 1 interview round.
Top trending discussions
The duration of OodlesTechnologies interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 32 interviews
Interview experience
based on 300 reviews
Rating in categories
Front end Developer
72
salaries
| ₹2 L/yr - ₹7 L/yr |
Associate Consultant
63
salaries
| ₹1.8 L/yr - ₹6 L/yr |
Associate Development Consultant
59
salaries
| ₹2 L/yr - ₹7.6 L/yr |
Senior Associate Consultant
49
salaries
| ₹3 L/yr - ₹10 L/yr |
Associate Consultant Developer
43
salaries
| ₹1.2 L/yr - ₹7 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions