Associate Software Engineer

You are given an integer ‘N’. Your task is to print the following pattern for the ‘N’ number of rows.

For Example:

Pattern for ‘N’ = 5:

The dots represent spaces.

Note:

‘N’ is always odd.

Given two hourglasses of 4 minutes and 7 minutes, the task is to measure 9 minutes.

A car has four tires and one spare tire. Each tire can travel a maximum distance of 20,000 km before wearing out. What is the maximum distance the car can travel before you are forced to buy a new tire? You are allowed to change tires (using the spare tire) an unlimited number of times.

• What are the new features of HTML5 and CSS3?
• What is the "!important" keyword in CSS?
• What is the difference between "display: none" and "visibility: hidden" when used as CSS properties for an HTML element?
• What is the difference between the link tag and the anchor tag?

In-depth discussion of the projects mentioned in the resume.

Difference between an Array and an ArrayList. (Learn)

There is a room with a closed door and three light bulbs inside. Outside the room, there are three switches connected to the bulbs. You may manipulate the switches as you wish, but once you open the door, you cannot change them. All bulbs are in working condition, and you can open the door only once. Identify each switch corresponding to its bulb.

You are blindfolded, and 10 coins are placed in front of you on the table. You are allowed to touch the coins but cannot determine which side is facing up by feel. You are told that 5 coins are heads up and 5 coins are tails up, but you do not know which ones.

Can you create two piles of coins, each with the same number of heads up? You may flip the coins any number of times.

Queue is a linear data structure that follows the idea of First In First Out. That means insertion and retrieval operations happen at opposite ends.

Implement a simple queue using arrays.

You are given 'query' queries which are either of the 2 types:

1 'e': Enqueue (add) element ‘e’ at the end of the queue.

2: Dequeue (retrieve) the element from the front of the queue. If the queue is empty, return -1.

Example:

Input: Queries: 
             [ 1 2,
               1 7,
               2,
               1 13, 
               2, 
               2, 
               2 ]

Output:
         [ 2, 
           7, 
           13,  
           -1 ]

Explanation: After each operation, our queue is equal to the following:
1 2: {2}
1 7: {2, 7}
2: {7} and 2 is printed
1 13: {7, 13}
2: {13} and 7 is printed
2: {} and 13 is printed
2: {} and -1 is printed since the queue is empty.

Given a singly linked list of 'N' nodes. The objective is to determine the middle node of a singly linked list. However, if the list has an even number of nodes, we return the second middle node.

Note:

1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.

You are given an array ‘ARR’ consisting of ‘N’ strings. Your task is to find the longest common prefix among all these strings. If there is no common prefix, you have to return an empty string.

A prefix of a string can be defined as a substring obtained after removing some or all characters from the end of the string.

For Example:

Consider ARR = [“coding”, ”codezen”, ”codingninja”, ”coders”]
The longest common prefix among all the given strings is “cod” as it is present as a prefix in all strings. Hence, the answer is “cod”.