I enjoy learning all things related to cloud computing and full-stack development.
Cheers!
Leetcode Problem Given an array of different height values, find the two "banks" that produce the most water valume. Note that water will be limited by the lowest bank. This is a two-pointer problem. Pseudocode Declare a left and right pointer, as w...
馃敆 Leetcode Problem Koko Eating Bananas is a binary search problem where we help Koko determine how many bananas Koko needs to eat if Koko were to eat the minimum number of bananas in such a way that there are no bananas left after H hours. Pseudocod...
Link to Problem Description: given an array of numbers, return all unique triplets that add up to 0 Pseudocode Sort the array Declare an empty array result Loop over the sorted array and for each iteration: within the loop . . . Check if the inde...
A quick and easy guide on getting up and running with Postgres on your local mac
As the sun rises, most people are still in the warm embrace of their beds. Not me. For the past year, I've cultivated a daily fitness routine that's transformed me physically, mentally, and emotionally. By alternating between lifting weights and cycl...
Problem Statement Given a string, find the length of the longest substring, which has all distinct characters. Example: Input: String="aabccbb" Output: 3 Explanation: The longest substring with distinct characters is "abc". Solution const func = (st...
Understanding the Problem This problem uses a "sliding window" strategy. Given an array of binary, what is the longest length of consecutive "1"s we can return given our ability to flip "k" number of "0"s. Consider the following: array = [1, 1, 1, 0]...
Leetcode Arrays
O(n) and O(1) solutions
