Given a list of elements p, the task is to convert the whole list into a list of sets. Examples: Input: p = [‘apple’, ‘banana’, ‘cherry’] Output: [{‘apple’}, {‘banana’}, {‘cherry’}] Explanation : Here each element of the list is converted into a set. Input: p = [1, 2, 3, 4] Output: [{1}, {2}, {3}, {4}] Approach : Initialize… Read More »
We have to create an inverse triangle in the form of numbers (decreasing order). Example: If the user provide 5. The print 5, 5 times ; 4, 4 times and so on. As- 5 5 5 5 5 4 4 4 4 3 3 3 2 2 1 Implementation: First we declare a variable – number and assign… Read More »
Given a number N, the task is to print all duplicate digits of that number in sorted order. Examples: Input: 123412989 Output : 3 4 8 Explanation : The unique digits are 3 4 8 Input : 9832213789 Output: 1 7 Approach: The idea is to use The idea is to use Hashing to store the frequency of… Read More »
Dynamic Programming is an algorithmic approach to solve some complex problems easily and save time and number of comparisons by storing the results of past computations. The basic idea of dynamic programming is to store the results of previous calculation and reuse it in future instead of recalculating them. Consider a simple example of calculating Factorials from 1… Read More »
Amanada, a school kid, is learning English alphabets. Her teacher devised a small game to make the task fun. A grid of ‘m’ rows and ‘n’ columns is filled with English alphabets. She needs to search English words in this grid by moving one step at a time in any of the adjacent grid cells. A grid of… Read More »
There is question that what should we use void main() or int main() ? void main() { /* … */ } Or, int main() { /* … */ } In both language C and C++, there is standard for it. You may refer the ISO C++ standard 3.6.1[2] or the ISO C standard 5.1.2.2.1 It is suggested to… Read More »
Given a binary tree and two nodes a and b, the task is to print the maximum node value that lies in the path connecting the nodes a and b. If either of the two nodes are not present in the tree then print -1. Examples: Input : 1 / \ 2 3 / \ \ 4 5… Read More »
Backtracking is an algorithm that searches for possible combinations in order to solve computational problems. It is used for solving problems recursively by building increments and removing solutions that do not satisfy given constraints. This technique finds a solution among all possible solutions. Comparison with Brute-Force Approach: Backtracking is an improvement technique of the Bruteforce technique. These are… Read More »
In a prison, there are N cells. The positions of the cells are given in an array. The Jailer has to place all the prisoners in the cells in an ordered manner such that minimum distance between any two prisoners is as large as possible. You have to find that distance. Note: The cells are in a straight… Read More »
Data is information collected for various purposes. Data is information, facts, or details. It can be numbers, words, and images. Data can be raw and processed and are often used for analysis, decision and understanding patterns. We will learn about techniques of data collection, its types, methods and different tools used. What is Data Collection? So, what is… Read More »
