Upload Button Icon Add office photos

Filter interviews by

Anaplan Interview Questions and Answers

Updated 6 Oct 2023

Anaplan Interview Experiences

1 interview found

Consultant Interview Questions & Answers

user image Anonymous

posted on 6 Oct 2023

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
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 Resume tips
Round 2 - Technical 

(3 Questions)

  • Q1. What is anaplan
  • Ans. 

    Anaplan is a cloud-based platform for business planning and performance management.

    • Anaplan allows organizations to create and maintain complex financial models for forecasting and budgeting.

    • Users can collaborate in real-time on plans and scenarios, making it easier to make informed decisions.

    • The platform integrates data from various sources to provide a comprehensive view of the business.

    • Anaplan is used by companies ac...

  • Answered by AI
  • Q2. Cloud based platform for analysis and planning of a company
  • Ans. 

    A cloud-based platform for analysis and planning helps companies streamline processes and make data-driven decisions.

    • Allows for real-time collaboration among team members

    • Provides access to data from anywhere with internet connection

    • Offers advanced analytics tools for forecasting and scenario planning

    • Integrates with other business systems for seamless data flow

    • Examples: Microsoft Azure, Google Cloud Platform, Amazon Web

  • Answered by AI
  • Q3. What is CPM AND ITS USES IN A COMPANY
  • Ans. 

    CPM stands for Critical Path Method and is a project management technique used to identify the longest sequence of dependent tasks.

    • CPM helps in determining the critical path of a project, which is the sequence of tasks that determines the total duration of the project.

    • It helps in identifying tasks that are critical and cannot be delayed without delaying the entire project.

    • CPM is useful in resource allocation, schedulin...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Nothing, learn skills and knowledge and thats it

Skills evaluated in this interview

Consultant Interview Questions asked at other Companies

Q1. How would you pass an entry for travel expenses incurred and paid by employee and was reimbursed? How would the end to end flow happens
View answer (8)

Sopra Steria

Success to our employee's well-being? A work-life balance that's simply unbeatable.

Our employees have rated us 4 for Work-Life Balance on AmbitionBox

Jobs at Anaplan

View all

Interview questions from similar companies

Interview Preparation Tips

Round: Test
Experience: This was a written round. Proper code with correct syntax to be written on paper.
There were 4 questions to be solved in 1 hour. Some questions needed test cases and time complexity to be answered as well.
1) Binary numbers are given as linked lists. Add and store result in linked list.
2) A number starting from 1 can be got by either multiplying 3 or adding 5 to it. Given a number, find the sequence of operations to get it or say it’s not possible.
Eg: 13 = 1 * 3 + 5 + 5, 15 ; Not possible
3) Given an input array on integers. Output an array of same length such that the value at ith position of output array is the product of all numbers in input array except that at ith position.
Eg: Input: 3, 5, 7 Output: 35, 21, 15
4) Sort a stack in ascending order using another stack.12 people were shortlisted for next round

Round: Design Round:
Experience: This was NOT an elimination round.
It was a problem solving team exercise to understand their way of working.
The interviewers were making notes though during the exercise, don’t know if it affected our selection.

Round: Technical Interview
Experience: General questions based on resume, was asked to explain my internship project.
He asked questions on my written round. Asked me to find the bug in my code for 1st problem. He was extremely happy with me when I gave the correct answer.
He asked me for the code for the last problem since I hadn’t solved it.
Asked to reverse linked list using recursion, since I said I did by iteration earlier.
He had written code of second problem, I had to find bugs in it.
Discussion on quality engineering and developer profiles.

Round: HR Interview
Experience: This was more of a general discussion. She told me about what quality engineers do, how their role is more powerful. Asked me how you would test the Google page.
She was extremely impressed by my resume and asked me questions about my electives. She told me in this round itself that I was selected, only need to wait for the official announcement.I hope this article helps students. One advice, make sure you make a good resume and also try to focus on proper code and explaining your logic well.Thank you!

College Name: NA

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a written round. Proper code with correct syntax to be written on paper.
There were 4 questions to be solved in 1 hour. Some questions needed test cases and time complexity to be answered as well.

  • Q1. 

    Add Two Numbers as Linked Lists

    You are given two singly linked lists, where each list represents a positive number without any leading zeros.

    Your task is to add these two numbers and return the sum as ...

  • Ans. 

    Add two numbers represented as linked lists and return the sum as a linked list.

    • Traverse both linked lists simultaneously while keeping track of carry from previous sum

    • Handle cases where one linked list is longer than the other by padding with zeros

    • Create a new linked list to store the sum of the two numbers

  • Answered by AI
  • Q2. 

    Minimum Number Of Operations To Reach X Problem Statement

    Given an array ARR of 'N' integers and an integer 'X', determine the minimum number of operations required to make the sum of removed elements fro...

  • Ans. 

    Given an array of integers and a target sum, find the minimum number of operations to make the sum of removed elements equal to the target.

    • Iterate from both ends of the array, removing elements until the sum matches the target

    • Use a two-pointer approach to efficiently find the minimum number of operations

    • If achieving the target sum is not possible, return -1

  • Answered by AI
  • Q3. 

    Product Of Array Except Self Problem Statement

    You are provided with an integer array ARR of size N. You need to return an array PRODUCT such that PRODUCT[i] equals the product of all the elements of ARR ...

  • Ans. 

    The problem requires returning an array where each element is the product of all elements in the input array except itself.

    • Iterate through the array twice to calculate the product of all elements to the left and right of each element.

    • Use two arrays to store the products to the left and right of each element.

    • Multiply the corresponding elements from the left and right arrays to get the final product array.

    • Handle integer ...

  • Answered by AI
  • Q4. 

    Sort a Stack Problem Statement

    You are provided with a stack consisting of 'N' integers. The goal is to sort this stack in descending order by utilizing recursion.

    Allowed Stack Operations:

    is_empty(S) ...
  • Ans. 

    Sort a stack in descending order using recursion without using loop constructs.

    • Implement a recursive function to sort the stack in descending order.

    • Use the provided stack operations to manipulate the stack.

    • Recursively pop elements from the stack, sort them, and push them back in descending order.

    • Handle base cases such as an empty stack or a single element stack.

    • Ensure the stack is sorted in descending order after the r...

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

General questions based on resume, was asked to explain my internship project.
He asked questions on my written round. Asked me to find the bug in my code for 1st problem. He was extremely happy with me when I gave the correct answer.
He asked me for the code for the last problem since I hadn’t solved it.
Asked to reverse linked list using recursion, since I said I did by iteration earlier.
He had written code of second problem, I had to find bugs in it.
Discussion on quality engineering and developer profiles.

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

    • Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list as the last node encountered during the reversal process.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAIntuit interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 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 was interviewed before Jan 2021.

