- Related Questions & Answers
- 8085 program to count number of elements which are less than 0A
- Program to find number of elements in A are strictly less than at least k elements in B in Python
- Program to return number of smaller elements at right of the given list in Python
- Program to count number of elements present in a set of elements with recursive indexing in Python
- Program to count number of sublists with exactly k unique elements in Python
- Program to count number of elements in a list that contains odd number of digits in Python
- Check if given array is almost sorted (elements are at-most one position away) in Python
- Program to count number of word concatenations are there in the list in python
- Program to count number of palindromic substrings in Python
- Program to check programmers convention arrangements are correct or not in Python
- Program to count number of permutations where sum of adjacent pairs are perfect square in Python
- Program to count minimum invalid parenthesis to be removed to make string correct in Python
- Program to find the number of possible position in a line in Python
- Program to find minimum number of hops required to reach end position in Python
- Program to count maximum number of distinct pairs whose differences are larger than target in Python

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Suppose we have a list of numbers called nums, we have to find the number of elements that are present in the correct indices, when the list was to be sorted.

So, if the input is like [2, 8, 4, 5, 11], then the output will be 2, as the elements 2 and 11 are in their correct positions. The sorted sequence will be [2, 4, 5, 8, 11]

To solve this, we will follow these steps −

- s := sort the list nums
- count := 0
- for i in range 0 to size of nums, do
- if s[i] is same as nums[i], then
- count := count + 1

- if s[i] is same as nums[i], then
- return count

Let us see the following implementation to get better understanding −

class Solution: def solve(self, nums): s = sorted(nums) count = 0 for i in range(len(nums)): if s[i] == nums[i]: count += 1 return count ob = Solution() print(ob.solve([2, 8, 4, 5, 11]))

[2, 8, 4, 5, 11]

2

Advertisements