Upload Button Icon Add office photos

Odoo

Compare button icon Compare button icon Compare

Filter interviews by

Odoo Implementation Consultant Interview Questions and Answers

Updated 6 Jul 2024

Odoo Implementation Consultant Interview Experiences

2 interviews found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

30 Questions and 2 language question

Round 2 - One-on-one 

(2 Questions)

  • Q1. Which ERP you have worked in?
  • Ans. 

    I have worked with SAP ERP in my previous role as an Implementation Consultant.

    • Implemented SAP ERP modules for a manufacturing client

    • Customized workflows and reports to meet client's specific requirements

    • Provided training and support to end users during implementation process

  • Answered by AI
  • Q2. Total No fo Exp.?
  • Ans. 

    I have 5 years of experience in implementation consulting.

    • 5 years of experience in implementing software solutions for clients

    • Strong understanding of client requirements and translating them into actionable plans

    • Experience in training clients on new systems and providing ongoing support

    • Successfully led multiple implementation projects from start to finish

  • Answered by AI
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed before Dec 2022. 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 - One-on-one 

(3 Questions)

  • Q1. My past erp implementation experience
  • Ans. 

    I have extensive experience in ERP implementation, including successful projects with large organizations.

    • Led a team in implementing ERP system for a Fortune 500 company

    • Managed data migration and integration processes during ERP implementation

    • Provided training and support to end users post-implementation

  • Answered by AI
  • Q2. Manufacturing flow discrete
  • Q3. Product costing

Implementation Consultant Interview Questions Asked at Other Companies

asked in Darwinbox
Q1. In a factory as per govt rule how much leave is applicable
asked in SPRINKLR
Q2. how you will describe product life cycle?
asked in SPRINKLR
Q3. What does Product Development Life Cycle looks like?
asked in SPRINKLR
Q4. What do you understand by the word implementation?
asked in Mediamint
Q5. What was the most complex implementation you had done

Interview questions from similar companies

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

  • Q1. How can you check if two strings are anagrams of each other?
  • Ans. 

    Check if two strings are anagrams by comparing the sorted versions of the strings.

    • Sort both strings and compare if they are equal.

    • Use a hashmap to store the frequency of characters in each string and compare the maps.

    • Ignore spaces and punctuation when comparing the strings.

  • Answered by AI
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round 3 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute Of Technology, Silchar, Assam. I applied for the job as SDE - 1 in SiddharthnagarEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Basic Computer Science backgroundTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Add projects and Internships if you have done any and add only those things which you really know.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

  • Q1. 

    Detect Cycle in a Directed Graph

    You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...

  • Ans. 

    Detect cycle in a directed graph using depth-first search (DFS) algorithm.

    • Use DFS to traverse the graph and detect back edges indicating a cycle.

    • Maintain a visited array to keep track of visited nodes during traversal.

    • If a node is visited again during traversal and it is not the parent node, then a cycle exists.

    • Return true if a cycle is detected, false otherwise.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

  • Q1. 

    Next Smallest Palindrome Problem Statement

    Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.

    Explanation:

    You are given a number in string format, a...

  • Ans. 

    Find the next smallest palindrome greater than a given number represented as a string.

    • Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

    • Handle cases where the number is a palindrome or has all digits as '9'.

    • Consider both odd and even length numbers when finding the next palindrome.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

  • Q1. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in a top-down manner

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in a bottom-up manner

    • Handle cases where duplicates occur in the boundary nodes

    • Implement the function without printing as printing is already managed

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaGood knowledge of Data Structures, Some great projects which are used by the usersAmazon interview preparation:Topics to prepare for the interview - Data Structures, Web development, System Design, Algorithms, Dynamic Programming, Database, OS, Networking, OOPS, DevOpsTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart. 
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.

Application resume tips for other job seekers

Tip 1 : Always try to make it a single page 
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

Interview Questionnaire 

