- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Found 10783 Articles for Python
42 Views
There are n number of spectators in the stadium, and they are labeled from 1 to n. Now follow these cases −At time t1, the first spectator stands.At time t2, the second spectator stands.…At time tk, the k-th spectator stands.At time tk + 1, the (k + 1)-th spectator stands and the first spectator sits.At time tk + 2, the (k + 2)-th spectator stands and the second spectator sits.…At time tn, the n-th spectator stands and the (n – k)-th spectator sits.At time tn + 1, the (n + 1 – k)-th spectator sits.…At time tn + k, the ... Read More
125 Views
Suppose we have two values n and m; we have to find the number of rectangles of size 2x1 that can be set inside a rectangle of size n x m. There are few conditions, that we have to consider −Any two small rectangles cannot overlap.Every small rectangle lies completely inside the bigger one. It is permitted to touch the edges of the bigger rectangle.So, if the input is liken = 3, m = 3, then the output will be 4To solve this, we will follow these steps −if n mod 2 is same as 0, thenreturn(n / 2) * ... Read More
Find the number of distinct pairs of vertices which have a distance of exactly k in a tree in Python
173 Views
Suppose we have an integer k and also have a tree with n nodes, we have to count the number of distinct pairs of vertices which have a exact k distance.So, if the input is like k = 2then the output will be 4To solve this, we will follow these steps −N := 5005graph := adjacency list of size Nvertex_count := a 2d matrix of size 505 x 5005res := 0Define a function insert_edge() . This will take x, yinsert y at the end of graph[x]insert x at the end of graph[y]Define a function dfs() . This will take v, ... Read More
431 Views
Suppose we have a binary matrix. We have to count the number of islands in it. An island is place that is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. We can assume that all four edges of the grid are all surrounded by water.Suppose the grid is like −11000110000010000011There are three islands.To solve this, we will follow these steps −There will be two methods, one will be used to count number of islands called numIslands() and makeWater(). The makeWater() will be like −if number of rows in the grid is 0, then return 0n ... Read More
189 Views
Suppose we have an array with n numbers, we have to return the number of consecutive zero’s at the end after multiplying all the n numbers.So, if the input is like [200, 20, 5, 30, 40, 14], then the output will be 6 as 200 * 20 * 5 * 30 * 40 * 14 = 336000000, there are six 0s at the end.To solve this, we will follow these steps −Define a function count_fact_two() . This will take ncount := 0while n mod 2 is 0, docount := count + 1n := n / 2 (only the quotient as ... Read More
495 Views
Suppose we have one equation in this form: a + b = c, now any one of the terms of a, b or c is missing. We have to find the missing one.So, if the input is like ? + 4 = 9, then the output will be 5To solve this, we will follow these steps −delete all blank spaces from the string and change (+ and = to comma ', ')elements := a list of elements by splitting the string separated by commaidx := 0for i in range 0 to size of elements, doif elements[i] is not numeric, thenidx ... Read More
69 Views
Suppose there are n number of cashiers exchanging the money, at the moment, the i-th cashier had ki number of people in front of him/her. Now, the j-th person in the line to i-th cashier had m[i, j] notes. We have to find how early can one exchange his/her notes. We have to keep in mind that the cashier spent 5 seconds to scan a single note.After completing scanning of every note for the customer, he/she took 15 seconds to exchange the notes.So, if the input is like Input : n = 6, k = [12, 12, 12, 12, 12, ... Read More
4K+ Views
To get help for the particular command, you can use Get-Help (alias: help) cmdlet with the command that you need help.For example, help Get-ServiceOnce you run this command, you will get the description of NAME, SYNOPSIS, SYNTAX, DESCRIPTION, RELATED LINKS, and REMARKS.Multiple parameters that support help as shown below-Full − Detailed help with parameter explanation and examples.help Get-Service -Full-Detailed − Detailed help of parameters and doesn’t include the examples.help Get-Service -Detailed-Examples − Only help related to examples will be displayed on the PowerShell screen.help Get-Service -Examples -Online − Help contents for the cmdlet will be searched online on the Microsoft ... Read More
270 Views
A python tuple is ordered and unchangeable. But it can also be made up of lists as its elements. Given a tuple made up of lists, let’s find out how many lists are present in the tuple.with len()In this approach we will apply the len function. The len() function will give the count of lists which are the elements of the tuple.Example Live DemotupA = (['a', 'b', 'x'], [21, 19]) tupB = (['n', 'm'], ['z', 'y', 'x'], [3, 7, 89]) print("The number of lists in tupA :" , len(tupA)) print("The number of lists in tupB :" , len(tupB))OutputRunning the above ... Read More
784 Views
Given a list with sorted numbers, we want to find out which numbers are missing from the given range of numbers.With rangewe can design a for loop to check for the range of numbers and use an if condition with the not in operator to check for the missing elements.Example Live DemolistA = [1, 5, 6, 7, 11, 14] # Original list print("Given list : ", listA) # using range res = [x for x in range(listA[0], listA[-1]+1) if x not in listA] # ... Read More