This problem is found on LeetCode. I’ve done a lot of reversing strings and numbers so I thought this problem should be easy. It wasn’t…I found out here that reading closely is important even if you think you know what you’re doing.
Given a signed 32-bit integer
A new week and a new problem. I found this problem on LeetCode. I had fun with this problem mainly because it had something to do with sweets.
Given the array candies and the integer extraCandies, where candies[i] represents the number of candies that the ith kid has.
***Disclaimer: If you are just getting started with React Native and have not set up your first React Native project yet, read my blog on how to getting started***
This week I was working on another algorithm problem from my Colt Steele Udemy course. This is another frequency counter type problem but this time I’m working to see if two strings are anagrams of each other.
Given two strings, write a function to determine if the second string is…
I’ve decided that I will start reviewing some of the algorithm problems I come across while practicing on LeetCode.
Given an array
nums. We define a running sum of an array as
runningSum[i] = sum(nums…nums[i]).
Return the running sum of
Input: nums = [1,2,3,4]
Explanation: Running sum is obtained…