AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Brainvire
Compare
Filter interviews by
Brainvire Odoo Python Developer Interview Questions and Answers for Experienced
Brainvire Odoo Python Developer Interview Experiences for Experienced
1 interview found
I applied via Naukri.com and was interviewed in Nov 2021. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. Lot of technical question.
Interview Preparation Tips
They will say that offer letter send, but its just a job confirmation mail with company terms and conditions and joining document list. No where they will mention offer(i.e salary package)
This two points are worst, so I rejected this offer (sorry its just a job confirmation mail).
Top trending discussions
Interview questions from similar companies
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.
- Q1.
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
- 0 - representing an empty cell
- 1 - representing a fre...
- Ans.
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process
Track the time taken to rot all oranges and return -1 if any fresh oranges remain
Handle edge cases like no fresh oranges or all oranges already rotten
Consider using a queue to efficiently process adjacent oranges
- Q2.
Majority Element Problem Statement
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Exampl...
- Ans.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
- Q3.
Maximum Path Sum Between Two Leaves Problem Description
You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...
- Ans.
Find the maximum path sum between two leaf nodes in a binary tree.
Traverse the tree to find the maximum path sum between two leaf nodes.
Keep track of the maximum sum found so far.
Consider all possible paths between leaf nodes.
Handle cases where the tree has only a single leaf node.
Implement a recursive function to calculate the maximum path sum.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
- Q1.
N-th Node From The End Problem Statement
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
Example:
Input:
If the given list is (1 -> -2 -&g...
- Ans.
Find the N-th node from the end of a Singly Linked List of integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
- Q2.
LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes,
XandY. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes... - Ans.
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other or when one node is the LCA itself.
- Q3.
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 spaces and multiple spaces between words.
Split the input string by spaces to get individual words
Reverse the list of words
Join the reversed words with a single space in between
Handle leading/trailing spaces by stripping them before and after reversing
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
- Q1.
Minimum Time To Solve The Problems
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
- Ans.
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
Sort subjects in descending order
Assign subjects to friends one by one until all subjects are assigned
The maximum workload will be the sum of problems assigned to the friend with the most problems
Return the maximum workload as the minimum time required
- Q2. What is grammar in the context of compiler design?
- Ans.
Grammar in compiler design defines the syntax and structure of a programming language.
Grammar specifies the rules for forming valid statements in a programming language.
It consists of a set of production rules that define how valid programs can be constructed.
There are different types of grammars such as context-free grammar, regular grammar, etc.
Example: In C programming language, the grammar specifies that a for loop...
- Q3. What is a token in compiler design?
- Ans.
A token in compiler design is a basic unit of syntax that the compiler can understand and process.
Tokens are the smallest units of a program that are meaningful to the compiler.
Examples of tokens include keywords, identifiers, operators, and punctuation symbols.
Tokens are generated by the lexical analysis phase of the compiler.
Tokens are used by the parser to build the abstract syntax tree of the program.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.
- Q1.
Sum Root to Leaf Numbers
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
- Ans.
Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current path sum to the total sum when reaching a leaf node
Use modulo (10^9 + 7) to handle large outputs
- Q2. What is a regular language?
- Ans.
A regular language is a language that can be recognized by a finite automaton.
Regular languages can be described by regular expressions.
Regular languages are closed under union, concatenation, and Kleene star operations.
Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.
- Q3. What are NP and NP-Hard problems?
- Ans.
NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.
NP problems can be verified in polynomial time but not necessarily solved in polynomial time.
NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.
Examples of NP problems include the subset sum problem and the traveling salesm...
Round duration - 30 minutes
Round difficulty - Easy
That was the round for which I’ve been waiting for hours
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.
Interview Preparation Tips
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.
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 27 Jul 2022
I applied via Campus Placement and was interviewed before Jul 2021. There were 5 interview rounds.
Round 1 was about 60 mins long. Basic Aptitude questions along with Programming MCQ
Round 2 had 2 coding questions with a time limit of 60mins. Intermediate level problem solving
knowledge is neccessary.
(1 Question)
- Q1. Technical Round 1 was 1hr long. Detailed Insights about my project and a few programming questions in DSA
(1 Question)
- Q1. This Technical Round 2 was 1hr long and was mainly focused on problem solving skills and a few basic programming concepts.
(1 Question)
- Q1. Three Situational questions were asked .
Interview Preparation Tips
- Data Structures
- Algorithms
- CPP
- Problem Solving
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 24 Jan 2022
I applied via Campus Placement and was interviewed before Jan 2021. There were 3 interview rounds.
Interview Questionnaire
3 Questions
- Q1. 1. Write a code to split an array of integers into two subarray where both the array has equal sum.
- Ans.
Code to split an array of integers into two subarrays with equal sum.
Iterate through the array and calculate the total sum.
Divide the sum by 2 to get the target sum for each subarray.
Use dynamic programming to find a subset of the array that adds up to the target sum.
Return the two subarrays.
Example: [1, 2, 3, 4, 5, 6] -> [1, 2, 3, 6], [4, 5]
Example: [1, 2, 3, 4, 5] -> [1, 4, 5], [2, 3]
- Q2. To write code to build up a binary tree from scratch (implement a BST) and then to write all the methods like all the tree traversal algo, and all other stuffs.
- Ans.
Implementing a binary search tree and its traversal methods.
Start by defining a Node class with left and right child pointers.
Implement insert() method to add nodes to the tree.
Implement inorder(), preorder(), and postorder() traversal methods.
Implement search() method to find a node in the tree.
Implement delete() method to remove a node from the tree.
Consider edge cases like empty tree, duplicate nodes, etc.
- Q3. Other OOPs concept and questions related to DSA and OS.
Interview Preparation Tips
Skills evaluated in this interview
I applied via Approached by Company and was interviewed before Mar 2021. There were 4 interview rounds.
DSA
About Social changes
(2 Questions)
- Q1. Tell me about yourself.
- Q2. Very basic questions
Interview Preparation Tips
- DSA
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
We were supposed to give test in any time between 3 PM to 9 PM.
- Q1.
Total Unique Paths Problem Statement
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...
- Ans.
The problem involves finding the total number of unique paths from the top-left to bottom-right cell of a matrix by moving only right or down.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the number of unique paths at each cell.
Initialize the first row and first column with 1 as there is only one way to reach them.
For each cell (i, j), the number of unique paths is the sum of paths...
- Q2.
Subtree Node Count Problem
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...
- Ans.
Given a tree with N nodes, find the number of elements in each subtree rooted at every node.
Traverse the tree using Depth First Search (DFS) to calculate subtree sizes for each node.
Use an array to store subtree sizes for each node, starting with leaf nodes having size 1.
The subtree size of a node is the sum of subtree sizes of its children plus 1 for the node itself.
(1 Question)
Round duration - 120 minutes
Round difficulty - Medium
Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM
Focus Areas: Problem solving and implementation of extensions.
The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
- Q1.
River Crossing: Help Ninja Cross Over
Ninja stands at the start of a wooden bridge over a river. Some segments of the bridge are damaged. The undamaged segments, marked as 'safe', are listed in an array
S... - Ans.
Check if Ninja can cross the river by jumping from one safe segment to another based on given constraints.
Iterate through the 'SAFE' array and check if Ninja can make the required jumps to reach the last safe segment.
Ensure that the next jump is either 'X' - 1, 'X', or 'X' + 1 units from the previous jump.
Return 'true' if Ninja can successfully cross the river, otherwise return 'false'.
(1 Question)
Round duration - 120 minutes
Round difficulty - Medium
Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.
- Q1.
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
- Ans.
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
Return the element pointed to by the slow pointer
Interview Preparation Tips
Tip 1 : Have good grasp on OOPS since they have a round named Pair Programming round which is focused upon this.
Tip 2 : Write clean, modular and functional code.
Tip 3 : Practice Data Structures and Algorithms
Tip 4 : You should know breadth and depth of whatever is mentioned in your resume.
Tip 5 : Be loud and clear.
Tip 1 : Make single page resume.
Tip 2 : Mention relevant things on resume.
Tip 3 : Do not put any false things on resume. Projects, internships you are mentioning be ready to answer questions related to it regarding what you solved, idea, databases, design.
Tip 4 : Contribute in open source, participate in hackathons.
Skills evaluated in this interview
Selected
I applied via Naukri.com and was interviewed in Oct 2024. There were 3 interview rounds.
Online zoom coding test will be there - 4 questions - 2 about output of code & 2 about technical questions.
(2 Questions)
- Q1. Polymorphism and explain about virtual polymorphism
- Ans.
Polymorphism is the ability of a single function or method to operate on different types of data.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
Virtual polymorphism is achieved through virtual functions in C++.
Virtual functions allow a function in a base class to be overridden in a derived class.
Example: Animal class with virtual function 'makeSound' overridden in Dog a
- Q2. Write code for virtual polymorphism and explain
- Ans.
Virtual polymorphism allows objects of different classes to be treated as objects of a common superclass.
Create a base class with virtual functions
Create derived classes that override the virtual functions
Use pointers or references of the base class to call the overridden functions
(3 Questions)
- Q1. About yourself should explain
- Q2. Reason for job change
- Q3. Salary negotiations and location
Interview Preparation Tips
Skills evaluated in this interview
I applied via Campus Placement and was interviewed before Dec 2023. There were 3 interview rounds.
Coding questions and some aptitude questions
(1 Question)
- Q1. Asked oops concept
(1 Question)
- Q1. What is ur 5year goal
- Ans.
My 5-year goal is to become a lead software developer in a reputable tech company, leading a team of developers and working on cutting-edge projects.
Advance my technical skills by learning new programming languages and technologies
Gain experience in project management and leadership roles
Contribute to open-source projects and attend tech conferences to network and stay updated with industry trends
Interview Preparation Tips
Rohit Dandayudham
Questions regarding Java were asked.
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 16 Sep 2021
I appeared for an interview in Dec 2020.
(1 Question)
Round duration - 20 Minutes
Round difficulty - Easy
- Q1.
Left View of a Binary Tree Problem Statement
Given a binary tree, your task is to print the left view of the tree.
Example:
Input:
The input will be in level order form, with node values separated by a...
- Ans.
Print the left view of a binary tree given in level order form.
Traverse the tree level by level and print the first node of each level (leftmost node).
Use a queue to perform level order traversal.
Keep track of the current level and print the first node encountered at each level.
(3 Questions)
Round duration - 45 Minutes
Round difficulty - Easy
It was a technical round held on skype.
- Q1.
Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
- Ans.
Find the node where two linked lists merge, return -1 if no merging occurs.
Traverse both lists to find their lengths and the difference in lengths
Move the pointer of the longer list by the difference in lengths
Traverse both lists simultaneously until they meet at the merging point
- Q2.
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege... - Ans.
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
- Q3.
Merge K Sorted Arrays Problem Statement
You are provided with 'K' different arrays/lists, each sorted in ascending order. Your task is to merge all these arrays/lists into one sorted array/list in ascendi...
- Ans.
Merge K sorted arrays into one sorted array in ascending order.
Iterate through all arrays/lists and merge them into one sorted array using a priority queue or merge sort algorithm.
Ensure to handle edge cases like empty arrays/lists or arrays/lists with different sizes.
Time complexity can be optimized by using a min-heap or priority queue to efficiently merge the arrays/lists.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
It was also a technical round held on Google meet.
- Q1.
Maximum Subarray Problem Statement
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...
- Ans.
The task is to find the subarray with the maximum sum in a given array.
Iterate through the array and keep track of the current sum and maximum sum seen so far.
If the current sum becomes negative, reset it to 0 as it won't contribute to the maximum sum.
Compare the maximum sum with the sum of the current subarray to update the result.
Handle cases where all elements are negative by returning the maximum element in the arr...
Interview Preparation Tips
Tip 1 : Maintain detail notes
Tip 2 : Revise the notes
Tip 1 : Mention the skills only which you are aware of
Tip 2 : Improve your resume
Skills evaluated in this interview
Brainvire Interview FAQs
Tell us how to improve this page.
Brainvire Interviews By Designations
- Brainvire Odoo Python Developer Interview Questions
- Brainvire ASP.NET Developer Interview Questions
- Brainvire Graphic Designer Interview Questions
- Brainvire Software Developer Interview Questions
- Brainvire Senior Software Engineer Interview Questions
- Brainvire Process Associate Interview Questions
- Brainvire Intern Interview Questions
- Brainvire Android Developer Interview Questions
- Show more
Interview Questions for Popular Designations
- Python Developer Interview Questions
- Odoo Developer Interview Questions
- Python Software Developer Interview Questions
- Python and Django Developer Interview Questions
- Python Developer Intern Interview Questions
- Senior Python Developer Interview Questions
- Python Developer Trainee Interview Questions
- Python Automation Engineer Interview Questions
- Show more
Interview Questions from Similar Companies
|
Software Engineer
170
salaries
|  ₹3 L/yr - ₹10 L/yr |
|
Senior Software Engineer
135
salaries
| ₹5 L/yr - ₹15.6 L/yr |
|
Business Analyst
75
salaries
| ₹1.8 L/yr - ₹9.2 L/yr |
|
Associate Software Engineer
63
salaries
| ₹2.2 L/yr - ₹6.8 L/yr |
|
Team Lead
49
salaries
| ₹6 L/yr - ₹21 L/yr |
Xoriant
Photon Interactive
CitiusTech
Iris Software
- Home >
- Interviews >
- Brainvire Interview Questions >
- Brainvire Odoo Python Developer Interview Questions for Experienced
