Automation Anywhere Software Engineer Interview Questions and Answers

Implement stack data structure

• Use an array or linked list to store elements

• Push operation adds element to top of stack

• Pop operation removes element from top of stack

• Peek operation returns top element without removing it

Global variables are accessible from any part of the program and can be modified by any function.

• Global variables are declared outside of any function.

• They can be accessed and modified by any function in the program.

• If a function modifies the value of a global variable, the new value is visible to all other functions.

• Global variables can be useful for sharing data between functions.

• However, overuse of global variables

Program to transpose a matrix

• Iterate through rows and columns of the matrix

• Swap the elements at (i,j) and (j,i) positions

• Return the transposed matrix

Pre and post fix operators are used to increment or decrement a value before or after it is used in an expression.

• Pre-fix operator (++x) increments the value of x and returns the new value.

• Post-fix operator (x++) returns the value of x and then increments it.

• Both operators can be used with variables of numeric data types.

• They can also be used with pointers to increment or decrement the memory address they point to.

Find common ancestor of 2 nodes in a binary tree

• Traverse the tree from root to both nodes and store the paths

• Compare the paths to find the last common node

• Use recursion to traverse the tree and find the common ancestor

To find the minimum element of a stack in O(1) time, maintain a separate stack for minimum values.

• Create a separate stack to store minimum values

• Push the minimum value onto the minimum stack every time a new value is pushed onto the main stack

• Pop the minimum stack every time the main stack pops a value

• The top of the minimum stack will always contain the minimum value

Sort a binary array of 0s and 1s and optimize the code.

• Use two pointers approach to swap 0s and 1s

• Avoid using sorting algorithms like bubble sort or selection sort

• Use a single loop to traverse the array and swap elements

• Use XOR operation to swap elements

Explaining Java HashMap internals and behavior when hashcode always returns 1.

• HashMap uses hashcode to calculate the index of the bucket where the key-value pair will be stored.

• If hashcode always returns 1, all key-value pairs will be stored in the same bucket resulting in poor performance.

• In this case, HashMap will use a linked list to store multiple key-value pairs in the same bucket.

• Retrieving a value from a HashMap...read more