Add office photos
Engaged Employer

Jupiter Money

3.3
based on 87 Reviews
Filter interviews by

Accenture Interview Questions and Answers

Updated 5 Feb 2024
Popular Designations

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

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.

View 1 answer

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

Ans.

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

Add your answer

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

Ans.

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

Add your answer

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

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.

Add your answer
Discover Accenture interview dos and don'ts from real experiences

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

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.

Add your answer

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

Ans.

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.

Add your answer

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

Ans.

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

Add your answer

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

Ans.

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.

Add your answer

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

Ans.

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

Add your answer
Contribute & help others!
Write a review
Share interview
Contribute salary
Add office photos

Interview Process at Accenture

based on 1 interviews
Interview experience
5.0
Excellent
View more
Interview Tips & Stories
Ace your next interview with expert advice and inspiring stories

Top Interview Questions from Similar Companies

3.7
 • 3k Interview Questions
3.5
 • 435 Interview Questions
3.8
 • 211 Interview Questions
4.2
 • 179 Interview Questions
3.8
 • 150 Interview Questions
4.5
 • 138 Interview Questions
View all
Top Jupiter Money Interview Questions And Answers
Share an Interview
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
75 Lakh+

Reviews

5 Lakh+

Interviews

4 Crore+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter