
Asked in Siemens
Count Inversions Problem Statement
Given an integer array ARR
of size N
, your task is to find the total number of inversions that exist in the array.
An inversion is defined for a pair of integers in the array when both of the following conditions are met:
ARR[i] > ARR[j]
i < j
Here, i
and j
are indices ranging from 0
to N-1
.
Example:
Input:
N = 5
ARR = [2, 4, 1, 3, 5]
Output:
3
Explanation:
The inversions are: (2, 1), (4, 1), (4, 3), and hence the output is 3
.
Constraints:
1 <= N <= 10^5
1 <= ARR[i] <= 10^9
- Time Limit: 1 sec
Note:
You are not required to print anything; it has been taken care of. Just implement the function to return the result.
Be the first one to answer
Add answer anonymously...
Top Software Developer Interview Questions Asked at Siemens
Q. Write a program to find duplicate elements in an array.
Q. How do you implement a constructor in C++?
Q. Write basic code.
Interview Questions Asked to Software Developer at Other Companies
Top Skill-Based Questions for Siemens Software Developer
Algorithms Interview Questions and Answers
250 Questions
Data Structures Interview Questions and Answers
250 Questions
Web Development Interview Questions and Answers
250 Questions
Java Interview Questions and Answers
250 Questions
SQL Interview Questions and Answers
250 Questions
Software Development Interview Questions and Answers
250 Questions
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

