HexaView Technologies Software Developer Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Hard

Q1. 
Wildcard Pattern Matching Problem Statement
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
The wildcard pattern may include the...read more
Ans. 
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

• Keep track of the current position in both pattern and text strings

• Return 'True' if the pattern matches the text completely, otherwise return 'False'
Answered by AI
Add your answer
Q2. 
Time to Burn Tree Problem
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...read more
Ans. 
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
• Traverse the tree to find the start node and calculate the time for fire to spread to all nodes.

• Use a queue to keep track of nodes to be burnt next.

• Increment time for each level of nodes burnt until the entire tree is burnt.
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy