SDE - 1

You are given a board of‘ ‘N’ size. You can roll a dice and jump from position ‘i’ to i + 1, i + 2, i + 3, i + 4, i + 5, and i + 6 respectively. An array ‘connections’ of size ‘M’ is also provided where you can visit from the point ‘connections[i][0]’ to ‘connections[i][1]’ directly. Your task is to find the minimum number of dice rolls to reach from 1 to ‘N’ on the board.

For example:

Consider 'N' = 10, 'connections' = [[2, 10]]

We can go from 1 -> 2 with the help of dice (the number of operations increases by 1).
We can go from 2 -> 10 as 2 is directly connected to 10. No operation is required for this.
Hence the answer is 1.

Ninja is assigned some task to complete in the given intervals. Each interval has a starting point and ending point and is given in the form of a list. But there is an issue with these intervals as some intervals starting point and ending points lie in some other intervals so ninja has to remove such intervals and wants to know the count of remaining intervals.

So your task is to detect such intervals and return the count of remaining intervals in the list after removing such overlapping intervals.

Example:

Let assume the given interval list is ‘[ [ 1, 4 ], [ 5, 10 ], [ 6, 9 ] ] so we return ‘2’ as our answer as the interval [ 6, 9 ] lies in the interval [ 5, 10 ] so we removed  [ 6, 9 ] from the list hence remaining intervals left are ‘2’ so ‘2’ is our answer.

Note:

We can take two intervals even when their starting and ending time are same. For eg: [1,3], [3,5] can be taken together.

You are given a positive integer ‘N’. Your task is to find the total number of ‘1’ in the binary representation of all the numbers from 1 to N.

Since the count of ‘1’ can be huge, you are required to return it modulo 1e9+7.

Note:

Do not print anything, just return the number of set bits in the binary representation of all integers between 1 and ‘N’.

Rapid-fire questions on DBMS, Networking, Operating systems.
What is a deadlock? Different conditions to achieve a deadlock.
Difference between process and program and thread? Different types of process.
Inner and Outer Join
What is normalization ? Types of normalization.
Types of osi layers

You are given an array/list ARR consisting of N integers. Your task is to find the maximum possible sum of a non-empty subarray(contagious) of this array.

Note: An array C is a subarray of array D if it can be obtained by deletion of several elements(possibly zero) from the beginning and the end of array D.

For e.g.- All the non-empty subarrays of array [1,2,3] are [1], [2], [3], [1,2], [2,3], [1,2,3].

Design Ludo Game with a Highly scalable capability.

Why HashedIn 

Team player or lone wolf 

Experience of teamwork 

How do you motivate peers 

A little intro about the company – HashedIn University 

Hobbies and Interests