Jagdamba Trailers Interview Questions and Answers

Calculate the minimum number of left shift operations needed to achieve the longest common prefix between two strings.

• Apply left shift operations to string B to find the longest common prefix with string A

• Count the number of left shifts needed to achieve the longest common prefix

• Return the minimum number of left shift operations for each test case

Find the length of the longest subarray with zero sum in an array of integers.

• Iterate through the array and keep track of the running sum using a hashmap.

• If the running sum is seen before, the subarray between the current index and the previous index with the same sum is a subarray with zero sum.

• Update the length of the longest subarray with zero sum as you iterate through the array.

• Example: For arr1 = [1, -1, 3, 2, -2, -3, 3], the longest subarray with zero sum is [3, 2, -2,...read more

Given a string, find the frequency of each character from 'a' to 'z' in the string.

• Create an array of size 26 to store the frequency of each character from 'a' to 'z'.

• Iterate through the string and increment the count of the corresponding character in the array.

• Print the array of frequencies as the output for each test case.

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

• Create a stack using two queues internally

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

• Handle edge cases such as empty stack or invalid data

• Ensure the stack functions work correctly and efficiently

• Test the implementation with sample inputs and outputs

Find the length of the longest consecutive sequence in an unsorted array of integers.

• Iterate through the array and store each element in a set for constant time lookup.

• For each element, check if it is the start of a sequence by looking for its previous number in the set.

• Update the length of the current consecutive sequence and track the longest sequence found so far.

• Return the length of the longest consecutive sequence.

• Example: Input [9,5,4,9,10,10,6], Output: 3 (Longest cons...read more

Calculate the total amount of rainwater that can be trapped between given elevations in an elevation map.

• Iterate through the array to find the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped above each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water above each bar to get the total trapped water for the elevation map.

Print the left view of a binary tree, containing nodes visible from the left side.

• Traverse the tree in a level order manner and print the first node at each level.

• Use a queue to keep track of nodes at each level.

• Handle null nodes represented by -1 in the input.

SQL query to find the second highest salary

• Use the ORDER BY clause to sort the salaries in descending order

• Use the LIMIT clause to limit the result to the second row

• Use a subquery to exclude the highest salary from the result