12 Questions

  • Q1. What are data structures?
  • Ans. 

    Data structures are ways of organizing and storing data in a computer so that it can be accessed and used efficiently.

    • Data structures can be linear or non-linear

    • Examples of linear data structures include arrays, linked lists, and stacks

    • Examples of non-linear data structures include trees and graphs

    • Choosing the right data structure is important for optimizing performance and memory usage

  • Answered by AI
  • Q2. What is a linked list ? What are its uses?
  • Ans. 

    A linked list is a linear data structure where each element is a separate object linked together by pointers.

    • Linked list is used to implement stacks, queues, and hash tables.

    • It is used in computer memory allocation.

    • It is used in image processing to represent pixels.

    • It is used in music player to create a playlist.

    • It is used in web browsers to store the history of visited web pages.

  • Answered by AI
  • Q3. What is the difference between a micro controller and a micro processor?
  • Ans. 

    Microcontroller is a self-contained system with memory, peripherals and processor, while microprocessor only has a processor.

    • Microcontroller has on-chip memory and peripherals, while microprocessor requires external memory and peripherals.

    • Microcontroller is used in embedded systems, while microprocessor is used in general-purpose computing.

    • Examples of microcontrollers include Arduino, PIC, and AVR, while examples of mi...

  • Answered by AI
  • Q4. Can an array have elements of different data types?
  • Ans. 

    Yes, an array can have elements of different data types.

    • An array can have elements of different data types, but it's not recommended.

    • It can make the code harder to read and maintain.

    • For example, an array can have both strings and numbers: ['apple', 5, 'banana']

  • Answered by AI
  • Q5. Explain about the transaction that happen in a bank
  • Ans. 

    Transactions in a bank involve the movement of funds between accounts or the exchange of currency.

    • Transactions can be initiated by customers or by the bank itself

    • Common types of transactions include deposits, withdrawals, transfers, and loans

    • Transactions are recorded in the bank's ledger and may be subject to fees or interest

    • Electronic transactions have become increasingly popular, such as online banking and mobile pay

  • Answered by AI
  • Q6. Explain about your projects
  • Ans. 

    I have worked on various projects related to software development and data analysis.

    • Developed a web application for a client using React and Node.js

    • Analyzed customer data to identify trends and improve marketing strategies

    • Created a machine learning model to predict customer churn for a telecom company

    • Implemented a data pipeline using Apache Spark for processing large datasets

    • Collaborated with a team to develop a mobile

  • Answered by AI
  • Q7. Write a piece of Python Code and explain its working. (Based on my resume)
  • Q8. If a student from a less reputed college approaches you, how will you receive him?
  • Ans. 

    I will receive the student with an open mind and evaluate their skills and potential.

    • I will not judge the student based on their college reputation

    • I will assess their skills, knowledge, and potential through interviews and assessments

    • I will consider their extracurricular activities, internships, and projects

    • I will provide equal opportunities to all candidates regardless of their college

    • Example: I have previously hired ...

  • Answered by AI
  • Q9. Tell me about yourself
  • Ans. 

    I am a highly motivated individual with a passion for problem-solving and a strong work ethic.

    • I have a degree in computer science and have completed several internships in the tech industry.

    • I am proficient in programming languages such as Java, Python, and C++.

    • I have experience working in both team and individual settings, and am comfortable with both.

    • I am always looking for ways to improve my skills and knowledge, and...

  • Answered by AI
  • Q10. Why Oracle and what do you know about us?
  • Ans. 

    Oracle is a leading technology company providing innovative solutions to businesses worldwide.

    • Oracle is known for its database management systems

    • It offers cloud services, enterprise software, and hardware products

    • Oracle has a strong presence in the financial services industry

    • It has acquired several companies including Sun Microsystems and NetSuite

  • Answered by AI
  • Q11. What will you do if i offer you a consulting profile?
  • Ans. 

    I would be thrilled to accept the offer and would work hard to excel in the consulting role.

    • Express gratitude and excitement for the opportunity

    • Assure the interviewer that you are eager to take on the role

    • Emphasize your commitment to working hard and excelling in the position

    • Thank the interviewer for considering you for the role

  • Answered by AI
  • Q12. Tell me about your hobbies
  • Ans. 

    I enjoy reading, hiking, and playing board games.

    • Reading: I love getting lost in a good book, especially science fiction and fantasy.

    • Hiking: I enjoy exploring new trails and challenging myself physically.

    • Board games: I like playing strategy games with friends and family, such as Settlers of Catan and Ticket to Ride.

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: It is a section wise test , you will not be able to go back to earlier sections after you submit them. No negative marking.
In the first section questions were asked based on data reasoning, logical interpretation, ages, work, speed and time. 40 questions 40 mins
In the second section , questions were asked based on C/C++, Object oriented programming. Some code snippets were given and we were asked to give the outputs. 40 questions 40 mins
In the third section, questions were asked on DBMS, data structures and their applications. Flowchart based questions were also asked. 20 questions 40 mins
In the verbal section, questions were based on identifying grammatically correct sentences, identifying the correct word for a phrase, correct usage of articles. 20 questions 20 mins
Tips: For general aptitude refer to any standard book and learn the formulae , they will help you to solve questions quickly. For DBMS and C/C++ refer to any standard textbook.
Duration: 140 minutes
Total Questions: 120

Round: Technical Interview
Experience: The interview lasted for 40-45 minutes. Initially they tested my technical knowledge, they asked me about my internship. They asked me to explain about my projects. He asked me to explain how banks work and process that happen in banks. Then the interview turned to more of a HR interview. They asked me about my hobbies, interests.
Tips: Be confident and presently yourself properly. The interviewers will try to instill some doubt on the answers even if they are correct to check if the person holds his stance, if you feel you have answered correctly , justify it. Also it is better to accept topics which you do not know about.

Round: HR Interview
Experience: The HR interview was more relaxed The discussed about my blogging hobby and asked to tell my latest post. He asked me my opinion about consulting and what i know about it.

General Tips: Be on time for the aptitude test as well as the interviews, it shows your punctuality. Present yourself neatly (dressed appropriately) , preferably clean shaven.
Skills: C/C++ , DataStructures, Knowledge about banks, Logical reasoning
College Name: BMS College Of Engineering, Bangalore
Motivation: I have always wanted to work for Oracle, this has been my biggest motivation. Also my seniors told me its a good company to work for, hence i was more motivated.
Funny Moments: In the technical interview, the interviewer asked me to talk about any recent happenings. He said it could be anything. Political, Sports, religion, movies.. My mind was blank i was very tired with the process. When he said movies , i grabbed the opportunity and told him about a recent kannada movie called 'UPPI2' which had released on that on that day. He told me to tell something else , so I started talking about another telugu movie called 'Baahubali'. Then he started laughing and said "oK, enough of movies, tell me something else."

Skills evaluated in this interview

Interview Questionnaire 

