SDE - 1

You are given an array consisting of 'N' positive integers where each integer is either 0 or 1 or 2. Your task is to sort the given array in non-decreasing order.

Note :

1. The array consists of only 3 distinct integers 0, 1, 2.
2. The array is non-empty.

Given two 1-dimensional arrays containing strings of lowercase alphabets, print the elements that are common in both the arrays i.e. the strings that are present in both the arrays.

Note:

An element of one array can be mapped only to one element of the array. For example :

Array 1 = {“ab”, “dc”, “ab”, “ab”}
Array 2 = {“dc”, “ab”, “ab”} 

The common elements for the above example will be “dc”, “ab”, and “ab”. 

Ninja loves cherry biscuits. He brings a packet of biscuits from a shop which contains ‘N’ biscuits. The number of cherries present in each biscuit is given in an array ‘A’.

Ninja likes a biscuit only if the number of cherries in that biscuit is strictly greater than ‘K’.

Can you tell the number of biscuits Ninja likes?

Example :

N = 3 
K = 5
A = [ 1, 6, 7 ]

Biscuit 1 : Since there is only 1 cherry in this biscuit which is not greater than ‘K’, Ninja doesn’t like this biscuit.

Biscuit 2 : Since there are 6 cherries in this biscuit which is greater than ‘K’, Ninja likes this biscuit.

Biscuit 3 : Since there are 7 cherries in this biscuit which is greater than ‘K’, Ninja likes this biscuit.

Hence, Ninja likes 2 biscuits from this packet.

You are given the schedule of 'N' meetings with their start time 'Start[i]' and end time 'End[i]'.

You have only 1 meeting room. So, you need to return the maximum number of meetings you can organize.

Note:

The start time of one chosen meeting can’t be equal to the end time of the other chosen meeting.

For example:

'N' = 3, Start = [1, 3, 6], End = [4, 8, 7].

You can organize a maximum of 2 meetings. Meeting number 1 from 1 to 4, Meeting number 3 from 6 to 7.

Given a binary tree of N nodes and a node of this tree, you need to return a list containing the values of the cousins of the given node in the given binary tree sorted by non-decreasing order of their values.

Note:

Two nodes of a binary tree are cousins if they have the same depth or level, but have different parents.

No two nodes in the given binary tree will have the same data values.

Example :

You are a student of Netaji Subhas Institute of Technology. You have to take ‘N’ number of courses labelled from 1 to N to complete your B.Tech Degree.

Some courses may have prerequisites, for example, to take course 1 you have to first take course 2, which is expressed as a pair: [1, 2]. Now, your task is to find is it possible for you to finish all courses.

Note: There are no duplicate pairs in the prerequisites array.

For example-

If N = 2 and prerequisite = [[1, 2]]. Then, there are a total of 2 courses you need to take. To take course 1 you need to finish course 2. So, it is possible to complete all courses. 

• Introduce yourself
• Challenges faced, things learned in previous work experience
• Describe your project

Define Paging