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
Articles by Arnab Chakraborty
Page 35 of 377
Program to find out the number of boxes to be put into the godown in Python
Suppose, we have two arrays containing integers. One list contains the height of some unit width boxes and another array contains the height of rooms in the godown. The rooms are numbered 0...n, and the height of the rooms is provided in their respective indexes in the array godown. We have to find out the number of boxes that can be pushed into the godown. a few things have to be kept in mind, The boxes can’t be put one on another.The order of the boxes can be changed.The boxes are put into the godown from left to right only.If ...
Read MoreProgram to find out the dot product of two sparse vectors in Python
Suppose, we have two sparse vectors represented in two lists. We have to return the dot product of the two sparse vectors. The vectors are represented as objects, and the lists are stored in a member variable 'nums' in the objects.So, if the input is like vector1 = [1, 0, 0, 0, 1], vector2 = [0, 0, 0, 1, 1], then the output will be 1 The dot product is 1 * 0 + 0 * 0 + 0 * 0 + 0 * 1 + 1 * 1 = 1.To solve this, we will follow these steps −res := ...
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 −Exampledef 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 if two expression trees are equivalent using Python
Suppose, we are provided two expression trees. We have to write a program that checks the two expression trees and determines if the expression trees generate similar values. The two expression trees are provided to us in an in-order manner and we return a True value if they match, or else we return a False value.So, if the input is likethen the output will be True.The two expression trees evaluate to the same value.To solve this, we will follow these steps:Define a function dfs() . This will take node, dicif node is empty, thenreturnif left of node and right of ...
Read MoreProgram to find out the lowest common ancestor of a binary tree using Python
Suppose, we are given a binary tree and also two specific nodes x and y. We have to find out the lowest common ancestor of the two nodes from the binary tree. The lowest common ancestor in a binary tree is the lowest node of which both the nodes x and y are descendants of. Also, a particular node can also be a descendant of itself. We have to find the node and return it as an output.So, if the input is likeand x = 2, y = 4; then the output will be 3.The node of which the nodes ...
Read MoreProgram to find out the lowest common ancestor of a binary tree using parent pointers using Python
Suppose, we are given a binary tree and also two specific nodes x and y. We have to find out the lowest common ancestor of the two nodes from the binary tree. The lowest common ancestor in a binary tree is the lowest node of which both the nodes x and y are descendants. A particular node can also be a descendant of itself. We have to find the node and return it as an output.The node structure of the tree is like below −TreeNode: data: left: right: parent: We have to utilize ...
Read More