Noon Academy Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

Problem Solving and coding interview. Friendly interviewer.

Q1. 
Merge Two Binary Max Heaps Problem Statement
You are given two integer arrays Arr1 and Arr2 of sizes N and M respectively. Both Arr1 and Arr2 represent Max-Heaps. Your task is to merge these two arrays wh...read more
Ans. 
Merge two Max-Heap arrays while retaining order and construct the merged Max-Heap.
• Merge the two arrays while maintaining their respective order.

• Construct the Max-Heap obtained after merging the arrays.

• Ensure the final Max-Heap is valid based on the given heaps.
Answered by AI
Add your answer
Q2. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
Determine if two strings are anagrams of each other.
• Create character frequency maps for both strings

• Compare the frequency of characters in both maps

• Return True if the frequency maps are equal, else False
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

General round of interview. Questions based on resume (very few).
Behavioural Round

Q1. 
Log Cutting Minimum Moves Calculation
Ninja, the log cutter, has 'K' axes and an infinite amount of logs. Using a log cutting stand with a capacity 'N', he can attempt to cut at most 'N' logs at a time. A...read more
Ans. 
Yes, this problem can be solved with a worst-case time complexity of N^1/3.
• Use binary search to find the maximum number of logs an axe can cut without breaking.

• Divide the search space into three parts: low, mid, and high.

• Check if the mid value is feasible, if yes, move to the left half, else move to the right half.

• Repeat the process until the optimal value is found.

• Example: For K=2 and N=6, the minimum number of moves
Answered by AI
Add your answer