Search for a command to run...
Series
In this series, I will tackle LeetCode challenges with varying difficulties. I will share my thought process to my solution and how I ended up solving the problem.
Writer's note: Found this draft sitting too long in Drafts. Lost the timing to publish in May so backdated it to May but published in July. Problem Statement We are given a list nums of integers representing a list compressed with run-length encodin...
Problem Statement Given a valid (IPv4) IP address, return a defanged version of that IP address. A defanged IP address replaces every period "." with "[.]". Example 1: Input: address = "1.1.1.1" Output: "1[.]1[.]1[.]1" Step-by-Step Solution Identify ...
Problem statement: Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the number of valid j's such that j != i and nums[j] < nums[i]. Return the answer in an ...
Problem Statement You're given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want to know how many of the stones you have are also jewels. Th...
Problem statement: Given a non-negative integer num, return the number of steps to reduce it to zero. If the current number is even, you have to divide it by 2, otherwise, you have to subtract 1 from it. Example 1: Input: num = 14 Output: 6 Explanati...
Problem statement: Given the array candies and the integer extraCandies, where candies[i] represents the number of candies that the ith kid has. For each kid check if there is a way to distribute extraCandies among the kids such that he or she can ha...
