NSE.IT Interview Questions and Answers

Merge K sorted arrays into a single sorted array.

• Iterate through all arrays and merge them into a single array.

• Use a min heap to efficiently merge the arrays.

• Implement a custom comparator function for the min heap.

• Time complexity can be optimized to O(N log K) using min heap.

Use a data structure like a hash table to store contacts in a phone book.

• Use a hash table to store contacts with keys as names and values as contact information

• Each contact entry can be a structure containing fields like name, phone number, email, etc.

• Implement functions for adding, deleting, searching, and updating contacts in the phone book

Find the maximum area of a square in a binary matrix.

• Iterate through the matrix and for each cell, calculate the maximum square area that can be formed with that cell as the top-left corner.

• Use dynamic programming to store the maximum square area at each cell.

• Keep track of the maximum area encountered so far and return it as the result.

Find longest increasing sequence in a matrix

• Iterate through each element in the matrix

• For each element, check its neighbors to find the longest increasing sequence

• Keep track of the longest sequence found so far

Find the index after which a number repetition starts in an infinite array stream.

• Iterate through the array stream and keep track of the numbers encountered.

• Once a number is repeated, return the index of the first occurrence of the repeated number.

• Use a hash set or a dictionary to efficiently check for duplicates.

HTML tags are used to define the structure and content of a web page.

• HTML tags are enclosed in angle brackets, like <tag>.

• They are used to define elements such as headings, paragraphs, images, links, etc.

• Attributes can be added to tags to provide additional information or styling.

• Example: <h1>This is a heading</h1>