Round 1 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round that lasted for around 60 minutes. The interviewer asked questions on data structures and OOPS concepts.

  • Q1. 

    Problem: Permutations of a String

    Given a string STR consisting of lowercase English letters, your task is to return all permutations of the given string in lexicographically increasing order.

    Explanatio...

  • Ans. 

    Return all permutations of a given string in lexicographically increasing order.

    • Generate all permutations of the given string using backtracking.

    • Sort the permutations in lexicographical order.

    • Print the sorted permutations separated by space.

  • Answered by AI
  • Q2. 

    Greatest Common Divisor Problem Statement

    You are tasked with finding the greatest common divisor (GCD) of two given numbers 'X' and 'Y'. The GCD is defined as the largest integer that divides both of the...

  • Ans. 

    Find the greatest common divisor (GCD) of two given numbers 'X' and 'Y'.

    • Implement a function to calculate GCD using Euclidean algorithm

    • Iteratively find the remainder of X divided by Y until Y becomes 0

    • The last non-zero remainder is the GCD of X and Y

  • Answered by AI
  • Q3. What are the differences between C, C++, and Java?
  • Ans. 

    C is a procedural language, C++ is an object-oriented language, and Java is a platform-independent language.

    • C is a procedural programming language, while C++ supports both procedural and object-oriented programming.

    • C++ is an extension of C with additional features like classes and inheritance.

    • Java is a platform-independent language that runs on a virtual machine and uses automatic memory management.

    • C is closer to the h...

  • Answered by AI
  • Q4. What is the purpose of the virtual keyword in C++?
  • Ans. 

    The virtual keyword in C++ is used to declare a member function in a base class that can be overridden in derived classes.

    • Virtual functions allow for dynamic polymorphism in C++ by enabling late binding.

    • Virtual functions are declared in the base class with the 'virtual' keyword and can be overridden in derived classes.

    • When a derived class overrides a virtual function, the function in the derived class is called instead...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round that lasted for around 60 minutes. The interviewer asked questions on data structures and question related to cloud computing(cloud computing was listed on my resume) .

  • Q1. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.

    • Implement a doubly linked list to keep track of the order of keys based on their recent usage.

    • Use a hashmap to store key-value pairs for quick access and update.

    • When capacity is reached, evict the least recently used item before inserting a new item.

    • Update the order of keys in the linked list whenever a...

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

    Delete a specific node from a singly linked list given the reference to the node.

    • 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
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round that lasted for around 60 minutes. The interviewer asked questions on data structures and question related to networking.

  • Q1. 

    Insertion Sort in a Linked List

    Given a singly linked list with 'N' nodes containing integer values, your task is to sort the list using insertion sort and output the sorted list.

    Insertion Sort is an al...

  • Ans. 

    Implement insertion sort algorithm on a singly linked list.

    • Traverse the linked list and for each node, find its correct position in the sorted list.

    • Keep track of the current node and the previous node to perform the insertion.

    • Repeat this process until all nodes are sorted in the linked list.

    • Ensure to handle edge cases like empty list or list with only one node.

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

  • Answered by AI
Round 4 - HR 

(1 Question)

Round duration - 40 minutes
Round difficulty - Easy

The Interviewer asked me questions to know more about me. He also asked a puzzle.

  • Q1. You have a racetrack with 25 horses. What is the fastest way to determine the top 3 fastest horses, given that you can only race 5 horses at a time?
  • Ans. 

    To determine the top 3 fastest horses out of 25, race horses in groups of 5 and keep track of the fastest horses in each race.

    • Divide the 25 horses into 5 groups of 5 horses each.

    • Race all 5 horses in each group, keeping track of the top 3 fastest horses in each race.

    • After 5 races, you will have the top 3 fastest horses from each group.

    • Race the top 3 horses from each group in a final race to determine the overall top 3 f

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAIntuit interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OS, DBMS , Aptitude, OOPSTime required to prepare for the interview - 6 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

Interview Preparation Tips

Round: Interview
Experience: They asked to write 2 codes on recursion. Then some questions on resume. I asked them about the job profile and after knowing that they were hiring candidates for frontend programming, about which they didn’t mention in JAF. I told them that I was not interested in frontend development. And didn’t even answer any question after that. Unfortunately, I was selected.

General Tips: Plan your schedule judiciously keeping your capacity in mind. There is no point of making ideal plans and then not able to do even 50% of it.
Don’t get into unnecessary arguments or debate with people.
Don’t think about what others are doing. Focus on your preparation.
How you carry yourself matters. So, make sure you portray yourself in the way you want the other person to perceive you.
Be selective while applying for companies.
College Name: IIT Kanpur

Interview Preparation Tips

Round: Test
Experience: 3 coding questions - had to write efficient and working code or algorithm for them along with test cases for them.

Round: Group Activity
Experience: A topic is given followed by brainstorming. After this we were divided into groups of four we had to come up with a group solution for the problem given and present it.

