Difficulty: Medium Link: Day 26, May Leetcode Challenge Problem Description A decimal number is called deci-binary if each of its digits is either 0 or 1 without any leading zeros. For…

# Tag: competitive programming

Difficulty: Easy Link: Day 24: May Leetcode Challenge Problem Description Given a string s, return the string after replacing every uppercase letter with the same lowercase letter.…

Difficulty : Medium Link: Day 12: May Leetcode Challenge Problem Description Given the root of a binary tree, return the level order traversal of its nodes’ values. (i.e.,…

Difficulty: Medium Link: Day 17: May Leetcode Challenge Problem Description Given a list of words, each word consists of English lowercase letters. Let’s say word1 is a…

Difficulty: Medium Link: Day 13: May Leetcode Challenge Problem Description We had some 2-dimensional coordinates, like “(1, 3)” or “(2, 0.5)”. Then, we removed all commas, decimal points, and…

Difficulty: Medium Link: Day 12: May Leetcode Challenge Problem Description Given a 2D matrix matrix, handle multiple queries of the following type: Calculate the sum of the elements…

Difficulty: Easy Link: Day 2: May LeetCode Challenge Problem Description Count the number of prime numbers less than a non-negative number, n. Examples Constraints 0 <=…

Difficulty: Easy Link: Day 3: May Leetcode Challenge Problem Statement Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return…

Difficulty: Medium Link: Day 30: April Leetcoding Challenge Given three integers x, y, and bound, return a list of all the powerful integers that have a value less than or equal…

Difficulty: Medium Link: April Leetcode Challenge : Day 29 Problem Description Given an array of integers nums sorted in ascending order, find the starting and ending position…