In-depth Backtracking with LeetCode Problems — Part 1

Introduction and Permutation

Backtracking is a general algorithm for finding all (or some) solutions to some computational problems, that incrementally builds candidates to the solutions. As…

Solving Tree Problems on LeetCode

Part of this great node comes from blog:

Solving Matrix/Graph Problems on LeetCode using Python

787. Cheapest Flights Within K Stops

There are n cities connected by m flights. Each fight starts from city u and arrives at v with a price w.

Solve Problems on LeetCode using Divide and Conquer, Dynamic Programming, and Backtracking

Array problems on LeetCode

1 Linked List Introduction

Like arrays, Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at contiguous location; the elements are linked using pointers.

Solve String Problems on LeetCode

Steps:

1. Do we need pre-processing?
2. Is it a difficult question? Yes, Can be re-construct it to another type of question?
3. How to solve it with brute force? Not good enough? Can try minor…

Math related problems on LeetCode

• Greatest Common Dividor (GCD)
• Prim Numbers
• Ugly Number
• The Smallest Larger Number

1. Greatest common divisor (GCD)

Bit Manipulation 4% of LeetCode Problems

Knowledge

Two’s complement and negative number: The binary representation of -k as a N-bit number is concat(1, 2^(N-1)-k) ==representation in positive, flip each bit, and +1.

Elegant Coding Style for Python

This serves as a note and a summary on my journey to become a coder who writes very elegant python code. Python is very different compared with most of other language; it is not like C/C++, which only has some basic key words support and takes a lot effort to import and…

Sorting and Searching

Binary Search==6%

1. 二分法的深入理解

• 二维二分
• 按照值域进行二分

1. Stack

• 扫描线

３．双端队列

Search in the sorted array or 2D…