$Title$

$desc$

Feb 7, 202010 mins read
Read more →

Contiguous Subarrays

You are given an array arr of N integers. For each index i, you are required to determine the number of contiguous subarrays that fulfill the following conditions:

Feb 7, 202010 mins read
Read more →

Passing Yearbooks

There are n students, numbered from 1 to n, each with their own yearbook. They would like to pass their yearbooks around and get them signed by other students.

Mar 16, 202010 mins read
Read more →

Reverse to Make Equal

Given two arrays A and B of length N, determine if there is a way to make A equal to B by reversing any subarrays from array B any number of times.

Feb 7, 202010 mins read
Read more →

Balance Brackets

$desc$

Feb 7, 202010 mins read
Read more →

Fibonacci Series

Fibonacci numbers, commonly denoted Fn sequence

Aug 7, 202110 mins read
Read more →

Pair Sums

Given a list of n integers arr[0..(n-1)], determine the number of different pairs of elements within it which sum to k.

Feb 7, 202010 mins read
Read more →

Reverse Operations

You are given a singly-linked list that contains N integers. A subpart of the list is a contiguous set of even elements, bordered either by either end of the list or an odd element. For example, if the list is [1, 2, 8, 9, 12, 16], the subparts of the list are [2, 8] and [12, 16].

Feb 7, 202010 mins read
Read more →

Missing element in Permutation.

Find the missing element in a given permutation.

Jul 21, 20202 mins read
Read more →

Palindrome Solutions

Palindrome is in reverse also same

Jul 21, 20202 mins read
Read more →

Queue Removals

You are given a list of n integers arr, which represent elements in a queue (in order from front to back). You are also given an integer x, and must perform x iterations of the following 3-step process:

Feb 7, 202010 mins read
Read more →

Frog Jump Solution

Count minimal number of jumps from position X to Y.

Jul 21, 20202 mins read
Read more →

Tape Equilibrium

Palindrome is in reverse also same

Jul 21, 20202 mins read
Read more →

$Title$

$desc$

Feb 7, 202010 mins read
Read more →

Contiguous Subarrays

You are given an array arr of N integers. For each index i, you are required to determine the number of contiguous subarrays that fulfill the following conditions:

Feb 7, 202010 mins read
Read more →

Passing Yearbooks

There are n students, numbered from 1 to n, each with their own yearbook. They would like to pass their yearbooks around and get them signed by other students.

Mar 16, 202010 mins read
Read more →

Reverse to Make Equal

Given two arrays A and B of length N, determine if there is a way to make A equal to B by reversing any subarrays from array B any number of times.

Feb 7, 202010 mins read
Read more →

Balance Brackets

$desc$

Feb 7, 202010 mins read
Read more →

Fibonacci Series

Fibonacci numbers, commonly denoted Fn sequence

Aug 7, 202110 mins read
Read more →

Pair Sums

Given a list of n integers arr[0..(n-1)], determine the number of different pairs of elements within it which sum to k.

Feb 7, 202010 mins read
Read more →

Reverse Operations

You are given a singly-linked list that contains N integers. A subpart of the list is a contiguous set of even elements, bordered either by either end of the list or an odd element. For example, if the list is [1, 2, 8, 9, 12, 16], the subparts of the list are [2, 8] and [12, 16].

Feb 7, 202010 mins read
Read more →

Missing element in Permutation.

Find the missing element in a given permutation.

Jul 21, 20202 mins read
Read more →

Palindrome Solutions

Palindrome is in reverse also same

Jul 21, 20202 mins read
Read more →

Queue Removals

You are given a list of n integers arr, which represent elements in a queue (in order from front to back). You are also given an integer x, and must perform x iterations of the following 3-step process:

Feb 7, 202010 mins read
Read more →

Frog Jump Solution

Count minimal number of jumps from position X to Y.

Jul 21, 20202 mins read
Read more →

Tape Equilibrium

Palindrome is in reverse also same

Jul 21, 20202 mins read
Read more →