Minimum repeat to make substring
Given two strings s1 and s2. Return a minimum number of times s1 has to be repeated such that s2 is a substring of […]
2275. Largest Combination With Bitwise AND Greater Than Zero
The bitwise AND of an array nums is the bitwise AND of all integers in nums. For example, for nums = [1, 5, 3], the bitwise
Split array in three equal sum subarrays
Given anarray, arr[], determine if arr can be split into three consecutive parts such that the sum of each part is equal. If possible,
3011. Find if Array Can Be Sorted
You are given a 0-indexed array of positive integers nums. In one operation, you can swap any two adjacent elements if they have the same number of set bits. You
Root to leaf paths sum
Given a binary tree, where every node value is a number. Find the sum of all the numbers that are
2914. Minimum Number of Changes to Make Binary String Beautiful
You are given a 0-indexed binary string s having an even length. A string is beautiful if it’s possible to partition it into one or more
Rotate by 90 degree
Given asquare matrix[][]. The task is to rotate it by 90 degrees in clockwise direction without using any extra space. Examples: Input: mat[][]
3163. String Compression III
Given a string word, compress it using the following algorithm: Begin with an empty string comp. While word is not empty, use the following operation: Remove
Find All Triplets with Zero Sum
Given an array arr[], find all possible indices [i, j, k] of triplets [arr[i], arr[j], arr[k]] in the array whose sum is equal to zero. Return indices of
796. Rotate String
Given two strings s and goal, return true if and only if s can become goal after some number of shifts on s. A shift on s consists of moving the leftmost character of s to the rightmost
Is Linked List Length Even?
Given a linked list, your task is to complete the function isLengthEven() which contains the head of the linked list, and check whether the length
2490. Circular Sentence
A sentence is a list of words that are separated by a single space with no leading or trailing spaces. For example, “Hello World”, “HELLO”, “hello world