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
Programming Articles
Page 1403 of 2547
Maximum of Absolute Value Expression in C++
Suppose we have two arrays of integers with equal lengths, we have to find the maximum value of: |arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j|. Where the maximum value is taken over all 0
Read MoreLongest Palindromic Subsequence in C++
Suppose we have a string s, we have to find the longest palindromic subsequence's length in s. We can assume that the maximum length of s is 1000. So if the input is like “bbbab”, then output will be 4. One possible palindromic subsequence is “bbbb”.To solve this, we will follow these steps −x := s, then reverse x, n := size of sif n is 0, then return 0update s by adding one blank space before s, and update x by adding one blank space before xret := 0make one matrix dp of size (n + 1) x (n ...
Read MoreRandom Flip Matrix in C++
Suppose we have a binary matrix with n_rows number of rows and n_cols number of columns. Here all values are initially 0. we have to define a function flip() which chooses a 0 value uniformly at random, changes it to 1, and then returns the position [row.id, col.id] of that value. Also, we have to write another function reset() which sets all values back to 0. We have to try to minimize the number of calls to system's Math.random() and optimize the time and space complexity.If we have the matrix of order 2x3, and we call flip four times, then ...
Read MoreWrite a function to get Nth node in a Linked List in C++
Here, we are given a linked list and an index. We have to write a function to get Nth node in a linked list.Let’s take an example to understand the problem, Inputlinked list = 34 -> 4 -> 9 -> 1 , n = 2Output9To go to the node specified by n. We will go node by node in the linked list and increase the index count until the required nth position is reached.Program to illustrate the program, Example#include using namespace std; class Node{ public: int data; Node* next; }; void insertNode(Node** head_ref, int new_data) { ...
Read MoreContinuous Subarray Sum in C++
Suppose we have a list of non-negative numbers and a target integer k, we have to write a function to check whether the array has a continuous subarray of size at least 2 that sums up to a multiple of k, sums up to n*k where n is also an integer. So if the input is like [23, 2, 4, 6, 7], and k = 6, then the result will be True, as [2, 4] is a continuous subarray of size 2 and sums up to 6.To solve this, we will follow these steps −Make a map m, set m[0] ...
Read MoreSet crbegin() and crend() function in C++ STL
In this article we are going to discuss the set::crbegin() and set::crend() functions in C++ STL, their syntax, working and their return values.What is Set in C++ STL?Sets in C++ STL are the containers which must have unique elements in a general order. Sets must have unique elements because the value of the element identifies the element. Once added a value in set container later can’t be modified, although we can still remove or add the values to the set. Sets are used as binary search trees.What is set::crbegin()?crbegin() function is an inbuilt function in C++ STL, which is defined ...
Read MoreXOR of Sum of every possible pair of an array in C++
In this problem, we are given an array of n elements. Our task is to generate a sequence of size n*n whose elements are the sum of a pair of all elements of A with itself. And print the xor elements of this sum array formed.Let’s take an example to understand the problem, Input − A (1, 4, 5)Output − 0Explanation −B (1+1, 1+4, 1+5, 4+1, 4+4, 4+5, 5+1, 5+4, 5+5) B(2, 5, 6, 5, 8, 9, 6, 9, 10) Xor of all values = 2^5^6^5^8^9^6^9^10 = 0.To solve this problem, we need to know some properties of Xor. The ...
Read MoreSwap For Longest Repeated Character Substring in C++
Suppose we have a string text, so we are allowed to swap two of the characters in the string. We have to find the length of the longest substring with repeated characters. So if the input is like “ababa”, then the result will be 3, as if we swap first b with last a, or the last b with first a, then the longest repeated character will be “aaa”, so the length is 3.To solve this, we will follow these steps −Define a map cnt, set ret := 1, j := 0, n := size of text, v := 0, ...
Read MoreXOR of Prime Frequencies of Characters in a String in C++
In this problem, we are given a string of characters, our task is to print the XOR of frequencies of characters of the string whose frequency of occurrence is a prime number.Let’s take an example to understand the problem, Input − TutorialsPointOutput −Here, we will check the frequency of occurrence of each character of the string and then find XOR of all the characters whose frequency is a prime number. For this will create an array of prime frequencies. Then we will store frequencies of characters of a string in a map and then matching with prime frequency array. If ...
Read MoreContiguous Array in C++
Suppose we have a binary array, we have to find the maximum length of a contiguous subarray with equal number of 0 and 1. So if the input is like [0, 1, 0], then the output will be 2 as [0, 1] or [1, 0] is the largest contiguous array with equal number of 0s and 1s.To solve this, we will follow these steps −ret := 0, n := size of nums, sum := 0make a map m, set m[0] := - 1for i in range 0 to size of nums – 1sum := sum + 1 when nums[i] is ...
Read More