Ques1: There is a big file of words which is dynamically changing. We are continuously adding some words into it. How would you keep track of top 10 trending words at each moment? Ques2:Write a function that returns the length of the longest leaf-to-leaf path in a binary tree. Ques3:There is a N*N integer matrix Arr[N][N]. From the row r and column c, we can go to any of the following three indices: I. Arr[ r+1 ][ c-1 ] (valid only if c-1=0) II. Arr[ r+1 ][ c ] III. Arr[ r+1 ][ c+1 ] (valid only if c+1

Question

Ques1: There is a big file of words which is dynamically changing. We are continuously adding some words into it. How would you keep track of top 10 trending words at each moment? Ques2:Write a function that returns the length of the longest leaf-to-leaf path in a binary tree. Ques3:There is a N*N integer matrix Arr[N][N]. From the row r and column c, we can go to any of the following three indices: I. Arr[ r+1 ][ c-1 ] (valid only if c-1>=0) II. Arr[ r+1 ][ c ] III. Arr[ r+1 ][ c+1 ] (valid only if c+1

Accepted Answer

The first question is about keeping track of top 10 trending words in a dynamically changing file. The second question is about finding the length of the longest leaf-to-leaf path in a binary tree. The third question is about navigating through an integer matrix.

For the first question, you can use a data structure like a priority queue or a hash map to keep track of the word frequencies and update the top 10 trending words accordingly.
For the second question, you can use a recursive function to traverse the binary tree and keep track of the longest leaf-to-leaf path.
For the third question, you can use a recursive function to explore all possible paths from a given position in the matrix.