Software Engineer

For a given integer array/list 'ARR' of size 'N' containing all distinct values, find the total number of 'Inversions' that may exist.

An inversion is defined for a pair of integers in the array/list when the following two conditions are met.

A pair ('ARR[i]', 'ARR[j]') is said to be an inversion when:

1. 'ARR[i] > 'ARR[j]' 
2. 'i' < 'j'

Where 'i' and 'j' denote the indices ranging from [0, 'N').

You are given an unweighted directed graph having 'V' vertices and 'E' edges. Your task is to count the number of strongly connected components (SCCs) present in the graph.

A directed graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly connected components of a graph are the subgraphs which are themselves strongly connected.

Note :

Use zero-based indexing for the vertices.

The given graph doesn’t contain any self-loops.

You are given a number N. You need to find the remainder when N is divided by 11.

Note :

Number N may be very large.

Given a sentence(in the form of an array of words), and an integer ‘L’, return an array of strings i.e a paragraph such that each line has exactly ‘L’ characters, and is left and right justified.

Justification of text means that space is added between words so that both edges of each line are aligned with both margins. The last line in the paragraph is aligned left.

One needs to add the maximum number of words in a line such that the number of lines is minimised.

We can add whitespaces in a line so that each line has exactly the same number of characters i.e L.

If the number of spaces on a line does not divide evenly between words, the empty slots on the left will be assigned more spaces than the slots on the right.

For the last line of text, it should be left justified and no extra space is inserted between words.

For example:

Let the given sentence be: [ “what”, “must”, “be”, “shall”, “be.”]
And L=12.

The justified output will be :

[ “what must be”
“Shall be.”       ]

Note that the last line is only left justified.

In a laundry, it happens often that people forget to take their money out of their pockets and the money is washed with the clothes. The laundry man simply takes these wet notes out and puts them sequentially under the sunlight to dry them. He does not mix them up, for example, if he gets 3 notes from one cloth, he placed them sequentially and the places the notes received from other clothes and so on. Shane forgot some money in his trousers and gave his clothes to the laundry man, afterwards, when he realized his mistake, he got back to the laundry and asked for his money. You have to tell the number of notes he forgot in his trousers if he knows the exact amount he forgot in his trouser.