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
-
Economics & Finance
Articles on Trending Technologies
Technical articles with clear explanations and examples
Number of Music Playlists in C++
Suppose we have a music player, that contains N different songs and we want to listen to L songs during our trip. So we have to make a playlist so that it meets these conditions −Every song is played at least onceA song can only be played again only if K other songs have been played.We have to find the number of possible playlists. The answer can be very large, so we will return it modulo 10^9 + 7.So, if the input is like N = 2, L = 3, K = 0, then the output will be 6, as ...
Read MoreConstruct the Rectangle in C++
Suppose we have a specific rectangular web page area, our job is to design a rectangular web page, whose length L and width W that satisfies the following requirements −The area of the web page must equal to the given target area.The width W should not be larger than the length L, and L >= W.The difference between L and W should be as small as possible.So, if the input is like 4, then the output will be [2, 2], as the target area is 4, and all the possible ways to construct it are [1, 4], [2, 2], [4, ...
Read MoreThree Equal Parts in C++
Suppose we have one array A of 0s and 1s, we have to divide the array into 3 non-empty parts such that all of these parts represent the same binary value. If that is possible, return any [i, j] with i+1 < j, such that −A[0], A[1], ..., A[i] is the first part;A[i+1], A[i+2], ..., A[j-1] is the second part, andA[j], A[j+1], ..., A[A.length - 1] is the third part.All three parts have equal binary value. If that is not possible, return [-1, -1].So, if the input is like [0, 1, 0, 1, 1], then the output will be [0, ...
Read MoreKeyboard Row in C++
Given a list of words, we have to find those words that can be typed using letters of the alphabet on only one row's of standard keyboard layout.So, if the input is like ["hello", "world", "mom", "dad", "try", "type", "tom"], then the output will be ["dad", "try", "type"]To solve this, we will follow these steps −Define an array outputoneRow := trueDefine one map charToRowMap, this will take all pairs such that {letter, line}, the letter is the letter present on the keyboard, and line is the line number on the keyboard.for each word in words array −if the word is ...
Read MoreDistinct Subsequences II in C++
Suppose we have a string S, we have to count the number of distinct subsequences of S. The result can be large, so we will return the answer modulo 10^9 + 7.So, if the input is like "bab", then the output will be 6, as there are 6 different sequences, these are "a", "b, "ba", "ab", "bb", "abb".To solve this, we will follow these steps −Define a function add(), this will take a, b, return ((a mod MOD) + (b mod MOD)) mod MODDefine a function sub(), this will take a, b, return (((a mod MOD) - (b mod MOD)) ...
Read MoreIsland of Isolation in Java
After an object has been used, it is deallocated from the memory using the Garbage Collector class. The objects are destroyed based on the fact that no reference to that object is present. The Garbage Collector class calls the ‘finalize’ function on the object that needs to be destroyed.What is island of isolation?When two objects ‘a’, and ‘b’ reference each other, and they are not referenced by any other object, it is known as island of isolation.It is a group of objects which reference each other but they are not referenced but other objects of other applications at all.Note − ...
Read MoreFind the Shortest Superstring in C++
Suppose we have an array A of strings, we have to find any smallest string that contains each string in A as a substring. We can also assume that no string in A is substring of another string in A.So, if the input is like ["dbsh", "dsbbhs", "hdsb", "ssdb", "bshdbsd"], then the output will be "hdsbbhssdbshdbsd"To solve this, we will follow these steps −Define a function calc(), this will take a, b, for initialize i := 0, when i < size of a, update (increase i by 1), do −if substring of a from index i to end is at ...
Read MoreRelative Ranks in C++
Suppose we have a list of scores of N athletes, we have to find their relative ranks and the people with the top three highest scores, who will be different medals: "Gold", "Silver" and "Bronze".So, if the input is like [2, 5, 3, 1, 0], then the output will be [Bronze, Gold, Silver, 4, 5]To solve this, we will follow these steps −if size of nums is same as 1, then −return "Gold"if size of nums is same as 2, then −if nums[0] > nums[1], then −return "Gold", "Silver"Otherwisereturn "Silver", "Gold"Define an array vDDefine an array vecfor initialize i := ...
Read MoreIterator vs Collection in Java
IteratorIt is used in Collection Framework so as to retrieve elements as and when they are required.public interface IteratorIt can be used with the ‘next’ function to move and access the next elements. The ‘remove’ function can be used to remove an element from the data structure.It is quicker in comparison to Collections, since the number of operations associated with Iterator is less.Below is an example of an iterator working with a list −Examplemport java.io.*; import java.util.*; public class Demo{ public static void main(String[] args){ ArrayList my_list = new ArrayList(); my_list.add("Its"); ...
Read MoreLargest Component Size by Common Factor in C++
Suppose we have an array A of unique positive integers, now consider the following graph −There are length of A number of nodes, these are labelled A[0] to A[size of A - 1]; There is an edge between A[i] and A[j] when A[i] and A[j] share a common factor greater than 1. We have to find the size of the largest connected component in the graph.So, if the input is like [4, 6, 15, 35], then the output will be 4To solve this, we will follow these steps −Define an array parentDefine an array rankDefine an array rankif parent[x] is ...
Read More