Filter interviews by
Clear (1)
I applied via Company Website and was interviewed in Jun 2024. There were 3 interview rounds.
Coding Test consists of 3 Problem Question (2 Logical questions and 1 SQL Query ) and Around 20 MCQS
Platform - CoderByte
30 Aptitude Question
3 Mail Writing Question
Solved a sorting problem by implementing quicksort algorithm.
Implemented quicksort algorithm to efficiently sort the array.
Used recursion to divide the array into smaller subarrays and sort them individually.
Optimized the algorithm by choosing a pivot element strategically to minimize comparisons.
The 3rd question based on SQL query likely refers to a specific query or scenario related to SQL.
Understand the context of the query being asked about
Analyze the structure and purpose of the SQL query
Explain the expected output or result of the query
Code to reverse digits of a number
Use modulo operator to extract the last digit of the number
Multiply the result by 10 and add the next digit until all digits are reversed
Handle negative numbers separately by converting to positive before reversing
I applied via Company Website and was interviewed in Sep 2024. There were 3 interview rounds.
There were 3 coding questions in the first round
30 MCQ questions based on Math, reasoning and English and also email writing
Coding round with 4 coding problem
I applied via Company Website and was interviewed in Apr 2024. There were 2 interview rounds.
There are 4 questions. Time duration is 1 hour 40 minutes.
Basic aptitude questions.
Odoo interview questions for designations
I applied via Campus Placement and was interviewed in Jul 2023. There were 4 interview rounds.
It includes 4 questions in which 3 are DSA based and 1 is based on SQL query. The difficulty level is intermediary.
It includes 28 questions with negative marking to solve in 30 minutes.
Changes in code and logic checking
Code changes involve modifying the existing codebase to add new features or fix bugs
Logic checking ensures that the code follows the intended logic and produces the expected results
Code reviews and testing are important for identifying and rectifying code and logic issues
Automated testing tools can help in detecting logic errors and ensuring code correctness
DS and Algo based 4 questions
Top trending discussions
posted on 2 Oct 2024
I applied via Campus Placement
It was good experience
I was interviewed in Feb 2025.
Coding questions about our technical skills
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
25 mcqs and 2 coding questions
(It was a part of Amazewow process via Amazewit https://www.amazewit.in/)
Timing- any time between 22-24 may 2020
Webcam was on.
Given an array/list of integers ARR
consisting of N
integers, your task is to determine the length of the longest decreasing subsequence.
A ...
Find the length of the longest decreasing subsequence in an array of integers.
Use dynamic programming to keep track of the longest decreasing subsequence ending at each index.
Initialize an array to store the length of the longest decreasing subsequence ending at each index.
Iterate through the array and update the length of the longest decreasing subsequence for each element.
Return the maximum value in the array as the
Given an array arr
of length N, your task is to compute the Next Greater Element (NGE) for each element in the array. The NGE for an element X
is the first greater e...
The task is to find the Next Greater Element (NGE) for each element in an array.
Iterate through the array from right to left and use a stack to keep track of elements.
For each element, pop elements from the stack until finding a greater element.
Store the next greater element in a result array, if no greater element is found, store -1.
Time complexity can be optimized to O(N) using a stack.
Example: For input array [1, 3,
Round duration - 60 minutes
Round difficulty - Medium
It held at morning 10 AM.
The interviewer was very friendly.
I was asked to solve 2 coding questions and was continuously provided with hints by the interviewer.
Question was on Array and Trees.
Given a Binary Search Tree (BST) of integers, the task is to convert it into a greater sum tree. In this transformation, each node's value is replaced by the sum of value...
Convert a Binary Search Tree into a Greater Sum Tree by replacing each node's value with the sum of values of all nodes greater than the current node.
Traverse the BST in reverse inorder (right, root, left) to visit nodes in descending order.
Keep track of the sum of visited nodes and update each node's value with this sum.
Recursively apply the above steps to all nodes in the BST.
Example: For the given BST, the transform...
Round duration - 45 minutes
Round difficulty - Hard
Morning 8 AM.
The interviewer was very friendly provided with various hints.
It was covering complex coding questions on Tree Data Structures.
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
Perform a depth-first search (DFS) to calculate the time taken to burn the entire tree.
Track the time taken for each node to catch fire and propagate the fire to its adjacent nodes.
Return the maximum time taken among all nodes as the total time to burn the entire tree.
Given a binary tree and the values of two nodes, your task is to find the distance between these nodes within the Binary Tree.
Distance is defined as the minim...
Find the distance between two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to each node.
Find the lowest common ancestor of the two nodes.
Calculate the distance by adding the distances from the nodes to the common ancestor.
Tip 1: Code More
Tip 2: Study Data Structures
Tip 3: Be Confident
Tip 1: Mention only what you are confident about
Tip 2: Mention tools & technologies used in the project as well
based on 6 interviews
3 Interview rounds
based on 5 reviews
Rating in categories
Software Developer
49
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Advisor
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Functional Consultant
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Odoo Developer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Zoho
Tally Solutions
SAP
Microsoft Corporation