10+ Accenture Interview Questions and Answers

The problem involves calculating the minimum number of partitions needed to ensure every resulting substring is a palindrome.

• Iterate through the string and check for palindromes at each possible partition point.

• Keep track of the minimum cuts needed to partition the string into palindromic substrings.

• Consider edge cases such as when the string is already a palindrome or when all characters are unique.

• Example: For input 'AACCB', the valid partition 'A | A | CC | B' requires 2 c...read more

Find all leaders in a sequence - elements greater than all elements to their right.

• Iterate from right to left, keep track of maximum element encountered so far

• If current element is greater than maximum, it is a leader

• Return the leaders in the same order as the input sequence

Implement a function to return elements of a matrix in spiral order.

• Iterate through the matrix in a spiral order by adjusting the boundaries of rows and columns.

• Keep track of the direction of traversal (right, down, left, up) to properly move through the matrix.

• Handle edge cases such as when the matrix is empty or has only one row or column.

Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.

• Traverse the linked list using two pointers, one moving at double the speed of the other.

• If the two pointers meet at any point, there is a cycle in the linked list.

• Use Floyd's Cycle Detection Algorithm for efficient detection.

• Example: Input: 3 2 0 -4 -1, 1 Output: true

Check if two strings are anagrams of each other by comparing the sorted characters.

• Sort the characters of both strings and compare them.

• Use a dictionary to count the occurrences of characters in each string.

• Ensure both strings have the same length before proceeding.

• Handle edge cases like empty strings or strings with different lengths.

• Example: str1 = 'listen', str2 = 'silent' should return True.

Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.

• Traverse the binary tree in a recursive manner.

• Swap the left and right children of each non-leaf node.

• Continue this process until all nodes are visited.

• Output the inorder traversal of the mirror tree.

Given an encrypted string with repeated substrings represented by counts, find the K'th character of the decrypted string.

• Parse the encrypted string to extract substrings and their counts

• Iterate through the decrypted string to find the K'th character

• Handle cases where counts are more than one digit or in parts

Implement a queue using only stack data structures, supporting FIFO principle.

• Use two stacks to simulate a queue: one for enqueueing and one for dequeueing.

• For enQueue operation, push elements onto the enqueue stack.

• For deQueue operation, if dequeue stack is empty, transfer elements from enqueue stack.

• For peek operation, return top element of dequeue stack.

• For isEmpty operation, check if both stacks are empty.

Implement a stack using two queues to store integer values with specified functions.

• Create a stack class with two queue data members.

• Implement push, pop, top, size, and isEmpty functions.

• Ensure proper handling of edge cases like empty stack.

• Use queue operations like enqueue and dequeue to simulate stack behavior.

• Maintain the size of the stack and check for emptiness.

• Example: Push 42, pop to get 42, push 17, top to get 17.