2 days agoLeetcode — 128 Longest Consecutive SequenceGiven an unsorted array of integers nums, return the length of the longest consecutive elements sequence. To solve this problem, we store the current consecutive count in dp[i]. When we have a sorted array: [1, 3, 4, 4, 5], the output is 3. So we want dp[i] to remains unchanged…Leetcode1 min read
Jun 11RTK query — How to centralize error handlingWhen we receive errors from queries or mutations, we’ll want to notify users saying: Hey! something went wrong! RTK query provide hooks to call api and return an error which trigger re-render event, so we can easily integrate our beautiful modal or toast library. To trigger a notification, we can…React2 min read
Dec 9, 2021LeetCode — 1306 Jump Game III javascript solution (Possibly fastest)Given an array of non-negative integers arr, you are initially positioned at start index of the array. When you are at index i, you can jump to i + arr[i] or i - arr[i], check if you can reach to any index with value 0. Notice that you can not…Leetcode Medium3 min read
Nov 16, 2021React — One of the essentials in Web developmentThere are several frontend frameworks/libraries that are production-ready nowadays(e.g. React, Vue, Angular). As a web developer, I choose React for frontend development, and I have been using it since 2019. React is a library literally, but you can still treat it as a web framework for easier understanding Why learn React? Since this…React2 min read
Nov 12, 2021LeetCode — Two Sum O(n) solutionSolution of leetcode first problem — TL;DR If you just want the O(n) solution, click here Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. Input: nums = [2,7,11,15], target = 22 Output: [1,3] Output: Because nums[1] + nums[3] == 22, we return [1, 3]. 1. O(n²) Solution To kick start, we calculate all the…Leetcode2 min read
