Software Engineer

You are supposed to write production-ready code with proper unit test cases, modularization, etc. You need to write your test cases under the user package in the test folder. One sample test is created under the same package for reference. Your code will be evaluated based on the following:

A weird array is an array in which there exists a weird number x, and the size of the array is at least 2. A number x is weird if the count of x is greater than the count of any other element in the array. For example, [1, 2, 1, 3, 3, 4, 1, 2] is a weird array with 1 as the weird number (x).

Find the minimum size of the weird subarray or return 0 if no such subarray exists.

Constraints: 1<n<2×1051 < n < 2 \times 10^51<n<2×105

Function description: Complete the function 'weird_array' in the code. The function must return the minimum size of the weird subarray or return 0 if no subarray exists.

'weird_array' has the following parameter(s):

• input: a list of numbers
• n: length of the list or array

EXAMPLES:

Input: [3, 3, 1, 3, 3] Output: 2 Explanation: [3, 3] is the minimum subarray possible.

Input: [5] Output: 0

Ninja has been given two sparse matrices ‘MAT1’ and ‘MAT2’ of integers having size ‘N’ x ‘M’ and ‘M’ x ‘P’, respectively.

A sparse matrix is a matrix that contains very few non-zero elements.

Ninja has to find the matrix formed by the multiplication of ‘MAT1’ and ‘MAT2’. As Ninja is busy with some other tasks so he needs your help. Can you help Ninja to find the matrix formed by the multiplication of ‘MAT1’ and ‘MAT2’?

Note: The number of columns in ‘MAT1’ i.e ‘M’ is equal to the number of rows in ‘MAT2’ i.e ‘M’. It means we can always multiply ‘MAT1’ with ‘MAT2’.

For example:

For the ‘MAT1’ and ‘MAT2’ given below, ‘MAT3’ is the matrix formed by multiplying ‘MAT1’ and ‘MAT2’. 

1. MAT3[0][0] = MAT1[0][0] * MAT2[0][0] + MAT1[0][1] * MAT2[1][0]  ie. 2 * 1 + 1 * 4 = 6
2. MAT3[1][0] = MAT1[1][0] * MAT2[1][0] + MAT1[1][1] * MAT2[1][0] ie. 0 * 6 + 0 * 4 = 0

You will be given ‘Q’ queries. You need to implement a queue using two stacks according to those queries. Each query will belong to one of these three types:

1 ‘X’: Enqueue element ‘X’  into the end of the nth queue. Returns true after the element is enqueued.

2: Dequeue the element at the front of the nth queue. Returns -1 if the queue is empty, otherwise, returns the dequeued element.

Note:

Enqueue means adding an element to the end of the queue, while Dequeue means removing the element from the front of the queue.

Given a Binary Tree, return its left view.

The Left View of a Binary Tree is a list of nodes that can be seen when the tree is viewed from the left side.
Example 1:
Input: Binary Tree: 1 2 3 4 10 9 11 -1 5 -1 -1 -1 -1 -1 -1 -1 6

Output: Left View: [1, 2, 4, 5, 6]

Given the time in hours and minutes, you need to calculate the angle between the hour hand and the minute hand.

Note :

There can be two angles between the hour hand and minute hand, you need to print a minimum of two. Also, print the floor value of angle i.e. if the angle is 15.2, you need to print 15.

Given an array of string words, return the smallest string that contains each string in words as a substring. If there are multiple valid strings of the smallest length, return any of them.

You may assume that no string in words is a substring of another string in words.

Example 1:

Input: words = ["catg","ctaagt","gcta","ttca","atgcatc"]
Output: "gctaagttcatgcatc"

1. Introduce yourself.
2. Preferred location.
3. Any other offers I have?
4. Your Strengths and Weaknesses.
5. HR told me about the company and what services they are providing briefly.