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
Server Side Programming Articles
Page 1365 of 2109
Prison Cells After N Days in C++
Suppose there are 8 prison cells in a row, and in each cell there is a prisoner or that is empty. In each day, whether the cell is occupied or vacant changes according to the following rules −If one cell has two adjacent neighbors that are both occupied or both vacant, then the cell becomes occupied.Otherwise, it becomes empty.We will describe the current state of the prison in the following way: cells[i] will be 1 if the i-th cell is occupied, else cells[i] will be 0.So we have the initial state of the prison, then return the state of the ...
Read MoreBest Sightseeing Pair in C++
Suppose we have an array A of positive integers, now A[i] represents the value of the i-th sightseeing spot, and two sightseeing spots i and j have distance j - i. Now the score of a pair (i < j) of sightseeing spots is follows this formula (A[i] + A[j] + i - j): We have to find the maximum score of a pair of sightseeing spots. So if the input is like [8, 1, 5, 2, 6], then the output will be 11, as i = 0, j = 2, the value of A[0] + A[2] + 0 – ...
Read MoreTime Based Key-Value Store in C++
Suppose we have to make a timebased key-value store class called TimeMap, that supports two operations.set(string key, string value, int timestamp): This will store the key and value, along with the given timestamp.get(string key, int timestamp): This will return a value such that set(key, value, timestamp_prev) was called previously, with timestamp_prev
Read MoreBinary String With Substrings Representing 1 To N in C++
Suppose we have a binary string S and a positive integer N, we have to say true if and only if for every integer X from 1 to N, the binary representation of X is a substring of the given S. So if S = “0110” and N = 3, then the result will be true, as 1, 10 and 11 all are present in 0110.To solve this, we will follow these steps −Define a method to convert(), that will take n as inputret := an empty stringwhile n is not 0ret := ret concatenate n mod 2n := n ...
Read MoreString Without AAA or BBB in C++
Suppose we have two integers A and B, we have to return any string S, such that −S has length A + B and contains exactly A number of letter ‘a’ and B number of ‘b’ letters.Substring “aaa” and “bbb” will not be in the string SSo if the given integers are A = 4, B = 1, then the result will be “aabaa”.To solve this, we will follow these steps −Define a string ret, initially this is emptywhile |A – B| >= 2, if A > B, thenret := ret concatenate ‘aa’decrease A by 2if B is non-zero concatenate ...
Read MoreConvert to Base -2 in C++
Suppose we have a number N, we have to find a string consisting of "0"s and "1"s that represents its value in base -2 (negative two). The returned string should have no leading zeroes, unless the string is exactly "0". So if the input is like 2, then the output will be “110”, as (-2)^2 + (-2)^1 + (-2)^0 = 2.To solve this, we will follow these steps −ret := an empty stringif N = 0, then return “0”while N is non 0rem := N mod (– 2)N := N / (-2)if rem < 0 and rem := rem + ...
Read MoreSatisfiability of Equality Equations in C++
Suppose we have an array if equations that represent relationships between variables, now each string equations[i] has the length 4 and takes one of two different forms: "a==b" or "a!=b". Here, a and b are lowercase letters, that are representing one-letter variable names. So we have to find true if and only if it is possible to assign integers to variable names so as to satisfy all the given equations.If the input is like: ["a==b", "b==c", "a==c"], then the answer will be true.To solve this, we will follow these steps −Define a method called getParent(), this will take character x ...
Read MoreLongest Arithmetic Sequence in C++
Suppose we have an array A of integers, we have to return the length of the longest arithmetic subsequence in A. As you know that a subsequence of A is a list A[i_1], A[i_2], ..., A[i_k] with 0
Read MoreNumber of Enclaves in C++
Suppose we have given a 2D array A, now each cell is 0 (representing sea) or 1 (representing land) Here a move consists of walking from one land square 4-directionally to another land square, or off the boundary of the grid. We have to find the number of land squares in the grid for which we cannot walk off the boundary of the grid in any number of moves. So if the grid is like −0000101001100000The answer will be 3, as there are three ones enclosed by 0s, and one 1 is not enclosed.To solve this, we will follow these ...
Read MoreMinimum Score Triangulation of Polygon in C++
Suppose we have a value N, consider a convex N-sided polygon with vertices labelled A[0], A[i], ..., A[N-1] are in clockwise order. Now suppose we want to triangulate the polygon into N-2 triangles. For each triangle, the value of that triangle is the product of the labels of the vertices, and the total score of the triangulation will be the sum of these values over all N-2 triangles in the triangulation. We have to find the smallest possible total score that we can achieve with some triangulation of the polygon. So if the input is [1, 2, 3], then the ...
Read More