Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by OodlesTechnologies Team. If you also belong to the team, you can get access from here

OodlesTechnologies Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

OodlesTechnologies Software Developer Interview Questions, Process, and Tips

Updated 9 Jun 2022

Top OodlesTechnologies Software Developer Interview Questions and Answers

  • Q1. Find a Node in Linked List 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 exi ...read more
  • Q2. Implement Stack with Linked List Your task is to implement a Stack data structure using a Singly Linked List. Explanation: Create a class named Stack which supports the ...read more
  • Q3. Problem Statement: Delete Node In A Linked List Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the link ...read more

OodlesTechnologies Software Developer Interview Experiences

3 interviews found

I applied via Naukri.com and was interviewed in Feb 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Assignment 

Create a CRUD application

Round 3 - Technical 

(3 Questions)

  • Q1. Javascript, hoisting ,promise ,callback function
  • Q2. Array , object ,JSON,for loop
  • Q3. Introduction react js,and other frameworks ,like angular, Vue
Round 4 - HR 

(2 Questions)

  • Q1. What are your salary expectations?
  • Q2. Basic details for joining company

Interview Preparation Tips

Interview preparation tips for other job seekers - Always active for interview and day/day increase your skills and apply regarding jobs

I applied via AmbitionBox and was interviewed in Dec 2021. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Basics questions of react native

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep learn and also try to improve your skills and communication skills

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Validate Binary Tree Nodes Problem You are provided with 'N' bina ... read more

I appeared for an interview in Jan 2021.

Round 1 - Video Call 

(3 Questions)

Round duration - 40 minutes
Round difficulty - Easy

  • Q1. 

    Find a Node in Linked List

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Implement Stack with Linked List

    Your task is to implement a Stack data structure using a Singly Linked List.

    Explanation:

    Create a class named Stack which supports the following operations, each in O(1...

  • Ans. 

    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'

  • Answered by AI
  • Q3. 

    Cycle Detection in a Singly Linked List

    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 ...

  • Ans. 

    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

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 20 minutes
Round difficulty - Easy

  • Q1. 

    Top View of Binary Tree

    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.

    ...
  • Ans. 

    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

  • Answered by AI
  • Q2. 

    Problem Statement: Delete Node In A Linked List

    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...

  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in ChennaiEligibility criteriaAbove 7 CGPAOodles Technologies Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Object-Oriented Programming, System Design , any programming language, Database Management System, Operating System, NetworkingTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

I applied via Naukri.com and was interviewed before Sep 2020. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Basics of Java ,MySQL
  • Q2. For java do all object oriented programming (oops) concept very deeply
  • Q3. For mysql do all basics commands and query

Interview Preparation Tips

Interview preparation tips for other job seekers - Strong basic theoretical and practical knowledge required

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

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 2 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

In this test round, 2 coding questions were given. Either write the code or pseudo code

  • Q1. 

    N Queens Problem

    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.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    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).

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA.

  • Q1. 

    Reverse Words in a String: Problem Statement

    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...

  • Ans. 

    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

  • Answered by AI
  • Q2. 

    Circular Linked List Detection

    You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.

    Note:
    • A linked list is considered circula...
  • Ans. 

    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.

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMAQ Software interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Jun 2021. There were 3 interview rounds.

Round 1 - Aptitude Test 

Not hard

Round 2 - Technical 

(2 Questions)

  • Q1. On java sql and related
  • Q2. Interview questions on java , SQL and basic queries on joins and coding questions on string manipulation and linked list . Also they ask about trees and graphs.
Round 3 - HR 

(1 Question)

  • Q1. Common HR questions and related

Interview Preparation Tips

Topics to prepare for DataMetica Software Developer interview:
  • Java
  • SQL
Interview preparation tips for other job seekers - Try to have other offers also so that you can negotiate
Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
No response

I applied via Approached by Company and was interviewed in Feb 2024. There were 4 interview rounds.

Round 1 - Coding Test 

DSA coding 2-3 question

Round 2 - Group Discussion 

Java, DSA coding, java 8 coding, multithreading

Round 3 - Group Discussion 

Java8, spring-boot, DSA coding

Round 4 - Technical 

(1 Question)

  • Q1. DSA coding, java 8 coding, spring boot, mysql

Interview Preparation Tips

Interview preparation tips for other job seekers - WORST company. They will waste your time in 4-5 technical rounds and at the time of offer they will ghost you. playing with someone's career is not cool. Be aware of companies like this.
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all tips
Round 2 - Coding Test 

