Odoo Software Developer Intern Interview Questions, Process, and Tips

Q1. Why we hire you?
Add your answer
Q2. Having experience in same domain.
Add your answer

Q1. Self introduction
Add your answer
Q2. Hi , good morning this is kamakshi from someswaram Dr br Ambedkar konaseema district Andhra
Add your answer

Coding questions about our technical skills

Q1. About our skills
Add your answer

Q1. According to the skills to move hr
Add your answer

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.

Q1. 
Longest Decreasing Subsequence Problem Statement
Given an array/list of integers ARR consisting of N integers, your task is to determine the length of the longest decreasing subsequence.
Explanation:
A ...read more
Ans. 
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
Answered by AI
Add your answer
Q2. 
Next Greater Element Problem Statement
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...read more
Ans. 
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,
Answered by AI
Add your answer

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.

Q1. 
Transform BST to Greater Sum Tree
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...read more
Ans. 
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...read more
Answered by AI
Add your answer

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.

Q1. 
Time to Burn Tree Problem
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...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Binary Tree Node Distance Problem Statement
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...read more
Ans. 
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.
Answered by AI
Add your answer