16 Questions

  • Q1. Simple linked list questions-find middle element,given a pointer to second last element delete it
  • Q2. Explain insertion sort,quicksort
  • Ans. 

    Insertion sort and quicksort are sorting algorithms used to sort arrays of data.

    • Insertion sort: iterates through the array and inserts each element into its proper position.

    • Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.

    • Insertion sort is best for small arrays, while quicksort is best for large arrays.

    • Bot...

  • Answered by AI
  • Q3. Concept of virtual destructors,runtime polymorphism
  • Q4. Test cases for an installation software like check if sufficient memory available,check for a previous version,check to undo all the changes made to the system while quitting the installation. 5.2 puzzles
  • Q5. Merge two sorted linked lists using recursion
  • Ans. 

    Merge two sorted linked lists using recursion

    • Create a recursive function that compares the first nodes of both lists

    • Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list

    • Base case: if one list is empty, return the other list

    • Return the merged list

  • Answered by AI
  • Q6. Given an integer(consider 4 bytes) find which byte is zero
  • Ans. 

    Given an integer, determine which byte is zero.

    • Convert the integer to a byte array using bitwise operations.

    • Iterate through the byte array and check for a zero value.

    • Return the index of the zero byte.

    • Consider endianness when converting to byte array.

  • Answered by AI
  • Q7. Program to check whether your machine is little endian or big endian
  • Ans. 

    To check endianness, create a 4-byte integer with a known value and check the byte order.

    • Create a 4-byte integer with a known value

    • Check the value of the first byte to determine endianness

    • If the first byte is the least significant, the machine is little endian

    • If the first byte is the most significant, the machine is big endian

  • Answered by AI
  • Q8. Print something before execution of main()(use static objects)
  • Ans. 

    Static objects can be used to print something before main() execution.

    • Static objects are initialized before main() execution

    • They can be used to print something before main()

    • Example: static int x = printf("Hello World!");

    • Output: Hello World! will be printed before main() execution

  • Answered by AI
  • Q9. Memory allocation for static varibles(when,which segment etc)
  • Ans. 

    Static variables are allocated memory in the data segment of the program's memory space.

    • Static variables have a fixed memory location throughout the program's execution.

    • They are initialized to zero by default.

    • If initialized explicitly, they are stored in the data segment.

    • Static variables can be accessed by any function in the program.

  • Answered by AI
  • Q10. Find space and time complexity for a recursive function(he wrote it)
  • Ans. 

    Finding space and time complexity of a recursive function.

    • Space complexity is the amount of memory used by the function.

    • Time complexity is the amount of time taken by the function to execute.

    • Recursive functions have higher space complexity due to the call stack.

    • Time complexity can be calculated using Big O notation.

    • Examples of recursive functions include factorial and Fibonacci sequence.

  • Answered by AI
  • Q11. Some questions on major project
  • Q12. Preprocessor directives,volatile keyword
  • Q13. Virtual pointer table,operator overloading,friend functions,semaphores
  • Q14. Diamond heirarchy problem
  • Ans. 

    Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.

    • Occurs when a class inherits from two classes that share a common base class

    • Can lead to ambiguity in method calls and data members

    • Solved using virtual inheritance or by using interfaces

  • Answered by AI
  • Q15. Fibonacci series.(:P)
  • Q16. Puzzle

Interview Preparation Tips

Round: Test
Experience: 1. Aptitude-Mostly caselets on ordering and some easy quant questions.
2. c/c++-No objective questions.Mostly on basics(function pointers,give output of string based codes).Some simple progams(Find smallest of three numbers using conditional operators.gcd using recursion)
3.Data Structures-LCA for BST,2's compliment,reverse a doubly linked list.

College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

