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
Articles by Arnab Chakraborty
Page 72 of 377
Program to find minimum number of rocketships needed for rescue in Python
Suppose we have a list of numbers called weights this is representing peoples' weights and a value limit determines the weight limit of one rocket ship. Now each rocketship can take at most two people. We have to find the minimum number of rocket ships it would take to rescue everyone to Planet.So, if the input is like weights = [300, 400, 300], limit = 600, then the output will be 2, as it will take one rocket ship to take the two people whose weights are 300 each, and another to take the person whose weight is 400.To solve ...
Read MoreProgram to find area of largest island in a matrix in Python
Suppose we have a binary matrix. Here 1 represents land and 0 represents water, And an island is a group of 1s that are neighboring whose perimeter is surrounded by water. We can assume that the edges of the matrix are surrounded by water. We have to find the area of the largest island in matrix.So, if the input is like001111100000000111100001100000000110000010then the output will be 6.To solve this, we will follow these steps −Define a function dfs() . This will take matrix, r, ctotal := total + 1matrix[r, c] := 0if r - 1 >= 0 and matrix[r - 1, ...
Read MoreProgram to find maximum profit by cutting the rod of different length in C++
Suppose we have a rod is given of length n. We also have a list, that contains different size and price for each size. We have to find the maximum price by cutting the rod and selling them in the market. To get the best price by making a cut at different positions and comparing the prices after cutting the rod.So, if the input is like prices = [1, 5, 8, 9, 10, 17, 17, 20], n = 8, then the output will be 22, as by cutting the rod in length 2 and 6. The profit is 5 + ...
Read MoreProgram to find the sum of largest K sublist in Python
Suppose we have a list of numbers called nums, and another value k, which represents a large list of nums concatenated k times. We have to find the sum of the contiguous sublist with the largest sum.So, if the input is like nums = [1, 3, 4, -5], k = 1, then the output will be 11, as we can take the sublist like [2, 4, 5]To solve this, we will follow these steps −s := ans := lo := 0for all value in range 0 to minimum of k and 2, dofor each x in nums, dos := s ...
Read MoreProgram to check robot can reach target by keep moving on visited spots in Python
Suppose we have a robot, that is currently sitting in at position (0, 0) (Cartesian plane). If we have list of its moves that it can make, containing N(North), S(South), W(West), and E(East). However, if the robot reaches a spot it has been in before, it will continue moving in the same direction until it reaches a new unvisited spot. We have to check whether after its moves it will end at (x, y) coordinate or not.So, if the input is likemoves = ['N', 'N', 'E', 'N', 'W', 'S'], coord = [0, -1], then the output will be True, as ...
Read MoreProgram to find sum of non-adjacent elements in a circular list in python
Suppose we have a list of numbers called nums that is representing a circular list. We have to find the largest sum of non-adjacent numbers.So, if the input is like nums = [10, 3, 4, 8], then the output will be 14, as we can take 10 and 4. We cannot take 10 and 8 as they are adjacent.To solve this, we will follow these steps −n := size of numsnums1 := nums[from index 0 to n - 2]nums2 := nums[from index 1 to end]Define a function f() . This will take iif i >= size of nums1 , thenreturn ...
Read MoreProgram to rotate square matrix by 90 degrees counterclockwise in Python
Suppose we have a square matrix, we have to rotate it 90 degrees counter-clockwise.147258369then the output will be789456123To solve this, we will follow these steps −if matrix is empty, thenreturn a blank listn := row count of matrixfor each row in matrix, doreverse the rowfor i in range 0 to n−1, dofor j in range 0 to i−1, doswap matrix[i, j] and matrix[j, i]return matrixLet us see the following implementation to get better understanding −Exampleclass Solution: def solve(self, matrix): if not matrix or not matrix[0]: return [] n = ...
Read MoreProgram to find number of subsequences with i, j and k number of x, y, z letters in Python
Suppose we have a string s with "x", "y" and "z"s, we have to find the number of subsequences that have i number of "x" characters, followed by j number of "y" characters and followed by k number of "z" characters where i, j, k ≥ 1.So, if the input is like s = "xxyz", then the output will be 3, as we can make two "xyz" and one "xxyz"To solve this, we will follow these steps:n := size of sx := 0, y := 0, z := 0for i in range 0 to n, docount := 0if s[i] is ...
Read MoreProgram to find minimum number of bricks required to make k towers of same height in Python
Suppose we have a list of tower heights, and a positive value k. We want to select k towers and make them all the same height by adding more bricks, but using as few bricks as possible. We have to find the minimum number of bricks are needed to pick k towers and make them the same height.So, if the input is like heights = [4, 7, 31, 14, 40] k = 3, then the output will be 17, as we can select 5, 8, and 15 which requires 17 bricks to make the same height.To solve this, we will ...
Read MoreProgram to rotate a linked list by k places in C++
Suppose we have a linked list. We have to rotate the list to the right by k places. The value of k will be positive. So if the list is like [1 −> 2 −> 3 −> 4 −> 5 −> NULL], and k = 2, then the output will be [4 −> 5 −> 1 −> 2 −> 3 −> NULL]Let us see the steps −If the list is empty, then return nulllen := 1create one node called tail := headwhile next of tail is not nullincrease len by 1tail := next of tailnext of tail := headk := ...
Read More