i
OodlesTechnologies
Filter interviews by
I applied via Naukri.com and was interviewed in Feb 2022. There were 4 interview rounds.
Create a CRUD application
I applied via AmbitionBox and was interviewed in Dec 2021. There were 2 interview rounds.
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
Top trending discussions
I applied via Naukri.com and was interviewed before Sep 2020. There were 3 interview rounds.
I appeared for an interview before Mar 2021.
Round duration - 30 minutes
Round difficulty - Medium
This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.
Round duration - 60 minutes
Round difficulty - Medium
In this test round, 2 coding questions were given. Either write the code or pseudo code
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.
Generate all valid configurations and print them out.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) and space complexity should be O(1).
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Detect if a given linked list is circular by checking if it forms a closed loop.
Traverse the linked list using two pointers, one moving at double the speed of the other.
If the two pointers meet at any point, the linked list is circular.
If the faster pointer reaches the end of the list (NULL), the linked list is not circular.
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Campus Placement and was interviewed before Jun 2021. There were 3 interview rounds.
Not hard
I applied via Approached by Company and was interviewed in Feb 2024. There were 4 interview rounds.
DSA coding 2-3 question
Java, DSA coding, java 8 coding, multithreading
Java8, spring-boot, DSA coding
I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.
It was an 1hr interview session
Count the occurrence of each element in an array of strings
Iterate through the array and use a hashmap to store the count of each element
If element already exists in the hashmap, increment its count by 1
Return the hashmap with element counts
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
Aptitude and coding of 2 hours
I appeared for an interview in Mar 2021.
Round duration - 120 minutes
Round difficulty - Medium
Timing was 9: 30 AM. Platform was quite good and easy to understand.
You are given a string S
. The task is to reverse the letters of the string while keeping non-alphabet characters in their original position.
S = "...
Reverse the letters of a string while keeping non-alphabet characters in their original position.
Iterate through the string and maintain two pointers, one at the start and one at the end, to reverse only the letters
Use isalpha() function to check if a character is an alphabet or not
Swap the letters at the two pointers until they meet in the middle
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Time complexity can be optimized to O(N) using a set to store duplicates.
Example: For input [0, 3, 1, 2, 3], output should be [3].
You are given an array of integers 'ARR'. Sort this array using a series of pancake flips. In each pancake flip, you need to:
Choose an integer 'K' where 1 <= 'K' <...
Sort an array using pancake flips and return the sequence of flips made.
Iterate through the array and find the position of the maximum element in each iteration.
Perform pancake flips to move the maximum element to the correct position.
Continue this process until the array is sorted.
Return the sequence of positions from where flips were made.
Given an integer 'N', continue summing its digits until the result is a single-digit number. Your task is to determine the final value of 'N' after applying this operation ...
Given an integer, find the final single-digit value after summing its digits iteratively.
Iteratively sum the digits of the given integer until the result is a single-digit number
Output the final single-digit integer for each test case
Handle multiple test cases efficiently
Round duration - 30 minutes
Round difficulty - Medium
Timing was 9:30 AM. The interviewer was very nice.
Identify if the provided integer 'N' is a Fibonacci number.
A number is termed as a Fibonacci number if it appears in the Fibonacci sequence, where each number is the sum of...
Check if a given number is a Fibonacci number or not.
Iterate through the Fibonacci sequence until you find a number greater than or equal to the given number.
Check if the given number matches the Fibonacci number found in the sequence.
If the number matches, output 'YES'; otherwise, output 'NO'.
SQL query to find the second highest salary from a table
Use the MAX() function to find the highest salary
Use the WHERE clause to exclude the highest salary
Order the salaries in descending order and limit the result to 1
Round duration - 30 Minutes
Round difficulty - Medium
Timing was 12 PM. Interviewer was not good.
You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string.
S : abcdg
1...
The task is to find the frequency of each character from 'a' to 'z' in a given string.
Create an array of size 26 to store the frequency of each character from 'a' to 'z'.
Iterate through the string and increment the count of the corresponding character in the array.
Print the array of frequencies as the output for each test case.
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalization is a technique used to organize data in a database efficiently.
Third Normal Form (3NF) is a level of normalization that ensures that data is stored in a way that prevents certain types of data anomalies.
In 3NF, every non-prime attribute is fully functionally dependent on the primary key.
For exampl...
Tip 1 : Do 2 projects.
Tip 2 : Practice data structures programs.
Tip 3 : Take a course on Coding Ninjas.
Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.
based on 13 reviews
Rating in categories
Front end Developer
89
salaries
| ₹2 L/yr - ₹7 L/yr |
Associate Consultant
63
salaries
| ₹1.8 L/yr - ₹6.2 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 - ₹9 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions