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 number k, we have to find the minimum number of Fibonacci numbers whose sum is equal to the k, whether a Fibonacci number could be used multiple times.So, if the input is like k = 7, then the output will be 2, as the Fibonacci numbers are: 1, 1, 2, 3, 5, 8, 13, ... For k = 7 we can use 2 + 5 = 7.To solve this, we will follow these steps −Define an array finsert 0 at the end of finsert 1 at the end of fwhile last element of f = 0 and k > 0), do −if f[j] 0) { if (f[j]
Suppose we have a string; we have to design one HTML parser that will replace the special character of HTML syntax into normal character. The HTML entity parser is the parser that takes HTML code as input and replace all the entities of the special characters by the characters itself. These are the special characters and their entities for HTML −Quotation Mark − the entity is " and symbol character is ".Single Quote Mark − the entity is ' and symbol character is '.Ampersand − the entity is & and symbol character is &.Greater Than Sign − the entity is ... Read More
Suppose we have an array queries of positive integers between 1 and m, we have to process all queries, queries[i] (from i=0 to n, n is the size of queries - 1) according to the following rules −At the beginning, we have the permutation P=[1, 2, 3, ..., m].For the current i, find the position of queries[i] in the permutation P (indexing from 0) and then move this at the beginning of the permutation P.We have to find an array containing the result for the given queries.So, if the input is like queries = [3, 1, 2, 1], m = ... Read More
Suppose there is a string. That string is called happy if it does not have any of the strings like 'aaa', 'bbb' or 'ccc' as a substring. If we have three integers like a, b and c, then return any string s, which satisfies the following conditions −s is happy and longest possible.s contains at most an occurrence of the letter 'a', at most b occurrences of the letter 'b' and at most c occurrences of the letter 'c'.s will only contain 'a', 'b' and 'c' letters.If there is no such string, then return an empty string.So, if the input ... Read More
Suppose we have a number s in binary form. We have to find the number of steps to reduce it to 1 under these rules −If the current number is even, we have to divide it by 2.If the current number is odd, you have to add 1 to it.So, if the input is like "1101", then the output will be 6, as "1101" is 13. So, 13 is odd, add 1 and obtain 14. Then 14 is even, divide by 2 and obtain 7. After that 7 is odd, add 1 and obtain 8.Then 8 is again, even so, ... Read More
Suppose we have a circle represented as (radius, xc, yc), here (xc, yc) is the center coordinate of the circle. We also have an axis-aligned rectangle represented as (x1, y1, x2, y2), where (x1, y1) are the coordinates of the bottom-left corner, and (x2, y2) are the coordinates of the top-right corner of the rectangle. We have to check whether the circle and rectangle are overlapped or not.So, if the input is likethen the output will be true.To solve this, we will follow these steps −Define a function eval(), this will take a, b, c, return maximum of b and ... Read More
Suppose there are n soldiers standing in a line. Here each soldier is assigned a unique rating value. We have to make a team of 3 soldiers amongst them using the following rules −Choose 3 soldiers with index (i, j, k) such that the rating (rating[i], rating[j], rating[k]).A team will be valid if − (rating[i] < rating[j] < rating[k]) or (rating[i] > rating[j] > rating[k]).We have to find the number of teams we can form. (soldiers can be part of multiple teams).So, if the input is like rating = [2, 5, 3, 4, 1], then the output will be 3, ... Read More
Suppose we have a string s and a number k. We have to construct k non-empty palindrome strings using all the characters in s. So here we have to check whether we can use all the characters in s to construct k palindrome strings or not.So, if the input is like "true", k = 4, then the output will be True, as the only possible solution is to put each character in a separate string.To solve this, we will follow these steps −n := size of sif n < k, then −return falseif n is same as k, then −return ... Read More
Suppose we have a matrix consists of 0 and 1, we have to find the distance of the nearest 0 for each cell. Here the distance between two adjacent cells is 1.So, if the input is like000010111then the output will be000010121To solve this, we will follow these steps −Define an array dir of size: 4 x 2 := {{1, 0}, { - 1, 0}, {0, - 1}, {0, 1}}n := row count, m := column countDefine one matrix ret of order (n x m) and fill this with infDefine one queue qfor initialize i := 0, when i < n, ... Read More
Suppose we have a list of strings; we have to find the longest uncommon subsequence among them. The longest uncommon subsequence is actually the longest subsequence of one of these strings and this subsequence should not be any subsequence of the other strings.We know that a subsequence is a sequence that can be derived from one sequence by deleting some characters without changing the order of the remaining elements.Here we will take a list of strings, and the output needs to be the length of the longest uncommon subsequence. If there is no longest uncommon subsequence, then return -1.So, if ... Read More