May 31, 2020May LeetCoding Challenge — Day 31Edit Distance Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2. You have the following 3 operations permitted on a word: Insert a character Delete a character Replace a character Example 1: Input: word1 = "horse", word2 = "ros" Output: 3 Explanation: horse -> rorse…Python4 min readPython4 min read
May 31, 2020Member-onlyHow To Deploy Your React Single-Page Application and Serve it with Apache (Ubuntu 16.04+)**NOTE — This tutorial only covers React apps that are solely a single page (front-end) application.** Intro Before we get into how you can use Apache to serve your React application, it’s worth noting that Apache may not be the best web server for your situation. Apache is a process-based web…Apache4 min readApache4 min read
May 30, 2020May LeetCoding Challenge — Day 30K Closest Points to Origin We have a list of points on the plane. Find the K closest points to the origin (0, 0). (Here, the distance between two points on a plane is the Euclidean distance.) You may return the answer in any order. …Algorithms3 min readAlgorithms3 min read
May 30, 2020May LeetCoding Challenge — Day 29Course Schedule There are a total of numCourses courses you have to take, labeled from 0 to numCourses-1. Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1] Given the total number of courses and a list…Algorithms2 min readAlgorithms2 min read
May 29, 2020May LeetCoding Challenge — Day 28Counting Bits Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array. Example 1: Input: 2 Output: [0,1,1] Example 2: Input: 5 Output: [0,1,1,2,1,2] Follow up: It is…Python3 min readPython3 min read
May 28, 2020May LeetCoding Challenge — Day 27Possible Bipartition Given a set of N people (numbered 1, 2, ..., N), we would like to split everyone into two groups of any size. Each person may dislike some other people, and they should not go into the same group. Formally, if dislikes[i] = [a, b], it means it…Python3 min readPython3 min read
May 26, 2020May LeetCoding Challenge — Day 26Contiguous Array Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1. Example 1: Input: [0,1] Output: 2 Explanation: [0, 1] is the longest contiguous subarray with equal number of 0 and 1. Example 2: Input: [0,1,0] Output: 2 Explanation: [0, 1] (or…Python3 min readPython3 min read
May 26, 2020May LeetCoding Challenge — Day 25Uncrossed Lines We write the integers of A and B (in the order they are given) on two separate horizontal lines. Now, we may draw connecting lines: a straight line connecting two numbers A[i] and B[j] such that: A[i] == B[j]; The line we draw does not intersect any other…Leetcode5 min readLeetcode5 min read
May 25, 2020May LeetCoding Challenge — Day 24Construct Binary Search Tree from Preorder Traversal Return the root node of a binary search tree that matches the given preorder traversal. (Recall that a binary search tree is a binary tree where for every node, any descendant of node.left has a value < node.val, and any descendant of node.right…Python2 min readPython2 min read
May 24, 2020May LeetCoding Challenge — Day 23Interval List Intersections Given two lists of closed intervals, each list of intervals is pairwise disjoint and in sorted order. Return the intersection of these two interval lists. (Formally, a closed interval [a, b] (with a <= b) denotes the set of real numbers x with a <= x <=…Python2 min readPython2 min read