Round: Technical Interview
Experience: Two Rounds - consisting of algorithm , Data structures , puzzles , questions based on projects and bit of Operating Systems.

Round: HR Interview
Experience: This was just normal interaction and past experiences and stuff.

General Tips: 1. Cracking The Coding Interview : The best book for coding interview preparations.
2. AmbitionBox - A really big help! Do refer other companies in the same sector as well to prepare !
Know what you have written in your resume well and be prepare to answer any question related to those stuff.
Skills:
College Name: NIT Surathkal

Interview Preparation Tips

Round: Test
Experience: I got pre placement offer from the company after doing a 10 week internship there. The placement procedure was the same as that done for internship. There were 4 stages. The first one was the written test followed by a group activity. The shortlisted candidates were divided into groups and had to come up with a solution for a given problem statement. This was a no elimination round

Round: Technical Interview
Experience: All candidates had to go through a technical interview. The type of questions asked depended on one's strengths and the interviewer.

General Tips: Dress appropriately but comfortably and look confident even if you are not. Do not hesitate while answering questions. Even if you are not sure if the answer is entirely correct, attempting is important. Be active in the group activity. Try acting as the team leader. This gets you noticed.
Intuit has given importance to out of the box thinking. Answer questions in your own way as long as you have a good explanation for why you are right. They prefer unexpected answers especially for the HR round.
The overall experience was really good especially because the recruiters were friendly and systematic.
Skills:
College Name: NIT Surathkal

I was interviewed in Aug 2016.

Interview Questionnaire 

7 Questions

  • Q1. Given an array and a number find a pair of integers in the array whose sum is equal to given number.
  • Ans. 

    Find a pair of integers in an array whose sum is equal to a given number.

    • Iterate through the array and for each element, check if the difference between the given number and the current element exists in the array.

    • Use a hash set to store the elements of the array for efficient lookup.

    • Return the pair of integers if found, otherwise return a message indicating no such pair exists.

  • Answered by AI
  • Q2. Find lca of 2 nodes in a binary tree (write pseudocode)
  • Ans. 

    The Lowest Common Ancestor (LCA) of two nodes in a binary tree is the deepest node that is a common ancestor of both nodes.

    • Start from the root node and traverse the tree to find the given nodes.

    • Store the paths from the root to each node.

    • Compare the paths to find the last common node, which is the LCA.

  • Answered by AI
  • Q3. Implement a specialStack class which should support O(1) push O(1) pop and should return minimum element in the stack in O(1) time
  • Ans. 

    Implement a specialStack class with O(1) push, pop, and minimum element retrieval.

    • Use an additional stack to keep track of the minimum element at each step.

    • When pushing an element, compare it with the top of the minimum stack and update if necessary.

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

  • Answered by AI
  • Q4. Explain polymorphism and other OOPS concepts
  • Ans. 

    Polymorphism is the ability of an object to take on many forms. Other OOPS concepts include inheritance, encapsulation, and abstraction.

    • Polymorphism allows objects of different classes to be treated as objects of a common superclass.

    • Inheritance allows a class to inherit properties and methods from another class.

    • Encapsulation is the bundling of data and methods within a class, hiding the internal details.

    • Abstraction foc...

  • Answered by AI
  • Q5. How do you design a website which displays say top 1000 products with product rating updating every second?
  • Ans. 

    To design a website displaying top 1000 products with real-time rating updates, use a combination of backend and frontend technologies.

    • Implement a backend system to fetch and update product ratings from a database or API.

    • Use a frontend framework like React or Angular to create a dynamic user interface.

    • Implement pagination or lazy loading to handle the large number of products.

    • Optimize the website for performance by cac...

  • Answered by AI
  • Q6. Given a million points and a new point P find a point closest to P(you can do preprocessing)
  • Ans. 

    Find the point closest to a given point P among a million points.

    • Preprocess the million points to calculate their distances from P.

    • Store the distances and corresponding points in a data structure.

    • Sort the distances in ascending order.

    • Return the point corresponding to the smallest distance.

  • Answered by AI
  • Q7. Given a function which upon input x returns f(x) write code to evaluate integral a to b f(x)dx (what is the maximum accuracy of your algorithm)

