**Contents**show

## How do you create a Subarray?

**Approach: We use two pointers start and end to maintain the starting and ending point of the array and follow the steps given below:**

- Stop if we have reached the end of the array.
- Increment the end index if start has become greater than end.
- Print the subarray from index start to end and increment the starting index.

## How do you find a subarray in an array?

**Algorithm:**

- Traverse the array from start to end.
- From every index start another loop from i to the end of array to get all subarray starting from i, keep a variable sum to calculate the sum.
- For every index in inner loop update sum = sum + array[j]
- If the sum is equal to the given sum then print the subarray.

## What is kadane algorithm?

Kadane’s algorithm is **an iterative dynamic programming algorithm** in which we search for a maximum sum contiguous subarray within a one-dimensional numeric array.

## What is subsegment of array?

An array containing elements is given. Find number of distinct contiguous subsegments of length , each containing at least different elements. If you sort any two segments of length , and a i = b i , 1 ≤ i ≤ l , then both the segments are considered to be same, and is counted only once.

## How do I generate Subarrays in size k?

**Sum of all subarrays of size K**

- Input: arr[] = {1, 2, 3, 4, 5, 6}, K = 3.
- Output: 6 9 12 15.
- Explanation: All subarrays of size k and their sum: Subarray 1: {1, 2, 3} = 1 + 2 + 3 = 6. Subarray 2: {2, 3, 4} = 2 + 3 + 4 = 9. Subarray 3: {3, 4, 5} = 3 + 4 + 5 = 12. Subarray 4: {4, 5, 6} = 4 + 5 + 6 = 15.

## How do I check if one array is Subarray of another?

Simple Approach: A simple approach is to run two nested loops and generate all subarrays of the array A[] and **use one more loop** to check if any of the subarray of A[] is equal to the array B[]. Efficient Approach : An efficient approach is to use two pointers to traverse both the array simultaneously.

## How many Subarrays are in an array?

Any number of elements smaller than L can be included in subarray as long as there is at least one single element between L and R inclusive. The number of all possible subarrays of an array of size N is **N * (N + 1)/2**.

## What is substring with example?

Java String substring() Method example.

The substring(int beginIndex, int endIndex) method of the String class. … The substring begins at the specified beginIndex and extends to the character at index endIndex – 1. Thus the length of the substring is endIndex-beginIndex.

## Is CharSequence a string?

**Strings are CharSequences**, so you can just use Strings and not worry. Android is merely trying to be helpful by allowing you to also specify other CharSequence objects, like StringBuffers.

## Can a substring be a subsequence?

A substring of a string is a prefix of a suffix of the string, and equivalently a suffix of a prefix. **If one string is a substring of another**, it is also a subsequence, which is a more general concept.