leetcode-potd

Given a string s, return the maximum number of unique substrings that the given string can be split into. You can split string s into any […]

Given two positive integers n and k, the binary string Sn is formed as follows: S1 = “0” Si = Si – 1 + “1”

Given an integer array nums, find the maximum possible bitwise OR of a subset of nums and return the number of different non-empty subsets with the maximum bitwise OR. An

A boolean expression is an expression that evaluates to either true or false. It can be in one of the following shapes: ‘t’ that evaluates to true.

You are given an integer num. You can swap two digits at most once to get the maximum valued number. Return the

A string s is called happy if it satisfies the following conditions: s only contains the letters ‘a’, ‘b’, and ‘c’. s does not contain any of “aaa”, “bbb”, or “ccc” as a

There are n balls on a table, each ball has a color black or white. You are given a 0-indexed binary string s of length n, where 1 and 0 represent

You are given a 0-indexed integer array nums and an integer k. You have a starting score of 0. In one operation: choose an index i such that 0 <= i <

You have k lists of sorted integers in non-decreasing order. Find the smallest range that includes at least one number from each of the k lists. We define

You are given a 2D integer array intervals where intervals[i] = [lefti, righti] represents the inclusive interval [lefti, righti]. You have to divide the intervals into one

There is a party where n friends numbered from 0 to n – 1 are attending. There is an infinite number of chairs in this party that are

A ramp in an integer array nums is a pair (i, j) for which i < j and nums[i] <= nums[j]. The width of such a ramp is j – i. Given