Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Programming Articles
Page 281 of 2544
Python Program to count duplicates in a list of tuples
Checking copies in a list of tuples could be a common errand in information investigation and information preparation. Python gives a few approaches to effectively check the events of tuples in a list. In this article, we'll investigate diverse calculations and their executions to check copies in a list of tuples utilizing Python. We'll cover three approaches: employing a lexicon, the Counter class from the collections module, and leveraging the control of Pandas DataFrames. Understanding these approaches will empower you to viably analyze the recurrence dispersion of information and pick up bits of knowledge from your datasets. Advantages of Python ...
Read MoreSubstring with maximum ASCII sum when some ASCII values are redefined
In this problem, we will find the substring of the given string whose character's ASCII value's sum is maximum when we redefine the ASCII values. The naïve approach to solve the problem is to find the sum of all substring's character's ASCII value and get the substring having maximum sum. Another approach to solving the problem is using Kadane's algorithm to find the maximum sub-array sum. Problem statement - We have given a string alpha of size N containing the alphabetical characters. We have also given the chars[], and ASCII[] array of size M, where chars[] contains ...
Read MorePython Program for Convert characters of a string to opposite case
In this problem, we will toggle the case of each string character. The easiest way to toggle the case of each string character is using the swapcase() built-in method. Also, we can use the ASCII values of the characters to swap their case. Python also contains isUpper() and isLower() methods to check the character's case and the lower() and upper() method to change the case. Here, we will learn different approaches to solving the problem. Problem statement - We have given a string alpha. We need to toggle the case of string characters. It means converting uppercase ...
Read MoreMinimize Suffix flip to make Binary String non decreasing
In this problem, we will count the number of minimum operations required to convert string non-decreasing order by flipping the characters of the binary string. We can flip all characters of the substring starting from the \mathrm{p^{th}} index if the character at the pth index is 0 and not matching with character at the previous index, and we can count the minimum flips. Problem statement - We have given a binary string alpha. We need to count the minimum flips required to convert the binary string in increasing order. In one flip, we can select any index p ...
Read MoreMaximum point to convert string S to T by swapping adjacent characters
In this problem, we will find the maximum points while converting the string S to T according to the conditions in the problem statement. We can traverse the string S and make each character of the string S same as string T's character at the same index by maximum swaps to get maximum points. In the other approach, we will prepare a mathematical formula based on the string's observation to get the answer. Problem statement - We have given a string S and T containing the alphabetical and numeric characters. We need to count the maximum ...
Read MorePython – Print number of leap years from given list of years
In school or college, working with the leap years would be tricky. In case, when we want to find whether the given year is a leap year or not, the simple method is to divide it by four. When the leap year is divisible by 4 and 100, it is a leap year and otherwise, it is not. When the user is given a list of years ranging from 10 to 100, then it is a tedious process and consumes so much time. In that situation, Python comes into the track with simple codes. To print the number of leap ...
Read MorePython - Remove all occurrences in nested list
When working with settled records in Python, there are circumstances where we have to expel all events of a particular component. Whether it's sifting undesirable information or simplifying complex structures, evacuating components from settled lists could be a common assignment. In this article, we'll investigate distinctive approaches to realize this objective. We'll talk about calculations, step-by-step methods, and give Python sentence structure cases for each approach. By understanding these procedures, you'll pick up the capacity to productively control settled records in Python and tailor them to suit your particular needs. Advantages of Removing all occurrences in nested list Straightforwardness and ...
Read MoreMaximum bitwise OR on of any two Substrings of given Binary String
In this problem, we need to find the maximum OR value of any two substrings of the given strings. The first approach is to find all substrings of the given binary string, take OR value of each string, and print the maximum OR value. The other approach is to take the original string as one substring and take another substring starting from left most zero to maximize the OR value. Problem statement - We have given a binary string alpha. We need to find the maximum OR value of any two substrings of the given binary ...
Read MoreHow to check for whitespaces in a Python Lists?
Python language comes with different varieties of data structures and in this article, it deals with the list data structure. In lists, the elements are arranged in some order and they can undergo various methods for checking the whitespace or spaces. The elements inside the list can be a string or an empty string, it can also be a tab inside the string or any one space. Among the various methods given below, isspace() function is considered an easier one. Approach Approach 1 − Using the “re” module Approach 2 − Using the iteration method Approach 3 − Using ...
Read MoreCount ways to form N Sized Strings with at most two adjacent different pair
In this problem, we will count the number of binary strings of size N, containing at most 2 adjacent distinct pair of characters. It means the string should contain, at most, 2 '01' 0r '10' pairs. The first approach is that generate all binary strings, and if any binary string contains less than or equal to 2 distinct pairs of characters, include its count in the result. For the optimal solution, we can count a number of binary strings containing 0, 1, and 2 adjacent different pairs and sum them. Problem statement - We have given a positive ...
Read More