[Backend] Run flask in background with Gunicorn

[Leetcode] Jump Game

Problems of greedy algorithm are usually intuitively challenging. For this one, the high level concept is “while already able to jump (global), stay behind the accessible point and seek greedier choice (local)”.

Description

[Backend] Flask on GCP

Run a flask app on gcp, set the firewall rule, so the app shall be accessed.

[Leetcode] Permutations

Permutation means the sequence of elements in subset does matter.

Description

Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.

[Leetcode] Palindromic Substrings

A palindrome is same backward as forward. Also, a palindrome will still be palindrome after removing head and tail. Hence, this is a breakable problem, which dynamic programming helps.

Description

[Leetcode] Clone Graph

Familiarize graph’s design of data structure and the way to traverse.

Description

[Leetcode] Subsets

Subsets problems are just like combinations.

Description

Given an integer array nums of unique elements, return all possible subsets (the power set).

[Leetcode] Climbing Stairs

While the condition is as simple as the fib, this can be a good practice of dynamic programming.

Description

You are climbing a staircase. It takes n steps to reach the top.