Software Engineer

What is the time complexity of search in Heap data structure? (Learn)

Which of the following is true about linked list implementation of stack?
A) In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.
B) In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.
C) Both of the above
D) None of the above

Which one of the following is an application of Queue Data Structure?
A) When a resource is shared among multiple consumers.
B) When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes
C) Load Balancing
D) All of the above

Which sorting algorithms can be used to sort a random linked list with minimum time complexity?
A)Insertion Sor
B)Quick Sort
C)Heap Sort
D)Merge Sort

You are given a 2-dimensional array/list having N rows and M columns, which is filled with ones(1) and zeroes(0). 1 signifies land, and 0 signifies water.

A cell is said to be connected to another cell, if one cell lies immediately next to the other cell, in any of the eight directions (two vertical, two horizontal, and four diagonals).

A group of connected cells having value 1 is called an island. Your task is to find the number of such islands present in the matrix.

You are given a list of a repeated set of integers. Your task for the problem is to return a list of the given elements in decreasing sorted order of their frequency of repetition in the given list with the element with the highest frequency of repetition first and so on.

Note :

If two numbers have the same frequency then keep the one that was present before the other in the original given list (array) first.

For Example :

Input:  arr[] = {2, 5, 2, 8, 5, 6, 8, 8}
Output: arr[] = {8, 8, 8, 2, 2, 5, 5, 6}

Explanation :
When you sort the array based on the decreasing order of the frequency of repetition of integers in the original array, 
you’ll find that the element ‘8’ is the integer with the most repeated values therefore it would be arranged first after which since both 2 and 5 have the same number of repeated 
values in the original array but since the 2 arrived first so we will first arrange 2 and then 5 in our resultant array, while would be the last element after sorting here.

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 have been given a Binary Tree of 'N'

nodes, where the nodes have integer values.

Your task is to return the ln-Order, Pre-Order, and Post-Order traversals of the given binary tree.

For example :

For the given binary tree:

The Inorder traversal will be [5, 3, 2, 1, 7, 4, 6].
The Preorder traversal will be [1, 3, 5, 2, 4, 7, 6].
The Postorder traversal will be [5, 2, 3, 7, 6, 4, 1].

You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair equals 'S'.

Note:

Each pair should be sorted i.e the first value should be less than or equals to the second value. 

Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.

How many threads are there in my project? (Learn)

What are the phases of the software development life cycle? (Learn)

What is the difference between white box testing and black box testing? (Learn)

What are your regrets in life?

Smart work vs. Hard work

What is the ideal work place for you?

How do you match the job description?

How did you upgrade your skills during the pandemic?