Emkay Global Financial Services Interview Questions and Answers

Check if a substring in an array of strings is a palindrome or not.

• Iterate through each string in the array

• For each string, check if any of its substrings are palindromes

• Return true if a palindrome substring is found, false otherwise

Reverse a linked list recursively

• Create a recursive function to reverse the linked list

• Pass the current node and its next node as parameters

• Update the next pointer of the current node to point to the previous node

Check if two stacks are equal by comparing each element in the stacks

• Pop elements from both stacks and compare them one by one

• If the sizes of the stacks are different, they are not equal

• If any element in the stacks is different, they are not equal

Use Dijkstra's algorithm to find the shortest path in a graph

• Implement Dijkstra's algorithm to find the shortest path between two nodes in a graph

• Maintain a priority queue to keep track of the shortest distance to each node

• Update the shortest distance to each node as you traverse the graph

• Track the path by storing the previous node for each node visited

To add two linked lists, iterate through both lists simultaneously and add corresponding nodes, considering carry from previous addition.

• Create a dummy node to hold the result.

• Initialize current node to dummy node.

• Iterate through both lists, adding values and carry from previous addition.

• Move to next nodes in both lists.

• Handle cases where one list is longer than the other.

• Handle final carry if present.