Interview Preparation Tips

Round: Test
Experience: 10 MCQs and 3 programming questions are given.
MCQs included questions asking the outputs of code snippets, algorithmic complexities.
Programming problems are tough.
I was able to solve only 1 problem completely and 1 partially.
Partial score is given for passing some test cases.
Tips: For programming problems code any solution(even brute force) if you are not able to come up with exact solution
Duration: 1 hour
Total Questions: 13

Round: Technical Interview
Experience: I was able to solve all questions.
Tips: Read geeksforgeeks and other blogs for standard problems

Round: Technical Interview
Experience: I couldn't answer 3rd and 4th questions properly but gave some suboptimal solutions.
Tips: Answer multiple solutions trading off time and space complexities

Skills: Programming, Algorithmic Approach To Problem Solving
College Name: IIT Kharagpur

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(5 Questions)

Round duration - 60 minutes
Round difficulty - Medium

The interviewer grilled me completely in Java.

  • Q1. What is the AtomicInteger class in Java?
  • Ans. 

    AtomicInteger is a class in Java that provides atomic operations on integers.

    • It is used for operations that need to be performed atomically, without interference from other threads.

    • Common methods include get(), set(), incrementAndGet(), decrementAndGet(), etc.

    • Example: AtomicInteger count = new AtomicInteger(0); count.incrementAndGet();

  • Answered by AI
  • Q2. Can you explain the Collection Hierarchy in Java?
  • Ans. 

    Collection Hierarchy in Java represents the relationship between various collection interfaces and classes.

    • Collection interface is the root interface in the Collection Hierarchy.

    • List and Set interfaces extend the Collection interface.

    • Map interface is not a subtype of Collection interface.

    • ArrayList, LinkedList, HashSet, and TreeSet are some of the classes that implement the Collection interfaces.

    • HashMap and TreeMap are

  • Answered by AI
  • Q3. What is the internal functioning of a hashmap in Java?
  • Ans. 

    HashMap in Java is a data structure that stores key-value pairs and uses hashing to efficiently retrieve values.

    • HashMap uses an array of buckets to store key-value pairs.

    • The key is hashed to determine the index in the array where the value will be stored.

    • In case of hash collisions, a linked list or a balanced tree is used to store multiple values at the same index.

    • HashMap allows null keys and values.

    • Example: HashMap<...

  • Answered by AI
  • Q4. What is the difference between fail-fast and fail-safe iterators in Java?
  • Ans. 

    Fail-fast iterators throw ConcurrentModificationException if the collection is modified while iterating. Fail-safe iterators do not throw exceptions and operate on a cloned copy of the collection.

    • Fail-fast iterators throw ConcurrentModificationException if the collection is modified while iterating.

    • Fail-safe iterators do not throw exceptions and operate on a cloned copy of the collection.

    • Fail-fast iterators are used in...

  • Answered by AI
  • Q5. What are the different ways you can traverse over a map in Java?
  • Ans. 

    Different ways to traverse over a map in Java include using keySet(), entrySet(), and forEach() method.

    • Use keySet() method to iterate over keys in the map

    • Use entrySet() method to iterate over key-value pairs in the map

    • Use forEach() method to iterate over key-value pairs in the map

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minues
Round difficulty - Medium

