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
-
Economics & Finance
Programming Articles
Page 473 of 2547
Check if all digits of a number divide it in Python
Suppose we have a number n. We have to check whether all digits of it can divide n or not. So, if the input is like n = 135, then the output will be True, because (135 / 1 = 135), (135 / 3 = 45) and (135 / 5 = 27). Algorithm To solve this, we will follow these steps − val := n while val > 0, do ...
Read MoreCheck if all bits of a number are set in Python
In computers, data is stored in the binary form, which uses the two digits 0 and 1. Each digit in this format is known as a bit. In this article, we are going to check if all bits of a number are set in Python. A bit is said to be set if the binary representation of every bit is 1. Let's look at some scenarios to understand this better: Scenario 1 Input: 3 Binary: 11 Output: True Explanation: All bits are 1. Scenario 2 Input: 6 Binary: 110 Output: False ...
Read MoreCheck if a two-character string can be made using given words in Python
Given a two-character string s and a list of two-character words w, we need to check whether we can concatenate words from w to create a string that contains s as a substring. For example, if s = "no" and w = ["ol", "on", "ni", "to"], we can concatenate "on" + "ol" to get "onol", which contains "no" as a substring. Algorithm To solve this problem, we need to check three possible scenarios ? The target string s exists directly in the word list We can form s by taking the second character of one ...
Read MoreCheck if a triangle of positive area is possible with the given angles in Python
In geometry, a triangle with positive area must satisfy two conditions: the sum of all angles must equal 180 degrees, and each angle must be positive (greater than 0). Let's explore how to check if three given angles can form a valid triangle. Problem Understanding Given three angles, we need to verify if they can form a triangle with positive area. For a valid triangle: All angles must be positive (greater than 0) Sum of all three angles must equal 180 degrees Each angle must be less than 180 degrees (since other two angles must be ...
Read MoreCheck if a string is the typed name of the given name in Python
Sometimes when we type on a keyboard, vowel keys might get long pressed, causing them to repeat one or more times. Given two lowercase strings s (the intended name) and t (the typed name), we need to check whether t could be a result of typing s with some vowels accidentally repeated. So, if the input is like s = "mine" and t = "miiine", then the output will be True because the vowel 'i' is repeated three times while other letters remain unchanged. Algorithm Steps To solve this problem, we will follow these steps − ...
Read MoreCheck if a string is suffix of another in Python
In Python, checking if one string is a suffix of another is a common string manipulation task. A suffix is a substring that appears at the end of a string. For example, "ate" is a suffix of "unfortunate". Python provides multiple approaches to solve this problem efficiently ? Method 1: Using endswith() Method The simplest approach is to use Python's built-in endswith() method ? s = "ate" t = "unfortunate" result = t.endswith(s) print(f"Is '{s}' a suffix of '{t}'? {result}") Is 'ate' a suffix of 'unfortunate'? True Method 2: ...
Read MoreCheck if a string is Isogram or not in Python
An isogram is a string where each letter appears exactly once. In Python, we can check if a string is an isogram using various approaches like sets, lists, or built-in functions. For example, "education" is an isogram because each letter (e, d, u, c, a, t, i, o, n) appears only once. Method 1: Using a List to Track Characters We can iterate through each character and maintain a list of seen characters ? def check_isogram_with_list(word): char_list = [] for char in word: ...
Read MoreCheck if a string is Colindrome in Python
A colindrome is a special type of string that consists of concatenated palindromes, each exactly 6 characters long. To check if a string is a colindrome, we need to verify that its length is divisible by 6 and that each 6-character segment is a palindrome. For example, the string "aabbaamnoonm" is a colindrome because it contains two 6-character palindromes: "aabbaa" and "mnoonm". Algorithm To solve this problem, we follow these steps: Check if the string length is divisible by 6 Divide the string into 6-character segments Verify each segment is a palindrome Return True only ...
Read MoreCheck if a string has m consecutive 1s or 0s in Python
Suppose we have a binary string s and another value m, we have to check whether the string has m consecutive 1's or m consecutive 0's. So, if the input is like s = "1110111000111", m = 3, then the output will be True as there are three consecutive 0s and 1s. Algorithm To solve this, we will follow these steps ? str_size := size of s count_0 := 0, count_1 := 0 for i in range 0 to str_size − 1, do ...
Read MoreCheck if a string has all characters with same frequency with one variation allowed in Python
Sometimes we need to check if a string can become "valid" by removing at most one character. A valid string means all unique characters have the same frequency. For example, "aab" is not valid (a appears 2 times, b appears 1 time), but we can remove one 'a' to make it "ab" where both characters appear once. Problem Example Given string s = "xyyzx", we can delete one 'z' to get "xyyx" where both 'x' and 'y' appear twice ? Approach The algorithm counts character frequencies and checks if we can achieve uniform frequency by removing ...
Read More