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 363 of 852
Program to count how many blocks are covered k times by walking in Python
Suppose we have two lists called walks and target. At the beginning we are at position 0 in a one-dimensional line. Now |walks[i]| represents the number of steps have been walked. And when walk[i] is positive then indicates walked right, and negative for left. When we walk, we move one block, that is the next or previous integer position. We have to find the number of blocks that's been walked on at least target number of times.So, if the input is like walks = [3, -7, 2] target = 2, then the output will be 5, from the following figure, ...
Read MoreProgram to count number of overlapping islands in two maps in Python
Suppose we have two binary matrices mat1 and mat2. Here 1 represents land and 0 represents water, if there is a group of 1(land) surrounded by water is called island. We have to find the number of islands that exist in both mat1 and mat2 at the exact same coordinates.So, if the input is like mat1 =101100100And mat2 =101100101then the output will be 2, because the overlapping islands are, 101100101so there are two overlapping islands.To solve this, we will follow these steps −r := row count of mat1c := column count of mat1last_row := r - 1last_col := c - ...
Read MoreProgram to find index, where we can insert element to keep list sorted in Python
Suppose we have a list of numbers called nums, they are sorted in ascending order, we also have another number target, we have to find the index where target should be inserted to keep nums sorted. If target already present in nums, then return the largest index where target can be inserted. We have to solve this without using library functions and solve it in O(log n) time.So, if the input is like nums = [1, 5, 6, 6, 8, 9] target = 6, then the output will be 4, because 6 is already there, so to insert it, the ...
Read MoreProgram to find how many updates required to make string half monotonous in Python
Suppose we have a lowercase string s whose length is even. We have to find the minimum number of characters that need to be updated such that one of the following three conditions is satisfied for all i, where 0 ≤ i < n/2 and j, n/2 ≤ j < n −s[i] > s[j]s[i] < s[j]s[i] == s[j]So, if the input is like s = "pppxxp", then the output will be 1 because if we change the last "p" to "x", then this can satisfy the condition s[i] < s[j]To solve this, we will follow these steps −n := size ...
Read MorePython Pandas - How to Round the DateTimeIndex with minute frequency
To round the DateTimeIndex with minute frequency, use the DateTimeIndex.round() method. For minute frequency, use the freq parameter with value ‘T’.At first, import the required libraries −import pandas as pdDatetimeIndex with period 5 and frequency as s i.e. seconds. The timezone is Australia/Adelaide −datetimeindex = pd.date_range('2021-09-29 07:00', periods=5, tz='Australia/Adelaide', freq='45s') Display DateTimeIndex −print("DateTimeIndex...", datetimeindex)Round operation on DateTimeIndex date with minute frequency. For minute frequency, we have used 'T −print("Performing round operation with minute frequency...", datetimeindex.round(freq='T'))ExampleFollowing is the code −import pandas as pd # DatetimeIndex with period 5 and frequency as s i.e. seconds # timezone is Australia/Adelaide datetimeindex = pd.date_range('2021-09-29 ...
Read MoreProgram to find minimum costs needed to fill fruits in optimized way in Python
Suppose we have a list called fruits and another two values k and cap. Where each fruits[i] has three values: [c, s, t], this indicates fruit i costs c each, size of each of them is s, and there is total t of them. The k represents number of fruit baskets of capacity cap. We want to fill the fruit baskets with the following constraints in this order −Each basket can only hold same type fruitsEach basket should be as full as possibleEach basket should be as cheap as possibleSo we have to find the minimum cost required to fill ...
Read MorePython Pandas - How to Round the DateTimeIndex with hourly frequency
To round the DateTimeIndex with hourly frequency, use the DateTimeIndex.round() method. For hourly frequency, use the freq parameter with value ‘H’.At first, import the required libraries −import pandas as pdCreate a DatetimeIndex with period 5 and frequency as T i.e. minutes −datetimeindex = pd.date_range('2021-09-29 07:00', periods=5, tz='Australia/Adelaide', freq='35T') Display DateTimeIndex −print("DateTimeIndex...", datetimeindex)Round operation on DateTimeIndex date with hourly frequency. For hourly frequency, we have used 'H' −print("Performing round operation with hourly frequency...", datetimeindex.round(freq='H'))ExampleFollowing is the code −import pandas as pd # DatetimeIndex with period 5 and frequency as T i.e. minutes # timezone is Australia/Adelaide datetimeindex = pd.date_range('2021-09-29 07:00', periods=5, ...
Read MoreProgram to find minimum cost to send same number of people to two different cities in Python
Suppose we have a list called costs. Where costs[i] has [c1, c2] indicates that for person i it costs c1 amount to reach city 0 and costs c2 amount to reach city 1. We want the same number of people to go to city 0 as city 1, we have to find the minimum cost required.So, if the input is like costs = [[2, 6], [10, 3], [4, 9], [5, 8]], then the output will be 17, because person 0 and 2 will go to city 0 and person 1 and 3 to city 1, so for city 0, the ...
Read MorePython Pandas - Snap time stamps in DateTimeIndex to nearest occurring frequency\\n\\n
To snap time stamps in DateTimeIndex to nearest occurring frequency, use the DateTimeIndex.snap() method. Set the frequency using the freq parameter.At first, import the required libraries −import pandas as pdCreate a DatetimeIndex with period 6 and frequency as D i.e. day −datetimeindex = pd.date_range('2021-10-20 02:30:50', periods=6, tz='Australia/Adelaide', freq='D') Display DateTimeIndex −print("DateTimeIndex...", datetimeindex)Snap time stamps to nearest occurring i.e. Month end here −print("Snap time stamps to nearest occurring frequency...", datetimeindex.snap(freq='M'))ExampleFollowing is the code −import pandas as pd # DatetimeIndex with period 6 and frequency as D i.e. day # The timezone is Australia/Adelaide datetimeindex = pd.date_range('2021-10-20 02:30:50', periods=6, tz='Australia/Adelaide', freq='D') ...
Read MoreProgram to check first player can win by reaching total sum to target in Python
Suppose we have two numbers k and target. Now consider Amal and Bimal are playing a game. In each round Amal picks a number from 1 to k to add to the total score that initially starts from 0. Whoever crosses the total to target wins. Amal always plays first, we have to check whether he can force a win if both of them plays optimally.So, if the input is like k = 5 target = 10, then the output will be True, as if Amal picks 4 first, then whether Bimal picks 1, 2, ..., or 5, Amal can ...
Read More