Questions based on data structures, OS and system design were asked in this round.

  • Q1. 

    Median of Two Sorted Arrays

    Given two sorted arrays A and B of sizes N and M, find the median of the merged array formed by combining arrays A and B. If the total number of elements, N + M, is even, the m...

  • Ans. 

    Find the median of two sorted arrays by merging them and calculating the median of the combined array.

    • Merge the two sorted arrays into one sorted array.

    • Calculate the median of the merged array based on the total number of elements.

    • If the total number of elements is even, take the mean of the two middle elements as the median.

  • Answered by AI
  • Q2. Design a bus seat booking system.
  • Ans. 

    Design a bus seat booking system.

    • Use a database to store seat availability and bookings

    • Implement a user interface for customers to select and book seats

    • Consider implementing a payment system for reservations

    • Allow for seat selection based on preferences such as window or aisle

  • Answered by AI
  • Q3. What is fragmentation in operating systems?
  • Ans. 

    Fragmentation in operating systems is the phenomenon where memory or disk space is divided into small chunks over time, leading to inefficient use of resources.

    • Fragmentation can occur in both memory (memory fragmentation) and disk space (disk fragmentation).

    • External fragmentation happens when free memory or disk space is broken into small pieces, making it difficult to allocate large contiguous blocks of memory or disk...

  • Answered by AI
  • Q4. What can you tell me about memory management in operating systems?
  • Ans. 

    Memory management in operating systems involves allocation, deallocation, and optimization of memory usage.

    • Memory management is crucial for efficient utilization of system resources.

    • Operating systems use techniques like paging, segmentation, and virtual memory to manage memory.

    • Memory management also involves handling memory leaks, fragmentation, and ensuring data integrity.

    • Examples include malloc() and free() functions

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAIntuit interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Java, OOPSTime required to prepare for the interview - 6 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 interviewRejected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Hard

10 MCQs and 3 programming questions are given.
MCQs included questions asking the outputs of code snippets, algorithmic complexities.
Programming problems are tough.
I was able to solve only 1 problem completely and 1 partially.
Partial score is given for passing some test cases.
Tips: For programming problems code any solution(even brute force) if you are not able to come up with exact solution

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. 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.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q2. 

    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 getMin operation in O(1) time complexity without using extra space.

    • Use two stacks - one to store the actual elements and another to store the minimum values encountered so far.

    • When pushing an element, check if it is smaller than the current minimum and if so, push it onto the minimum stack.

    • When popping an element, check if it is the current minimum and if so, pop from the minimum stack as well.

    • Fo...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical interview round. I was able to solve all questions.

  • Q1. 

    Count Pairs with Given Sum

    Given an integer array/list arr and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.

    Input:

    The first line c...
  • Ans. 

    Count the total number of unique pairs in an array whose elements sum up to a given value.

    • Iterate through the array and for each element, check if the complement (Sum - current element) exists in a hash set.

    • If the complement exists, increment the count of pairs and remove the complement from the set to avoid duplicates.

    • Return the total count of pairs at the end.

  • Answered by AI
  • Q2. Can you explain all the concepts of Object-Oriented Programming (OOP)?
  • Ans. 

    OOP is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.

    • OOP focuses on creating objects that interact with each other to solve problems.

    • Key concepts include encapsulation, inheritance, and polymorphism.

    • Encapsulation involves bundling data and methods that operate on the data into a single unit.

    • Inheritance allows a class to inherit pr...

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Hard

