Question: The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, We get the following sequence (ie, for n = 3): “123” “132” “213” “231” “312” “321” Given n and k, return the kth permutation sequence. Note: Given n will be between 1 and 9 […]

# CODing for Nothing

# [leetcode] Gas Station

Question: There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its next station (i+1). You begin the journey with an empty tank at one […]

# [Leetcode] Flatten Binary Tree to Linked List

Problem: Given a binary tree, flatten it to a linked list in-place.

# [Leetcode] Triangle

Problem: Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the following triangle [ [2], [3,4], [6,5,7], [4,1,8,3] ] The minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 […]

# [Leetcode] Binary Tree Level Order Traversal I && II

Problem Binary Tree Level Order Traversal I Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). Solution 1: DFS, use variable to track depth, add node.val to according level sets Solution 2: BFS, use two queues to store all nodes on the current […]

# [Leetcode] Multiply Strings

Problem: Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-negative. Solution: