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
Python Articles
Page 98 of 855
Check whether the two numbers differ at one-bit position only in Python
Suppose we have two numbers x and y. We have to check whether these two numbers differ at one-bit position or not.So, if the input is like x = 25 y = 17, then the output will be True because x = 11001 in binary and y = 10001. Only one-bit position is different.To solve this, we will follow these steps −z = x XOR yif number of set bits in z is 1, thenreturn Truereturn FalseLet us see the following implementation to get better understanding −Example Codedef bit_count(n): count = 0 while n: count ...
Read MoreCheck whether triangle is valid or not if sides are given in Python
Suppose we have three sides. We have to check whether these three sides are forming a triangle or not.So, if the input is like sides = [14,20,10], then the output will be True as 20 < (10+14).To solve this, we will follow these steps −sort the list sidesif sum of first two sides
Read MoreCheck whether two strings are anagram of each other in Python
Suppose we have two strings s and t we have to check whether they are anagram of each other or not.So, if the input is like s = "bite" t = "biet", then the output will be True as s ad t are made of same characters.To solve this, we will follow these steps −if size of s is not same as size of t, thenreturn Falsesort characters of s and treturn true if s is exactly same as t, otherwise falseLet us see the following implementation to get better understanding −Example Codedef solve(s, t): if len(s) != len(t): ...
Read MoreCheck if absolute difference of consecutive nodes is 1 in Linked List in Python
Suppose, we have a singly linked list where each node contains an integer value. We have to find out if the absolute difference between two successive nodes is 1.So, if the input is like start_node->5->6->7->8->7->6->5->4, then the output will be True.To solve this, we will follow these steps −temp := start_nodewhile temp is not null, doif temp.link is same as null, thencome out from the loopif |value of (temp) - value of (temp.link)| is not same as 1, thenreturn Falsetemp := temp.linkreturn TrueExampleLet us see the following implementation to get better understanding −import math class link_node: def __init__(self, value): ...
Read MoreCheck if at least half array is reducible to zero by performing some operation in Python
Suppose, we are provided with a list of size n that contains positive integers and another positive integer m. Let's say, we are currently inside a loop and in each iteration, we decrease the value of some elements in the array by 1 and increase the value of the remaining elements by m. We have to find out if half or more of the elements of the list turn into zero after some iterations. We return True if possible, and False if not.So, if the input is like input_list = [10, 18, 35, 5, 12], m = 4, then the ...
Read MoreCheck if edit distance between two strings is one in Python
Suppose we have two strings s and t. We have to check whether the edit distance between s and t is exactly one or not. Here edit between two strings means any of these three −Insert a characterDelete a characterReplace a characterSo, if the input is like s = "hello" t = "heillo", then the output will be True as we need to insert one character into s to get t.To solve this, we will follow these steps −if |size of s - size of t| > 1, thenreturn falseedit_dist_cnt := 0, i := 0, j := 0while i < ...
Read MoreCheck if elements of an array can be arranged satisfying the given condition in Python
Suppose we have an array called nums. We have to check whether it is possible to rearrange the elements of nums such that it follows the condition −So, if the input is like nums = [8, -4, 4, -8], then the output will be True as if we arrange the array like [-4, -8, 4, 8] for i = 0, nums[2*0 + 1] = 2 * (-4) = -8 for i = 1, nums[2*1 + 1] = 2 * 4 = 8To solve this, we will follow these steps −freq := a map containing elements of nums and their frequenciesfor ...
Read MoreCheck if elements of Linked List are present in pair in Python
Suppose we have a singly linked list. We have to check whether each element in the given linked list is present in a pair, in other words all elements occur even no. of times.So, if the input is like list = [2, 5, 5, 2, 3, 3], then the output will be True.To solve this, we will follow these steps −xor_res := 0, current_node := head of linked listwhile current_node is not null, doxor_res := xor_res XOR value of current_nodecurrent_node := next of current_nodereturn False when xor_res is non-zero otherwise TrueExampleLet us see the following implementation to get better understanding ...
Read MoreCheck If every group of a is followed by a group of b of same length in Python
Suppose we have a lowercase string s with only two characters a and b. We have to check whether every group of consecutive a's is followed by group of consecutive b's of equal length.So, if the input is like s = "abaaabbbaabbaabbab", then the output will be True, as all groups are (ab), (aaabbb), (aabb), (aabb), (ab).To solve this, we will follow these steps −a_count := 0, string_len := size of si := 0while i < string_len, dowhile i < string_len and s[i] is 'a', doa_count := a_count + 1i := i + 1while i < string_len and s[i] is ...
Read MoreCheck if a string is Pangrammatic Lipogram in Python
Suppose, we have been provided with three strings and we are asked to find which of the strings are a Pangram, Lipogram, and a Pangrammatic Lipogram. A Pangram is a string or a sentence, where every letter in the alphabet appears at least once. A Lipogram is a string or a sentence where one or more letters in the alphabet do not appear. A Pangrammatic Lipogram is a string or sentence where all letters in the alphabet appear except one.So, if the input is like −pack my box with five dozen liquor jugs to stay in this mortal world or ...
Read More