Pavitra

Pavitra

123 Articles Published

Articles by Pavitra

123 articles

Python Program to Count Inversions in an array

Pavitra
Pavitra
Updated on 11-Mar-2026 302 Views

In this article, we will learn about the solution to the problem statement given below.Problem statement − We are given a list, we need to count the inversion required and display it.Inversion count is obtained by counting how many steps are needed for the array to be sorted.Now let’s observe the solution in the implementation below −Example# count def InvCount(arr, n):    inv_count = 0    for i in range(n):       for j in range(i + 1, n):          if (arr[i] > arr[j]):             inv_count += 1    return inv_count ...

Read More

Python Program to Count number of binary strings without consecutive 1’

Pavitra
Pavitra
Updated on 11-Mar-2026 339 Views

In this article, we will learn about the solution to the problem statement given below.Problem statement − We are given a positive integer N, we need to count all possible distinct binary strings available with length N such that no consecutive 1’s exist in the string.Now let’s observe the solution in the implementation below −Example# count the number of strings def countStrings(n):    a=[0 for i in range(n)]    b=[0 for i in range(n)]    a[0] = b[0] = 1    for i in range(1, n):       a[i] = a[i-1] + b[i-1]       b[i] = a[i-1] ...

Read More

Python Program to Count set bits in an integer

Pavitra
Pavitra
Updated on 11-Mar-2026 487 Views

In this article, we will learn about the solution to the problem statement given below.Problem statement − We are given an integer n, we need to count the number of 1’s in the binary representation of the numberNow let’s observe the solution in the implementation below −#naive approachExample# count the bits def count(n):    count = 0    while (n):       count += n & 1       n >>= 1    return count # main n = 15 print("The number of bits :", count(n))OutputThe number of bits : 4#recursive approachExample# recursive way def count( n):   ...

Read More

Python Program to Count trailing zeroes in factorial of a number

Pavitra
Pavitra
Updated on 11-Mar-2026 881 Views

In this article, we will learn about the solution to the problem statement given below.Problem statement − We are given an integer n, we need to count the number of trailing zeros in the factorial.Now let’s observe the solution in the implementation below −Example# trailing zero def find(n):    # Initialize count    count = 0    # update Count    i = 5    while (n / i>= 1):       count += int(n / i)       i *= 5    return int(count) # Driver program n = 79 print("Count of trailing 0s "+"in", n, "! ...

Read More

Python program to find number of local variables in a function

Pavitra
Pavitra
Updated on 11-Mar-2026 987 Views

In this article, we will learn about the solution to the problem statement given below.Problem statement − We are given a function, we need to display the number of local variables in the function.Now let’s observe the solution in the implementation below −Example# checking locals def scope():    a = 25.5    b = 5    str_ = 'Tutorialspoint' # main print("Number of local varibales available:", scope.__code__.co_nlocals)OutputNumber of local varibales available: 3Example# checking locals def empty():    pass def scope():    a, b, c = 9, 23.4, True    str = 'Tutiorialspoint' # main print("Number of local varibales available:", empty.__code__.co_nlocals) ...

Read More

Python program to find uncommon words from two Strings

Pavitra
Pavitra
Updated on 11-Mar-2026 725 Views

In this article, we will learn about the solution to the problem statement given below.Problem statement − We are given two strings, we need to get the uncommon words from the given strings.Now let’s observe the solution in the implementation below −Example# uncommon words def find(A, B):    # count    count = {}    # insert in A    for word in A.split():       count[word] = count.get(word, 0) + 1    # insert in B    for word in B.split():       count[word] = count.get(word, 0) + 1    # return ans    return [word for ...

Read More

Python Program for Efficient program to print all prime factors of a given number

Pavitra
Pavitra
Updated on 11-Mar-2026 377 Views

In this article, we will learn about the solution to the problem statement given below.Problem statement − We are given a number, we need to find all the prime factors of a given number.The efficient solution to the problem is discussed below −Example# Python program to print prime factors import math # prime def primeFactors(n):    # no of even divisibility    while n % 2 == 0:       print (2),       n = n / 2    # n reduces to become odd    for i in range(3, int(math.sqrt(n))+1, 2):       # while i ...

Read More

Python Program for nth multiple of a number in Fibonacci Series

Pavitra
Pavitra
Updated on 11-Mar-2026 1K+ Views

In this article, we will learn about the solution to the problem statement given below.Problem statement− We are given a number, we need to find the nth multiple of a number k in Fibonacci number.The solution to the problem is discussed below−Example# find function def find(k, n):    f1 = 0    f2 = 1    i =2;    #fibonacci recursion    while i!=0:       f3 = f1 + f2;       f1 = f2;       f2 = f3;       if f2%k == 0:          return n*i       ...

Read More

Python Program for Number of elements with odd factors in the given range

Pavitra
Pavitra
Updated on 11-Mar-2026 623 Views

In this article, we will learn about the solution to the problem statement given below.Problem statement − We are given a range, we need to find the number of odd factors in the range.ApproachAs we all know that all perfect squares have an odd number of factors in a range. So here we will compute a number of perfect squares.As m and n both are inclusive, so to avoid error in case of n being a perfect square we take n-1 in the formulae.Now let’s see the implementation below−Example# count function def count(n, m):    return int(m**0.5) - int((n-1)**0.5) # main ...

Read More

Python program to check if the given string is vowel Palindrome

Pavitra
Pavitra
Updated on 11-Mar-2026 524 Views

In this article, we will learn about the solution to the problem statement given below.Problem statement − We are given string (containing both vowel and consonant letters), remove all consonants, then check if the resulting string is a palindrome or not.Here we first remove all the consonants present in the string. A loop to calculate the divisors by computed by dividing each value from 1 to the minimum computedEach time the condition is evaluated to be true counter is incremented by one.Remove all the consonants in the string. Now we check whether the vowel string is a palindrome or not i.e. ...

Read More
Showing 1–10 of 123 articles
« Prev 1 2 3 4 5 13 Next »
Advertisements