I couldn't answer 3rd and 4th questions properly but gave some suboptimal solutions.
Tips: Answer multiple solutions trading off time and space complexities

  • Q1. Calculate the definite integral of a function within the limits a to b.
  • Ans. 

    Definite integral of a function within given limits a to b.

    • Use the definite integral formula: ∫[a, b] f(x) dx = F(b) - F(a), where F(x) is the antiderivative of f(x).

    • Calculate the antiderivative of the function and then evaluate it at the upper and lower limits.

    • Make sure to check for any discontinuities or singularities within the interval.

    • Example: Calculate ∫[0, 2] x^2 dx = (1/3)x^3 |[0, 2] = (1/3)(2^3) - (1/3)(0^3) =

  • Answered by AI
  • Q2. 

    Closest Distance Pair Problem Statement

    Given an array containing 'N' points in a 2D plane, determine the minimum distance between the closest pair of points.

    Note:
    Distance between two points (x1, y1) ...
  • Ans. 

    The problem involves finding the minimum distance between the closest pair of points in a 2D plane.

    • Iterate through all pairs of points and calculate the distance between them using the given formula.

    • Keep track of the minimum distance found so far.

    • Optimize the solution by using techniques like sorting the points based on x or y coordinates.

  • Answered by AI
  • Q3. How would you design a website that displays the top 1000 products with product ratings that update every second?
  • Ans. 

    Design a website to display top 1000 products with real-time ratings.

    • Utilize a backend server to fetch and update product ratings every second.

    • Implement a front-end framework like React to display the products and ratings dynamically.

    • Use a database to store and retrieve product information efficiently.

    • Consider implementing caching mechanisms to reduce server load.

    • Optimize the website for performance to handle frequent

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAIntuit interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Algorithmic Approach To Problem Solving, OOPSTime required to prepare for the interview - 6 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 interviewRejected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Anaplan Interview FAQs

How many rounds are there in Anaplan interview?
Anaplan interview process usually has 2 rounds. The most common rounds in the Anaplan interview process are Resume Shortlist and Technical.
How to prepare for Anaplan 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 Anaplan. The most common topics and skills that interviewers at Anaplan expect are Recruitment, Adobe, Data Analysis, Back Office and Salesforce.
What are the top questions asked in Anaplan interview?

Some of the top questions asked at the Anaplan interview -

  1. Cloud based platform for analysis and planning of a comp...read more
  2. what is CPM AND ITS USES IN A COMP...read more
  3. What is anap...read more

Recently Viewed

REVIEWS

o9 Solutions

No Reviews

SALARIES

Care Health Insurance

No Salaries

REVIEWS

Bharat Electronics

No Reviews

INTERVIEWS

Wistron

No Interviews

COMPANY BENEFITS

Care Health Insurance

No Benefits

LIST OF COMPANIES

Care Health Insurance

Overview

PHOTOS

Care Health Insurance

No Photos

COMPANY BENEFITS

o9 Solutions

No Benefits

SALARIES

o9 Solutions

No Salaries

LIST OF COMPANIES

o9 Solutions

Overview

Tell us how to improve this page.

Anaplan Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

HCLTech

Workplace transformation starts with you

Interview Questions from Similar Companies

Adobe Interview Questions
3.9
 • 233 Interviews
Salesforce Interview Questions
4.0
 • 221 Interviews
ServiceNow Interview Questions
4.1
 • 120 Interviews
Atlassian Interview Questions
3.6
 • 88 Interviews
Intuit Interview Questions
3.5
 • 77 Interviews
Twilio Interview Questions
3.9
 • 23 Interviews
Workday Interview Questions
4.1
 • 17 Interviews
MongoDB Interview Questions
3.8
 • 14 Interviews
Splunk Interview Questions
4.4
 • 12 Interviews
Zendesk Interview Questions
4.3
 • 2 Interviews
View all

Anaplan Reviews and Ratings

based on 4 reviews

1.8/5

Rating in categories

1.6

Skill development

2.7

Work-life balance

2.1

Salary

1.0

Job security

1.8

Company culture

1.6

Promotions

1.3

Work satisfaction

Explore 4 Reviews and Ratings
Sr. Marketing Analyst

Remote

2-4 Yrs

Not Disclosed

Solution Architect, Supply Chain Management

Mumbai

8-12 Yrs

Not Disclosed

Sales Development Representative

Mumbai

3-4 Yrs

Not Disclosed

Explore more jobs
Solution Architect
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Intelligence Analyst
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Product Support Specialist
3 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Solution Consultant
3 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Anaplan with

Salesforce

4.0
Compare

Workday

4.1
Compare

ServiceNow

4.1
Compare

Zendesk

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