ViewTube

Leetcode #2277.

Leetcode #1625.

Today's problem looks like it wants dynamic programming, monotonic stacks, sliding window or some clever subarray magic.

Leetcode #3341.

Leetcode #3342.

Leetcode #778.

Given two integers n and k, count the number of binary strings of length n where adjacent 1 appear k times. Since the answer can ...

Given an array arr[] consisting of n distinct integers, find the maximum count of integers that are binary searchable in the given ...

Given two arrays a[] and b[] of positive integers of size n and m respectively, where m ≤ n. You are allowed to insert zeros ...

Given two strings, s1 and s2, count the number of subsequences of string s1 equal to string s2. Return the total count modulo ...