EDG-Intern

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').

• 1) Garbage Collection in Java is a process by which the programs perform memory management automatically.
  
  2) The Garbage Collector(GC) finds the unused objects and deletes them to reclaim the memory. I
  
  3) In Java, dynamic memory allocation of objects is achieved using the new operator that uses some memory and the
  memory remains allocated until there are references for the use of the object.
  
  4) When there are no references to an object, it is assumed to be no longer needed, and the memory, occupied by
  the object can be reclaimed.
  
  5) There is no explicit need to destroy an object as Java handles the de-allocation automatically.
  The technique that accomplishes this is known as Garbage Collection. Programs that do not de-allocate memory can
  eventually crash when there is no memory left in the system to allocate. These programs are said to have memory
  leaks.
  
  Garbage collection in Java happens automatically during the lifetime of the program, eliminating the need to de-
  allocate memory and thereby avoiding memory leaks.
  
  In C language, it is the programmer’s responsibility to de-allocate memory allocated dynamically using free()
  function.This is where Java memory management leads.
• No one wants its software to fail or crash. Exceptions are the major reason for software failure. The exceptions can be handled in the program beforehand and prevent the execution from stopping. This is known as exception handling.
  So exception handling is the mechanism for identifying the undesirable states that the program can reach and specifying the desirable outcomes of such states.
  Try-catch is the most common method used for handling exceptions in the program.

Given the head node of the singly linked list, return a pointer pointing to the middle of the linked list.
If there are an odd number of elements, return the middle element if there are even elements return the one which is farther from the head node.
For example, let the linked list be 1->2->3->4->null

Since the number of elements in this linked list is 4 so we have 2 middle elements, i.e. 2 and 3, but we return 3 as it is farther from the head node, i.e. 1.

For a given string(str) and a character X, write a function to remove all the occurrences of X from the given string and return it.
The input string will remain unchanged if the given character(X) doesn't exist in the input string.