SDE - Intern

How likely you would do the task given to you with full dedication?

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 a string 'S'. Your task is to partition 'S' such that every substring of the partition is a palindrome. You need to return all possible palindrome partitioning of 'S'.

Note: A substring is a contiguous segment of a string.

For Example:

For a given string “BaaB”
3 possible palindrome partitioning of the given string are:
{“B”, “a”, “a”, “B”}
{“B”, “aa”, “B”}
{“BaaB”}
Every substring of all the above partitions of “BaaB” is a palindrome.

You are given an array arr of N positive integers, where arr[i] represents the number of products available from the i-th supplier. You are also given a positive integer M, which is the total number of products you must sell.

The profit gained from selling a single product from a supplier is equal to the number of products that supplier currently has. Each time you sell a product from a supplier, their count of available products decreases by one.

Your task is to find the maximum possible profit you can achieve by selling exactly M products.

You are given the ratings of n coders in an array. To create effective teams, you want to form pairs of coders who have similar ratings. The strategy is to sort all the coders by their rating and then pair up adjacent coders.

Your task is to determine if it's possible to pair up all n coders. This is only possible if n is an even number.

If n is even, you must sort the ratings and form n/2 pairs from adjacent elements. Return a list of these pairs.

If n is odd, it's impossible to pair up everyone. In this case, you should indicate that pairing is not possible.