Advenser Engineering Services Interview Questions and Answers

Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.

• Create a recursive function to match the pattern with the text character by character.

• Handle cases for '?' and '*' characters in the pattern.

• Use dynamic programming to optimize the solution.

• Check for edge cases like empty pattern or text.

Implement a function to calculate maximum subarray sum queries in a given range of an array.

• Iterate through each query and calculate the maximum subarray sum within the specified range using Kadane's algorithm.

• Keep track of the maximum sum found so far and update it as needed.

• Return the maximum subarray sum for each query in the test case.

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 edge cases like negative integers and duplicates.

The task is to find the length of the longest common subsequence between two given strings.

• Implement a function to find the longest common subsequence length.

• Use dynamic programming to solve the problem efficiently.

• Iterate through the strings to find the common subsequence.

• Handle edge cases like empty strings or equal strings.

• Example: For input 'abcde' and 'ace', the longest common subsequence is 'ace' with a length of 3.

Detect and remove loop in a singly linked list with O(n) time complexity and O(1) space complexity.

• Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

• Once the loop is detected, use two pointers to find the start of the loop.

• Adjust the pointers to remove the loop and return the modified linked list.

• Example: For input 5 2 and elements 1 2 3 4 5, output should be 1 2 3 4 5.

Return the level order traversal of a binary tree given in level order with null nodes represented by -1.

• Create a queue to store nodes for level order traversal

• Start with the root node and add it to the queue

• While the queue is not empty, dequeue a node, print its value, and enqueue its children

• Repeat until all nodes are traversed in level order

Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.

• Use a single scan over the array to sort it in-place.

• Maintain three pointers for 0s, 1s, and 2s and swap elements accordingly.

• Example: Input: [0, 2, 1, 2, 0], Output: [0, 0, 1, 2, 2]

A deadlock in DBMS occurs when two or more transactions are waiting for each other to release locks, causing them to be stuck indefinitely.

• Deadlock is a situation where two or more transactions are unable to proceed because each is waiting for the other to release locks.

• To prevent deadlocks, DBMS uses techniques like deadlock detection and prevention algorithms.

• Joins in DBMS are used to combine rows from two or more tables based on a related column between them.

• Queries in DBM...read more