Given a string s, return whether it’s a repeating string. Constraints n ≤ 100,000 where n is the length of s Example 1 Input s = “dogdogdog” Output true …
Given a list of strings words, concatenate the strings in camel case format. Example 1 Input words = Output “javaBeans” Example 2 Input words = Output “goNasa” How to …
Given an integer n, return the nth (0-indexed) row of Pascal’s triangle. Pascal’s triangle can be created as follows: In the top row, there is an array of 1. …
Given a string, find the length of the longest substring T that contains at most k distinct characters. Example 1: Input: s = “eceba”, k = 2 Output: 3 …
Problem statement: Given a cage that has R rabbits and C chicken, and we know there are H heads and L legs. So find out the value of R …
Given two strings s1 and s2, determine if s1 is a subsequence of s2. A string a is a subsequence of another string b if you can delete some …