Python_Leetcode
After a fast reading of this fatastic Python data structure book (highly recommended for programming "beginners" like me):
Problem Solving with Algorithms and Data Structures using Python
I first get started with linked list suggested by my friend. It was not that difficult. There are some summary or tricks about linked list:
Then followed by binary search and two pointers.
And some summary about bit manipulation can be looked up:
Then maybe math problems. If it is related with number theory, I guess you can skip or look at the solutions instead.
Stack or hash table for some questions are not hard. However, combining with backtrack, tree, dfs, bfs or dp together, the solutions become more complicated.
String and array questions are sort of solved in various methods. You can test yourself after you undestand all the algorithms.
DP can be really hard. Need more training!!!