---
title: "Decostar Sharma (@Decostar) | Hashnode"
description: "Content & Vocabulary. Read the latest articles by Decostar Sharma on Hashnode."
url: "https://hashnode.com/@Decostar"
---

@Decostar

# Decostar Sharma

@Decostar · Joined March 2023

Content & Vocabulary

### [What is Recursion ?](https://decocodes.hashnode.dev/what-is-recursion?utm_source=hashnode&utm_medium=feed)

Recursion is basically a technique of problem-solving in which a function calls itself again and again till a particular base case. The function calls itself with the help of parameters and at each call, the value of the parameter decreases or increa...

4 min read · [decocodes.hashnode.dev](https://decocodes.hashnode.dev/what-is-recursion?utm_source=hashnode&utm_medium=feed)

[Mar 5, 2023](https://hashnode.com/posts/what-is-recursion/64043449704e345c48d24475)

### [Count the number of sub-arrays with at least k pairs of indices (i, j) such that i < j and arr\[i\] == arr\[j\] in a given array.](https://decocodes.hashnode.dev/count-the-number-of-sub-arrays-with-at-least-k-pairs-of-indices-i-j-such-that-i-j-and-arri-arrj-in-a-given-array?utm_source=hashnode&utm_medium=feed)

Given an integer array arr and an integer k, count the number of good sub-arrays of arr. A sub-array arr is good if there are at least k pairs of indices \[ i, j \] such that i < j and arr\[i\] == arr\[j\]. Examples : Input: arr = \[3,1,4,3,2,2,4\], k = 2 O...

10 min read · [decocodes.hashnode.dev](https://decocodes.hashnode.dev/count-the-number-of-sub-arrays-with-at-least-k-pairs-of-indices-i-j-such-that-i-j-and-arri-arrj-in-a-given-array?utm_source=hashnode&utm_medium=feed)

[Mar 5, 2023](https://hashnode.com/posts/count-the-number-of-sub-arrays-with-at-least-k-pairs-of-indices-i-j-such-that-i-j-and-arri-arrj-in-a-given-array/64042f1ff474a6517907248a)
