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
Python Articles
Page 538 of 852
Program to find number of good leaf nodes pairs using Python
Suppose we have a binary tree. and another value distance d. A pair of two different leaf nodes are said to be good, when the shortest path between these two nodes is smaller or same as distance d.So, if the input is likeAnd distance d = 4, then the output will be 2 because the pairs are (8, 7) and (5, 6) as their path length distance is 2, but (7, 5) or (8, 6) or other pairs are not good as their path length is 5 which is larger than d = 4To solve this, we will follow these ...
Read MoreProgram to find minimum swaps to arrange a binary grid using Python
Suppose we have a n x n binary matrix. We can perform an operation on it like, at one step we select two adjacent rows and swap them. We have to count number of minimum swaps required, so that all nodes above the major diagonal of the matrix is 0. If there is no such solution, then return -1.So, if the input is like010011100then the output will be 2 because −To solve this, we will follow these steps:n := row count of matrixm := make an array of size n and fill with nfor i in range 0 to n ...
Read MoreProgram to check whether we can convert string in K moves or not using Python
Suppose we have two strings s and t, we have to check whether s can be converted to t in k moves or less. In ith move you can do these operations.Select any index j (starting from 1) in s, such that 1
Read MoreProgram to find Kth bit in n-th binary string using Python
Suppose we have two positive values n and k, now we can make a binary string S_n by using following rules −S_1 = 0S_i = S_i-1 concatenate "1" concatenate reverse(invert(S_i-1)) for i > 1Here reverse(x) returns the reversed string x, and invert(x) flips all the bits in x.These are the example of four such stringsS_1 = "0"S_2 = "011"S_3 = "0111001"S_4 = "011100110110001"We have to find kth bit in S_n.So, if the input is like n = 4 k = 10, then the output will be 1 because S_4 = "011100110110001", so 10th bit is 1 (first bit is at ...
Read MoreProgram to find maximum number of non-overlapping subarrays with sum equals target using Python
Suppose we have an array nums and another value called target. Now we have to find the maximum number of non-empty non-overlapping subarrays such that the sum of values in each different subarray is same as target.So, if the input is like nums = [3, 2, 4, 5, 2, 1, 5] target = 6, then the output will be 2 as there are two subarrays [2, 4] and [1, 5] whose sum is same as 6.To solve this, we will follow these steps −t := a new set with single element 0temp := 0ans:= 0for each i in nums, dotemp ...
Read MoreProgram to find minimum operations to make array equal using Python
Suppose we have a value n, consider an array nums with n elements, where arr[i] = (2*i)+1 for all i. Now in one operation, we can choose two indices x and y where 0 =0, doans:= ans + (n-j)q := q - 1j := j + 2return ansLet us see the following implementation to get better understanding −Example Live Demodef solve(n): ans=0 if n==1: return ans q=(n//2)-1 j=1 while q>=0: ans=ans+(n-j) q-=1 j+=2 return ans n = 4 print(solve(n))Input4Output4
Read MoreProgram to find minimum number of vertices to reach all nodes using Python
Suppose we have a directed acyclic graph, with n vertices and nodes are numbered from 0 to n-1, the graph is represented by an edge list, where edges[i] = (u, v) represents a directed edge from node u to node v. We have to find the smallest set of vertices from which all nodes in the graph are reachable. (We can return the vertices in any order).So, if the input is likethen the output will be [0, 2, 3] because these two vertices are not reachable from any other vertices, so if we start from them we can cover all.To ...
Read MoreProgram to find minimum numbers of function calls to make target array using Python
Suppose we have following function definition:def modify(arr, op, index): if op == 0: arr[index] += 1 if op == 1: for i in range(len(arr)): arr[i] *=2We have to find minimum number of function calls required to make a given array nums from one zero array of same size?So, if the input is like nums = [1, 5, 3], then the output will be 7 because, initially all elements are 0, [0, 0, 0]At first step increase second element by 1, so array is [0, 1, 0]Double second element ...
Read MoreProgram to find latest group of size M using Python
Suppose we have an array arr this is holding a permutation of numbers from 1 to n. If we have a binary string of size n and initially all its bits set to zero. Now at each step i (Indexing starts from 1 for both the binary string and arr) from 1 to n, the bit at position arr[i] is set to 1. We also have another value m, and we need to find the latest step at which there exists a group of ones of size m. Here a group of ones means a contiguous substring of 1s such ...
Read MoreProgram to find out the node in the right in a binary tree using Python
Suppose, we are provided a binary tree. We are also given a pointer to a node (named ‘u’) and we have to find the node situated just right of the provided node. The node situated to the given node's right must stay at the same level and the given node can either be a leaf node or an internal node.So, if the input is likeand u = 6, then the output will be 8.The node situated at the right of node 6 is node 8, so the value 8 is returned to us.To solve this, we will follow these steps ...
Read More