It was an 1hr interview session

Round 3 - One-on-one 

(1 Question)

  • Q1. Find the occurrence of each element in an array
  • Ans. 

    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

  • Answered by AI
Round 4 - HR 

(1 Question)

  • Q1. Tell me about yourself

Interview Preparation Tips

Topics to prepare for MAQ Software Software Developer interview:
  • array
  • string
  • map
  • dynamic programming

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Aptitude and coding of 2 hours

Round 2 - Technical 

(1 Question)

  • Q1. Questions based on sql and dsa

Interview Preparation Tips

Interview preparation tips for other job seekers - learn sql and dsa

I appeared for an interview in Mar 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 120 minutes
Round difficulty - Medium

Timing was 9: 30 AM. Platform was quite good and easy to understand.

  • Q1. 

    Reverse Only Letters Problem Statement

    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.

    Example:

    Input:
    S = "...
  • Ans. 

    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

  • Answered by AI
  • Q2. 

    Find Duplicates in an Array

    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...

  • Ans. 

    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].

  • Answered by AI
  • Q3. 

    Pancake Sorting Problem Statement

    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' <...
  • Ans. 

    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.

  • Answered by AI
  • Q4. 

    Sum of Digits Problem Statement

    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 ...

  • Ans. 

    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

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

Timing was 9:30 AM. The interviewer was very nice.

  • Q1. 

    Fibonacci Number Verification

    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...

  • Ans. 

    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'.

  • Answered by AI
  • Q2. Write an SQL query to find the second highest salary from a table.
  • Ans. 

    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

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 30 Minutes
Round difficulty - Medium

Timing was 12 PM. Interviewer was not good.

  • Q1. 

    Character Frequency Problem Statement

    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.

    Example:

    Input:
    S : abcdg
    Output:
    1...
  • Ans. 

    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.

  • Answered by AI
  • Q2. What is normalization and can you explain the concept of Third Normal Form (3NF)?
  • Ans. 

    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...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 8 CGPAMAQ Software interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, DBMS, OSTime required to prepare for the interview - 2.5 monthsInterview preparation tips for other job seekers

Tip 1 : Do 2 projects.
Tip 2 : Practice data structures programs.
Tip 3 : Take a course on Coding Ninjas.

Application resume tips for other job seekers

Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.

Final outcome of the interviewRejected

Skills evaluated in this interview

OodlesTechnologies Interview FAQs

How many rounds are there in OodlesTechnologies Software Developer interview?
OodlesTechnologies interview process usually has 3 rounds. The most common rounds in the OodlesTechnologies interview process are Resume Shortlist, Technical and Assignment.
How to prepare for OodlesTechnologies Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at OodlesTechnologies. The most common topics and skills that interviewers at OodlesTechnologies expect are Data Structures, Database Design, GIT, Hibernate and J2Ee.
What are the top questions asked in OodlesTechnologies Software Developer interview?

Some of the top questions asked at the OodlesTechnologies Software Developer interview -

  1. Introduction react js,and other frameworks ,like angular, ...read more
  2. Javascript, hoisting ,promise ,callback funct...read more
  3. Array , object ,JSON,for l...read more

Tell us how to improve this page.

OodlesTechnologies Software Developer Salary
based on 42 salaries
₹1.5 L/yr - ₹9.8 L/yr
45% less than the average Software Developer Salary in India
View more details

OodlesTechnologies Software Developer Reviews and Ratings

based on 13 reviews

2.3/5

Rating in categories

3.0

Skill development

2.5

Work-life balance

3.0

Salary

2.3

Job security

2.4

Company culture

2.4

Promotions

2.6

Work satisfaction

Explore 13 Reviews and Ratings
Front end Developer
89 salaries
unlock blur

₹2 L/yr - ₹7 L/yr

Associate Consultant
63 salaries
unlock blur

₹1.8 L/yr - ₹6.2 L/yr

Associate Development Consultant
59 salaries
unlock blur

₹2 L/yr - ₹7.6 L/yr

Senior Associate Consultant
49 salaries
unlock blur

₹3 L/yr - ₹10 L/yr

Associate Consultant Developer
43 salaries
unlock blur

₹1.2 L/yr - ₹9 L/yr

Explore more salaries
Compare OodlesTechnologies with

Tekwissen

4.8
Compare

Softenger

4.1
Compare

XcelServ Solutions

4.5
Compare

Damco Solutions

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview