6 Tips For Starting a Business During a Pandemic

  • 时间：2020-09-07 12:08:04
  • 分类：网络文摘
  • 阅读：120 次
The Coronavirus pandemic has certainly made things trickier for small businesses and even put some out of business for good. So it’d be crazy to build a startup in this climate, right? For some this is the right time to ditch an hourly job ... ...

What Should You Blog About During the Pandemic and Beyond?

  • 时间：2020-09-07 12:08:04
  • 分类：网络文摘
  • 阅读：103 次
Keeping a niche in mind will help reduce the overwhelming pressure of choosing topics to write about. The theme of the blog takes charge of the direction of the content. It also narrows down the focus of the content and tells the owner what... ...

Introducing the Pancake Sorting Algorithm

  • 时间：2020-09-07 12:03:44
  • 分类：网络文摘
  • 阅读：94 次
Given an array of integers A, We need to sort the array performing a series of pancake flips. In one pancake flip we do the following steps: Choose an integer k where 0 <= k < A.length. Reverse the sub-array A[0…k]. For exampl... ...

Tutorial: How to Set Up a API Load Balancer by Using CloudFlare

  • 时间：2020-09-07 12:03:44
  • 分类：网络文摘
  • 阅读：94 次
The CloudFlare Worker is a Serverless Service (similar to Amazon Lambda, Google Function) that we can use to deploy functions in the edge network. The serverless is the future – with the biggest advantages: no need to maintain the ser... ...

Using the stdout to debug print the solution in the leetcode con

  • 时间：2020-09-07 12:03:44
  • 分类：网络文摘
  • 阅读：107 次
The leetcode web coding IDE has a premium debugger feature – however this is not enabled during the contest. Recently I found out that you can actually print to STDOUT and then when you run your solution – you will see the outpu... ...

Algorithms to Detect Pattern of Length M Repeated K or More Time

  • 时间：2020-09-07 12:03:44
  • 分类：网络文摘
  • 阅读：105 次
Given an array of positive integers arr, find a pattern of length m that is repeated k or more times. A pattern is a subarray (consecutive sub-sequence) that consists of one or more values, repeated multiple times consecutively without ove... ...

Finding the Predecessor and Successor Node of a Binary Search Tr

  • 时间：2020-09-07 12:03:44
  • 分类：网络文摘
  • 阅读：108 次
A Binary Search Tree (BST) is a commonly used data structure that can be used to search an item in O(LogN) time. A BST should have the following characteristics: its left nodes are smaller than the root and its right nodes are larger than t... ...

Replace Harddrives when CrystalDiskInfo Shows Caution Health Sta

  • 时间：2020-09-07 12:03:44
  • 分类：网络文摘
  • 阅读：114 次
The Harddrives failing rate is increasing year by year – and according to statistics, most harddrives’s Annualized Failure Rate (AFR) is between 0 to 2%. It is common that the HDDs fail at around 3 to 5 year’s lifetime. T... ...

How to use the Leetcode’s Mock Interview Overview to Nail

  • 时间：2020-09-07 12:03:44
  • 分类：网络文摘
  • 阅读：106 次
Leetcode has become a de-facto standard for preparing your coding interview. The leetcode has a very useful feature – which is mocking interview. You can mock coding interviews for many big giant techs (e.g. Big4: Facebook, Microsoft,... ...

The Union Find (Disjoint Set) Implementation in Java/C++

  • 时间：2020-09-07 12:03:44
  • 分类：网络文摘
  • 阅读：123 次
Java The Union-Find (Disjoint Set) is a commonly-used algorithm that can solve e.g. Minimal Spanning Tree. The following is a Java implementation of a Union-Find Class. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26... ...