ViewTube

Leetcode #1625.

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

Leetcode #3286.

Leetcode #2277.

Leetcode #3925.

Leetcode #2524 (Could not solve on my own - come back to review later)

Leetcode #2183 (Could not solve on my own - come back to review later)

Leetcode #3341.

Leetcode #3342.

You are given two arrays of strings wordsContainer and wordsQuery. For each wordsQuery[i], you need to find a string from ...

Leetcode #3243.

Leetcode #778.

You are given an integer mass, which represents the original mass of a planet. You are further given an integer array asteroids, ...

Given a binary string s consisting of 0s and 1s. Find the maximum difference of the number of 0s and the number of 1s (number of ...

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

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 two strings, s1 and s2, count the number of subsequences of string s1 equal to string s2. Return the total count modulo ...

Given two integers n and m representing the dimensions of a chessboard, find the number of ways to place one black knight and ...