20 Questions

  • Q1. He asked me my specialization?
  • Q2. Why not further studies? (He had noted that I was third in my batch. He appeared impressed by that
  • Q3. He asked me to tell him about my favorite project
  • Q4. He then looked at my grades. He commented that my lowest grade – B- was in Digital Image Processing. I just looked at him like a doofus thinking of what to say. But he quickly added, ‘don’t worry, it happe...
  • Q5. He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons requ...
  • Q6. Given a polygon (could be regular, irregular, convex, concave), find out whether a particular point lies inside it or outside it
  • Ans. 

    To determine if a point is inside a polygon, use the ray casting algorithm.

    • Create a line from the point to a point outside the polygon

    • Count the number of times the line intersects with the polygon edges

    • If the count is odd, the point is inside the polygon; otherwise, it is outside

  • Answered by AI
  • Q7. He asked me to explain Canny’s algorithm to him. (this was because my DIP project was related to this)
  • Q8. Then, he gave me a practical problem to solve: Suppose you are given an image which contains some text and some photos. How do you find the location of the image?
  • Q9. Which are the four storage classes in C
  • Ans. 

    The four storage classes in C are auto, register, static, and extern.

    • Auto: default storage class for all local variables

    • Register: used to define local variables that should be stored in a register instead of RAM

    • Static: used to define local variables that retain their value between function calls

    • Extern: used to declare a global variable that is defined in another file

  • Answered by AI
  • Q10. Given a program: int i; int main() { int j; int *k = (int *) malloc (sizeof(int)); … } Where are each of these variables stored?
  • Ans. 

    i is stored in global data segment, j is stored in stack, k is stored in heap.

    • i is a global variable and is stored in the global data segment

    • j is a local variable and is stored in the stack

    • k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()

  • Answered by AI
  • Q11. Question on polymorphisms
  • Q12. He again went back to the first question he had asked me. Once again
  • Q13. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then. Then, he asked me a DIP quest...
  • Q14. Given a set of words one after another, give me a data structure so that you’ll know whether a word has appeared already or not
  • Ans. 

    Use a hash table to store the words and check for existence in constant time.

    • Create a hash table with the words as keys and a boolean value as the value.

    • For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.

    • Alternatively, use a set data structure to store only the unique words and check for existence in the set.

  • Answered by AI
  • Q15. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I rea...
  • Q16. He then asked me some DB fundas. Transaction. Serializability, Consistent state, etc
  • Q17. Finally, he asked me whether I had any questions
  • Q18. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obv...
  • Q19. There was one more puzzle.. I don’t remember it. but I do remember that we started discussing ways of generating large prime numbers
  • Q20. We also talked a bit about my phone browser project

Interview Preparation Tips

Round: Test
Duration: 15 minutes
Total Questions: 1

Round: Test
Duration: 30 minutes
Total Questions: 2

Round: Test
Duration: 30 minutes
Total Questions: 3

Round: Test
Total Questions: 4

Round: Technical Interview
Experience: 1.When I told him that I had none as I didn’t want to specialize in this stage, he was a little surprised but appeared satisfied with my reason.2.I told him that my profile clearly indicated that I’ve been trying to get into the industry via internships, industry-funded projects right from second year, second sem. I said that I was fully sure that I didn’t want to do MS anytime soon.3.I told him about the web-browser that I had developed for cell-phones. I thought that was the only project which was closest to what Adobe was working on. He appeared satisfied with my answers.4. So people, be fully prepared to explain any anomalous grades. I was prepared with the explanation of the W in the my grade-sheet but not of the B- in DIP. I know that this is really stupid considering that I was interviewing with Adobe. Don’t make this mistake.5.I screwed up, big time in this question. I had superficially discussed this question with my friend a while ago and he had outlined an algorithm which I thought that I had understood, but I hadn’t. I started off explaining it but got stuck in the middle. He sternly told me to read it up again. One solution that I could tell him, and which I had written in the test was this Use two variables – min and second min. Initialize them by comparing the first two elements of the array. This is (1) comparison. Then, go through the entire array, from index 2 to n-1 comparing each element, first with min and then with second min, updating each variable as necessary. This will involve a worst case of two comparisons for each element. Therefore, total number of comparisons = 2*(n-2) + 1 = 2*n – 3 comparisons.I’ll try to update this with a better solution, sometime soon.6.This is an easy, straight question from graphics. You shoot a ray parallel to the x-axis passing through this point. Start with odd parity. Change parity of ray each time it intersects an edge of the polygon (consider special case of when the line passes through a vertex of the polygon. Change parity only if it passes through a vertex which has one edge above it and one edge below the ray). If the parity of ray is even when it passes through the point, it is inside the polygon, else it is not.7.This is simple. Study DIP8.I gave various alternatives – from searching for RGB components, to using OCR.. he didn’t appear fully satisfied. I think he was looking for edge-detection, but that would fail, if the text contained tables, etc.

Round: Technical Interview
Experience: He was friendly at the start but this interview was my worst. He asked me my favorite subject. I said that it was Programming. (He laughed at that)

1. static, extern, register, auto2.I started off correctly, but he was able to confuse me. He brought in shared libraries, static libraries fundas into the discussion. We had a discussion for about twenty-minutes on this. Finally, he was happy with one of my answers because I had deduced which policy made sense and answered correctly. He said that out of all the people interviewed so far (I was second last), nobody had been able to answer all of these questions correctly.3.this is easy – get it from any C++ book. He tried to confuse me again, but this time I was ready and he was finally satisfied.Then he looked at my grades and said that out of all your grades, you have only two Bs and one of them is in Compilers. Why? (Damn it. three non-A grades and that’s all they ask about. What’s wrong with this world?!)Didn’t you like Compilers? “Not in particular”, I replied. “Fine. Now, I HAVE to ask you questions on compilers”, he said.4.He again went back to the first question he had asked me. Once again5.I first suggested that we capture only a small portion of the board. To locate that portion, we could search for the chalk in the prof’s hand – of course, taking care that it had the blackboard in the background (no point capturing a video of the prof scratching his chin, na?). Further, if the prof was writing only text, we could convert the video into text by OCR and then transmitting. Simple diagrams could also be reduced to a set of vector-graphics instructions (we rarely, see the prof shading stuff). I think he liked my approach, but was not completely satisfied. Anyway, we left it at that and went forward.6.I suggested various alternatives. but he kept helping me and finally, we came up with an array of pointers to 26-trees (each node of the tree has 26 children). Store every word as a path from the root to a leaf with pointers in the correct places. For example, hello would be stored as – pointer from ‘h’ index of the root array to a node which had a pointer from ‘e’ index of it’s array to a node which had a pointer from ‘l’ index of the array.. and so on. This is both time and space efficient.7.I was able to answer all his questions, but I made the mistake of telling him, when we started off that I didn’t know much about this subject as I had done it a long time ago. He was very annoyed at that, apparently because a lot of people before me had said this.8.I was able to answer all of them. I stumbled around a bit in a few questions where I was explaining correctly, but not using the keywords that he was looking for.9.I thought that I should say something to make him realize that I was not completely stupid and so asked him whether there was any logic to the order in which the short-listed candidates were called. This turned out to be a dumb move. The order was alphabetic and he sent me off with a parting shot, saying “You guys do pattern recognition and stuff and still you can’t recognize such a simple pattern” Me and my big mouth! Moral of the story: Don’t ask questions for the sake of asking.

Round: Puzzle Interview
Experience: After the first two interviews, this one was like having a warm batch after being cold and wet for days! I did well in this one.1.You have to go up the hill and come back, with horse, without horse, getting four equations to solve four unknowns – time to go uphill – with horse, without horse, time to go downhill – with horse, without horse. Then you can go up the hill and set the clock to ‘(time when you left) + (time to go uphill with horse)’2.  I told him the funda of Mersenee primes (luckily remembered it) and he was decently impressed.

General Tips: Finally hired by Adobe. Special thanks to AmbitionBox team. Really amazing site for sharing experience. That’s all for the Adobe. They are focusing on your approach and your coding skills. All the best.
Skills: Algorithm, Data structure, C++, C, DIP
College Name: BIT Mesra

Skills evaluated in this interview

Interview Questionnaire 

12 Questions

  • Q1. Given a binary tree and an integer x, return whether the binary tree has a path from root to a leaf whose values sum to x
  • Q2. Gievn a binary tree and return all root to leaf node pathss row,col and value
  • Ans. 

    Return all root to leaf node paths in a binary tree with row, col and value.

    • Traverse the binary tree recursively and keep track of the current path.

    • When a leaf node is reached, add the path to the result array.

    • Include row, col and value of each node in the path.

    • Use an array of strings to store the paths.

  • Answered by AI
  • Q3. He then asked me to give test cases for testing this program
  • Q4. Given two unsorted arrays of numbers and asked me to find the intersection
  • Q5. GetMax() function for a stack in O(1)
  • Ans. 

    To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.

    • Create a separate stack to keep track of maximum values

    • Push the maximum value onto the stack whenever a new maximum is encountered

    • Pop the maximum value stack whenever the top element of the main stack is popped

    • Return the top element of the maximum value stack to get the maximum value in O(1)

  • Answered by AI
  • Q6. GetMax() function for a queue in O(1)
  • Ans. 

    To get max element from a queue in O(1) time complexity

    • Maintain a separate variable to keep track of the maximum element in the queue

    • Update the maximum element variable whenever a new element is added or removed from the queue

    • Return the maximum element variable when getMax() function is called

  • Answered by AI
  • Q7. Given an array in which consecutive elements differ by 1, i.e. a[i] – a[i + 1] = 1 or -1, and an element x, find the element in the array
  • Q8. Given an array, find the Next Greatest Element to the right for each element
  • Ans. 

    Find the Next Greatest Element to the right for each element in an array of strings.

    • Iterate through the array from right to left

    • Use a stack to keep track of elements

    • Pop elements from stack until a greater element is found

    • If no greater element is found, assign -1

    • Return the result array

  • Answered by AI
  • Q9. Given an expression, remove unnecessary parenthesis. For example if (((a + b)) * c) is given make it (a + b) * c, as it evaluates in the same way without those parenthesis also
  • Ans. 

    To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.

    • Identify and remove parenthesis around single variables or constants

    • Identify and remove parenthesis around expressions with only one operator

    • Identify and remove parenthesis around expressions with operators of equal precedence

    • Identify and remove parenthesis around expressions with operators of different ...

  • Answered by AI
  • Q10. Given an array of integers, find the maximum product which can be formed by three numbers
  • Ans. 

    Find the maximum product of three integers in an array.

    • Sort the array in descending order.

    • Check the product of the first three numbers and the product of the first and last two numbers.

    • Return the maximum of the two products.

  • Answered by AI
  • Q11. Given an array of integers, find the length of the longest consecutive sub array which forms an AP
  • Ans. 

    Find length of longest consecutive sub array forming an AP from given array of integers.

    • Sort the array in ascending order

    • Iterate through the array and find the longest consecutive sub array forming an AP

    • Use a variable to keep track of the length of the current consecutive sub array forming an AP

    • Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far

  • Answered by AI
  • Q12. Given a binary tree, connect all the nodes at the same level. Each node will have a next pointer; you have to make it point to the next node to its right in the same level. If there is no such node, make ...

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: NA

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

The interviewer asked me 2 questions related to DS/Algo in this round . Both the questions were of Easy-Medium difficulty and I was also required to code them in a production ready manner.

  • Q1. 

    Maximum Sum Path in a Binary Tree Problem Statement

    You are provided with a binary tree consisting of N nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...

  • Ans. 

    Find the maximum sum achievable by a simple path between any two nodes in a binary tree.

    • Traverse the binary tree to find all possible paths and calculate their sums.

    • Keep track of the maximum sum encountered during traversal.

    • Consider paths that may include the same node twice.

    • Implement a recursive function to explore all possible paths.

    • Handle cases where nodes have negative values.

  • Answered by AI
  • Q2. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal, and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 questions of DS/Algo to solve under 50 minutes and one question related to Operating Systems.

  • Q1. 

    Next Greater Element Problem Statement

    You are provided with an array or list ARR containing N positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.

    T...

  • Ans. 

    Find the Next Greater Element for each element in an array.

    • Iterate through the array from right to left

    • Use a stack to keep track of elements with no greater element to the right

    • Pop elements from the stack until finding a greater element or stack is empty

  • Answered by AI
  • Q2. 

    Number In Arithmetic Progression Problem

    Given three integers X, C, and Y, where X is the first term of an arithmetic sequence with a common difference of C, determine if Y is part of this arithmetic sequ...

  • Ans. 

    Check if a given number is part of an arithmetic sequence with a given first term and common difference.

    • Calculate the arithmetic sequence using the formula: nth term = X + (n-1) * C

    • Check if Y is equal to any term in the sequence to determine if it belongs to the sequence

    • Return 'True' if Y belongs to the sequence, otherwise return 'False'

  • Answered by AI
  • Q3. Can you define process and threads in operating systems?
  • Ans. 

    Processes are instances of programs in execution, while threads are smaller units within a process that can execute independently.

    • A process is a program in execution, consisting of code, data, and resources.

    • Threads are smaller units within a process that can execute independently.

    • Processes have their own memory space, while threads share the same memory space within a process.

    • Processes are heavyweight, while threads ar...

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.

  • Q1. 

    Max Product Subset Problem Statement

    Given an array/list arr of size n, determine the maximum product possible by taking any subset of the array/list arr. Return the result modulo 10^9+7 since the product ...

  • Ans. 

    Find the maximum product of a subset of an array modulo 10^9+7.

    • Iterate through the array and keep track of the maximum positive product and minimum negative product encountered so far.

    • Handle cases where the array contains zeros separately.

    • Return the maximum product modulo 10^9+7.

  • Answered by AI
  • Q2. 

    Populating Next Right Pointers in Each Node

    Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.

    ...
  • Ans. 

    Implement a function to update 'next' pointers in a complete binary tree.

    • Iterate level by level using a queue

    • Connect nodes at each level using 'next' pointers

    • Handle null nodes appropriately

    • Ensure the tree is a complete binary tree

  • Answered by AI
  • Q3. You have two wires of different lengths that are both capable of burning for exactly one hour when ignited at both ends. How can you measure a time interval of 45 minutes using these two wires?
Round 4 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round consisted of 2 questions from DSA where I was first asked to explain my approach to the interviewer with proper complexity analysis and then code the problems. The interviewer was quite friendly and also provided me some hints when I was stuck.

  • Q1. 

    Stack with getMin Operation

    Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...

  • Ans. 

    Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space.

    • Use two stacks - one to store the actual elements and another to store the minimum element at each level.

    • When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.

    • When popping an element, also pop from the minimum stack if the popped element is t...

  • Answered by AI
  • Q2. 

    Split Array Into Maximum Subarrays Problem Statement

    You are given an integer array arr of size N. Your task is to split the array into the maximum number of subarrays such that the first and last occurre...

  • Ans. 

    Given an array, split it into maximum subarrays with first and last occurrence of each element in a single subarray.

    • Iterate through the array and keep track of the first and last occurrence of each element.

    • Use a hashmap to store the indices of each element.

    • Split the array whenever the last occurrence of an element is found.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAdobe interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 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

Odoo Interview FAQs

How many rounds are there in Odoo Implementation Consultant interview?
Odoo interview process usually has 2 rounds. The most common rounds in the Odoo interview process are One-on-one Round, Resume Shortlist and Aptitude Test.
What are the top questions asked in Odoo Implementation Consultant interview?

Some of the top questions asked at the Odoo Implementation Consultant interview -

  1. My past erp implementation experie...read more
  2. Total No fo Ex...read more
  3. Manufacturing flow discr...read more

Tell us how to improve this page.

Odoo Implementation Consultant Interview Process

based on 2 interviews

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
IBM Interview Questions
4.0
 • 2.3k Interviews
Oracle Interview Questions
3.7
 • 846 Interviews
Google Interview Questions
4.4
 • 823 Interviews
Zoho Interview Questions
4.3
 • 505 Interviews
SAP Interview Questions
4.2
 • 283 Interviews
Adobe Interview Questions
3.9
 • 233 Interviews
Salesforce Interview Questions
4.0
 • 221 Interviews
Tally Solutions Interview Questions
4.2
 • 39 Interviews
View all
Odoo Implementation Consultant Salary
based on 7 salaries
₹5.8 L/yr - ₹14 L/yr
9% more than the average Implementation Consultant Salary in India
View more details
Software Developer
49 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Analyst
25 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Advisor
11 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Functional Consultant
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Odoo Developer
8 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Odoo with

Zoho

4.3
Compare

Tally Solutions

4.2
Compare

SAP

4.2
Compare

Microsoft Corporation

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