OodlesTechnologies Interview Questions, Process, and Tips

Q1. Normal Questions regarding UI Development
Add your answer

Q1. Basics questions of react native
Add your answer

Q1. I don't know how much number will be required
Add your answer
Q2. Ask to sql. html and css java script
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Q1. Find a Node in Linked List
You have been given a singly linked list of integers. Write a function that returns the index/position of integer data denoted by 'N' (if it exists). Return -1 otherwise.
...read more
Ans. Recursive Approach
The steps are as follows:
 
1. If the head is null, return -1 since an empty list will obviously not contain the element that we need to look for.
2. Check whether the head’s data is equal to the element we want to search. Return 0 if it is.
3. Then recurse on the next node from the head and get its answer.
4. If the answer from the recursive call is -1, your answer is also -1 since you already check the head’s d...read more
Answered by CodingNinjas
View 1 more answer
Q2. Implement Stack With Linked List
You need to implement the Stack data structure using a Singly Linked List.
Create a class named 'Stack' which supports the following operations(all in O(1) time):
...read more
Ans. Best Approach
1. Maintain a linked list. Keep track of its head, and size at all times, and update them accordingly whenever a new operation is performed.
2. Following is the way we can implement all functions of the stack using linked list:
   1. First, initialize a head node, and the size of the list as NULL and 0 respectively.
   2. Then for push function, insert new elements at the head of the list, i.e. the new element will become the ...read more
Answered by CodingNinjas
Add your answer
Q3. Cycle Detection in a Singly Linked List
You have given a Singly Linked List of integers, determine if it forms a cycle or not.
A cycle occurs when a node's next points back to a previous node in the ...read more
Ans. Outer And Inner Loop
We are going to have two loops outer-loop and inner-loop 
1. Maintain a count of the number of nodes visited in outer-loop.
2. For every node of the outer-loop, start the inner loop from head.
3. If the inner-loop visits the node next to the outer-loop node, then return true, else repeat the process for the next iteration of outer-loop.
4. If outer-loop reaches the end of list or null, then return false.
Space ...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 20 minutes
Round difficulty - Easy

Q1. Top View Of The Tree
You are given a Binary Tree of integers. You are supposed to return the top view of the given binary tree. The Top view of the binary tree is the set of nodes that are visible when we ...read more
Ans. Using Pre-Order Traversal
As we know that all three traversals, i.e. pre-order, in-order and post-order, visit the tree node at once. We can use any of them. Here we are going to use pre-order traversal for the explanation. So while traversing in the pre-order traversal, we will keep track of horizontal distance of the node which is going to be visited from the root node, and we also keep track of the vertical level of ...read more
Answered by CodingNinjas
View 2 more answers
Q2. Delete Node In A Linked List
You are given a Singly Linked List of integers and a reference to the node to be deleted. Every node of the Linked List has a unique value written on it. Your task is to delete...read more
Ans. Brute-force
Approach:
 
We need to delete the node K from the linked list. The most general way to delete the node K from a singly linked list is to get access to the previous node of K. We can get access to the previous node by traversing from the head of the linked list. Let’s denote this previous node as P. Then, we update the next pointer of P to the next pointer of K. 
Although the reference to node K is giv...read more
Answered by CodingNinjas
Add your answer