## Nth term of given recurrence relation having each term equal to the product of previous K terms

Updated on 25-Oct-2023 13:24:35

25 Views

Recurrence Relation − In mathematics, recurrence relation refers to an equation where the nth term of the sequence is equal to some combination of the previous terms. For a recurrence relation where each term equals the product of previous K terms, let’s define N and K along with an array arr[] containing the first K terms of the relation. Thus, the nth term is given by − $$\mathrm{F_N= F_{N−1} ∗ F_{N−2} ∗ F_{N−3} ∗ . . .∗ F_{N−K}}$$ Problem Statement Given two positive integers N and K and an array of integers containing K positive integers. Find the Nth term ... Read More

## Maximize the length of a subarray of equal elements by performing at most K increment operations

Updated on 25-Oct-2023 13:18:47

36 Views

A subarray is a contiguous part of an array i.e. it can be considered as an array inside another array. For example, take the following array, array[] = {1, 2, 3, 4, 5, 6} For the above array, one possible subarray is subarry[] = {2, 3, 4} Problem Statement Given an array arr[] having N positive integers and a positive integer K representing the maximum number that can be added to the elements of the array. The task is to increment the elements of the array by most K increment operations and return the maximum possible ... Read More

## Difference between sums of odd level and even level nodes in an N-ary Tree

Updated on 25-Oct-2023 13:12:30

26 Views

The N-ary tree is a tree data structure where each node can have a maximum of N children where N is a positive integer (N >= 0). N-ary trees are used in many applications like file systems, organisational charts and syntax trees in programming languages. Example of N-ary tree with N = 4. A / / \ \ B C D E / | \ ... Read More

## Detect a negative cycle in a Graph using the Shortest Path Faster Algorithm

Updated on 25-Oct-2023 13:07:40

48 Views

The Shortest Path Faster Algorithm is an improved or more optimized version of the Bellman-Ford Algorithm. It calculates the single source's shortest path in a weighted directed graph. This algorithm is especially suitable for graphs with negatively weighted edges. Algorithm Given a weighted directed graph and a source vertex , the algorithm finds the shortest path from , to each vertex , in the graph. The length of thh shortest path from to is stored in for each vertex . procedure Shortest-Path-Faster-Algorithm(G, s) for each vertex v ≠ s in V(G) ... Read More

## Check if a Binary Tree is an Even-Odd Tree or not

Updated on 25-Oct-2023 13:01:21

38 Views

Even-Odd Tree − A binary tree is called an even-odd tree if all the nodes at the even level (taking root node at level 0) have even values and all the nodes at the odd level have odd values. Problem Statement Given a binary tree. The task is to check if the binary tree is an even-odd tree or not. Sample Example 1 Input 6 / \ 3 7 / \ ... Read More

## Check if a Binary Tree contains node values in strictly increasing and decreasing order at even and odd levels

Updated on 25-Oct-2023 12:51:49

20 Views

Level of a Binary Tree − In a binary tree, the level of the node refers to its distance from the root node. The root node is considered at level 0, its immediate children are at level 1, their children at level 2 and so on. Levels of a binary tree are explained in the following example, A

## Array obtained by repeatedly reversing array after every insertion from the given array

Updated on 25-Oct-2023 12:50:05

24 Views

Array insertion and reversal are one of the most common array manipulation techniques. Array manipulation aims to modify an array's contents to get a desired outcome. Problem Statement Given an input array A[]. The task is to insert the elements of the given array into an existing array where a reversal of the output array follows each insertion. Sample Example 1 − Input: A[] = {1, 2, 3, 4, 5} Output: R[] = {5, 3, 1, 2, 4} Explanation Initially, the output array R[] is empty. Insertion of 1 : R[] = {1} Insertion of 2 : ... Read More

## Print the frequency of adjacent repeating characters in a given string

Updated on 25-Oct-2023 12:05:37

23 Views

A string is a data structure consisting of a sequence of characters. The end of the string is marked by a special character, called a null character, which is usually represented by the ASCII code 0. Problem Statement Given a string s of a certain length, the task at hand is to print adjacent repeating characters along with the frequency of their repetition. For Example Input: s = “committee” Output: [[m, 2], [t, 2], [e, 2]] Explanation The character m occurs consecutively twice. Similarly the character t and e also occur twice consecutively. Therefore we return the vector ... Read More

## Minimize removals to remove another string as a subsequence of a given string

Updated on 25-Oct-2023 12:01:38

34 Views

A subsequence refers to a sequence that can be obtained from another sequence by removing zero or more elements, without altering the order of the remaining elements. In simpler terms, a subsequence is derived by selecting elements from the original sequence, while preserving their relative order. For example, consider the sequence [1, 2, 3, 4]. Some possible subsequences of this sequence are: [1, 2], [1, 3, 4], [2, 4], [1, 2, 3, 4], [3], and [4]. Problem Statement The objective is to determine the minimum number of character removals from string s1 in order to eliminate any occurrence of ... Read More

## Check if given string is prefix subarray of the given array

Updated on 25-Oct-2023 11:59:25

16 Views

A subarray of an array is a contiguous part of the array in which we take a group of consecutive elements while also maintaining the relative ordering of elements as present in the original array. Example − Some valid subarrays are − etc. A prefix subarray is a special type of subarray that begins with the first element of the array and ends at some ith index where 0