Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Suppose we have a binary list called nums containing only 0s and 1s where a 0 indicates empty cell and 1 indicates the cell is filled by a ball. We have to find a new list of say L, whose size is also same like nums size, where L[i] is set to the total distance required to move all the balls to L[i]. Here the distance to move a ball from index j to index i is |j - i|.So, if the input is like nums = [1, 1, 0, 1], then the output will be [4, 3, 4, 5], ... Read More
Suppose we have a string s with four directions "N", "S", "W" and "E" for North, South, West and East respectively. We have to find the size of the shortest substring we can update such that each of the four directions occur n/4 times each, where n is the size of string s.So, if the input is like s = "NNSWWESN", then the output will be 1, here n is 8, so 8/4 is 2, so if we change last N to E, all directions will be there twice.To solve this, we will follow these steps −n := size of ... Read More
Suppose we have a list of numbers called nums and also have list of queries. Where each query element contains [i, j]. So this query is asking whether the sublist of nums from [i, j] (both inclusive), is an arithmetic sequence or not. So finally we have to find the count of queries that return true.So, if the input is like nums = [2, 4, 6, 8, 7, 6, 5, 2] queries = [[3, 4], [0, 3], [2, 4]], then the output will be 2, because [2, 4, 6, 8] is an arithmetic sequence, so query [0, 3] is true. ... Read More
Suppose we have a list customers and another list mood, these two are of same length, we also have another integer k. Now on each minute i, customers[i] number of people come to the store and when mood[i] = 1, it indicates the customers are happy and when mood[i] = 0, then they are sad. We can set a sublist of size k of mood to 1s, finally we have to find the maximum number of people we can make happy.So, if the input is like customers = [2, 3, 6, 6, 3] mood = [1, 1, 0, 0, 0] ... Read More
Suppose we have a lowercase alphabet string called s and also have a list of pairs called 'pairs'. Each element in pairs has two strings [a, b] where the character 'a' and 'b' are considered same. If there are two pairs like [a, b] and [b, c], then we can say a and b are equivalent also b and c are equivalent, so a and c are also equivalent. And any value a or b is equivalent to itself. We have to check whether s is a palindrome or not with the given equivalence relations.So, if the input is like ... Read More
Suppose we have a list of lowercase strings called words where each word is of same length. We have to check whether there are two strings that differ only in one character.So, if the input is like words = ["seed", "pick", "lick", "root", "live"], then the output will be True, as "pick" and "lick" are almost same.To solve this, we will follow these steps −s := a new setfor each word in words, dofor each index i and word w in word, doif substring of word[from index 0 to i - 1] concatenate "*" concatenate word[from index i + 1 ... Read More
Suppose we have an integer n, that is representing the number of seats in an airplane. Now consider the first passenger has lost his ticket, so he picks a random seat. Now everyone else has their ticket but if their seat is already taken, they will also select an available seat randomly. We have to find the probability that the last person gets their assigned seat.So, if the input is like n = 5, then the output will be 0.5, the answer is always constant when there is more than one person, because either they have got the correct seat ... Read More
Suppose we have a list of string called ops where each element is any one of these operations like below −A non-negative integer value that will be pushed into a stack"POP" to delete top most element from the stack"DUP" to insert top element again into the stack, to make it duplicate"+" to pop out the top two elements and push the sum value"-" to pop out the top two elements and push the result of (top element - element just below top)So we have to find the top mot element in the stack after applying all of these operations. If ... Read More
Suppose we have a list of numbers called nums whose length is n. The elements present in this list are representing the current score of swimmers in a competition. For the final match the first place winner for this current round will get n scores, the second place winner will get n-1 points and so on. We have to check the number of swimmers that can still win the competition in the final round after the current round. If there is a tie for the first in points, that will also be counted as winning.So, if the input is like ... Read More
Suppose we have a list representing a heap tree. As we know heap is a complete binary tree. We have to check whether the elements are forming max heap or not. As we know for max heap every element is larger than both of its children.So, if the input is like nums = [8, 6, 4, 2, 0, 3], then the output will be True because, all elements are larger than their children.To solve this, we will follow these steps −n := size of numsfor i in range 0 to n - 1, dom := i * 2num := nums[i]if ... Read More