Jupiter Money
Accenture Interview Questions and Answers
Q1. Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the number of te...read more
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where the array has less than 3 elements separately.
Consider using a set to ensure distinct elements in the array.
Q2. Longest Palindromic Substring Problem Statement
You are provided with a string STR
of length N
. The goal is to identify the longest palindromic substring within this string. In cases where multiple palindromic ...read more
Identify the longest palindromic substring in a given string.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found
Return the longest palindromic substring with the smallest start index
Q3. Ninja and Geometry Problem Statement
In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two points P ...read more
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
Implement a function to calculate the intersection point of two lines on a 2D plane
Handle precision up to six decimal places in the output
Return -1.000000 -1.000000 if the lines do not intersect
Ensure the lines 'AB' and 'PQ' are distinct
Q4. Partial BST Problem Statement
Check if a given binary tree is a Partial Binary Search Tree (BST). A Partial BST adheres to the following properties:
- The left subtree of a node contains only nodes with data les...read more
Check if a binary tree is a Partial Binary Search Tree (BST) based on specific properties.
Traverse the tree in level order and check if each node satisfies the properties of a Partial BST.
Use recursion to check if the left and right subtrees are also Partial BSTs.
Compare the data of each node with its children to ensure the BST properties are maintained.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the output should be true.
Q5. Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Output:
137
E...read more
Find the maximum sum of any contiguous subarray within an array of integers.
Iterate through the array and keep track of the maximum sum of subarrays encountered so far.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Handle cases where all elements are negative by returning the maximum element in the array.
Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.
Q6. Odd Occurrence Element Problem Statement
Given an array of integers where each element appears an even number of times except for one element which appears an odd number of times, find the element that appears ...read more
Find the element that appears an odd number of times in an array of integers.
Iterate through the array and use XOR operation to find the element that appears odd number of times.
Keep a count of occurrences of each element using a hashmap.
Return the element that has an odd count of occurrences.
Q7. Shortest Path in an Unweighted Graph
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road conne...read more
Implement a function to find the shortest path in an unweighted graph from a given start house to a destination house.
Use Breadth First Search (BFS) algorithm to find the shortest path in an unweighted graph.
Maintain a queue to explore neighboring houses and keep track of visited houses to avoid revisiting them.
Return the path once the destination house is reached.
Example: For input N=8, M=9, S=1, T=8 and roads (1, 2), (1, 3), (2, 4), (2, 5), (3, 6), (3, 8), (4, 7), (5, 8), (...read more
Q8. Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
Input:...read more
Merge two sorted linked lists into a single sorted linked list.
Create a new linked list to store the merged result.
Iterate through both input linked lists simultaneously, comparing and adding nodes to the result list.
Handle cases where one list is empty or both lists are empty.
Ensure the final merged list is sorted in ascending order.
Use constant space complexity and linear time complexity for the solution.
Q9. Capture Region Problem Statement
You are given a matrix having N
rows and M
columns. Each cell of the matrix contains either 'X' or 'O'. Your task is to flip all the regions of 'O' that are completely surrounde...read more
Given a matrix with 'X' and 'O', flip all 'O' regions completely surrounded by 'X' to 'X'.
Iterate through the matrix and identify 'O' regions completely surrounded by 'X'.
Use DFS/BFS to mark all 'O's in the surrounded region.
Update the matrix by flipping all marked 'O's to 'X'.
Interview Process at Accenture
Top Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month