10+ Asian Contec Interview Questions and Answers

The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.

• Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks at different points.

• Keep track of the maximum profit that can be achieved by considering all possible combinations of buy and sell transactions.

• Ensure that you sell the stock before you can buy again to adhere to th...read more

Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

• Traverse the left boundary nodes in top-down order

• Traverse the leaf nodes in left-right order

• Traverse the right boundary nodes in bottom-up order

• Handle cases where duplicates occur in boundary nodes

Calculate the number of bit flips required to convert one number to another in binary representation.

• Convert both numbers to binary representation

• Count the number of differing bits between the two numbers

• Output the count of differing bits as the number of bit flips required

• Example: A = 13 (1101), B = 7 (0111) -> 2 bit flips required

Reverse a linked list in groups of size K by reversing nodes in each group.

• Iterate through the linked list in groups of size K

• Reverse each group of nodes

• Handle cases where the number of elements in the last group is less than K

Find the maximum profit from buying and selling a stock given an array of its values.

• Iterate through the array and keep track of the minimum value seen so far.

• Calculate the profit at each index and update the maximum profit seen.

• Return the maximum profit.

Count the number of flips required to convert a binary string to alternate 0 and 1.

• Iterate through the string and count the number of flips required to make it alternate.

• Keep track of the current character and the expected character.

• Example: 001101 -> 010101 requires 2 flips.

• Example: 101010 -> 010101 requires 3 flips.

Reverse a linked list in groups of k nodes.

• Divide the linked list into groups of k nodes

• Reverse each group of k nodes

• Connect the reversed groups to form the final linked list

• Use recursion or iteration to implement the solution

Boundary traversal of a tree

• Boundary traversal involves visiting the nodes on the boundary of a tree in a specific order

• Start with the root node and traverse the left boundary, then the leaf nodes from left to right, and finally the right boundary

• Use recursion to traverse the left and right subtrees

• Exclude the leaf nodes that are also part of the left or right boundary

Implement binary search algorithm to find a target string in a sorted array of strings.

• Ensure the array of strings is sorted before performing binary search.

• Compare the target string with the middle element of the array and adjust the search range accordingly.

• Repeat the process until the target string is found or the search range is exhausted.