If you want to see more algorithm questions, you can scan the QR code above to follow my WeChat official account " Data Structure and Algorithms ". Up to now, I have updated more than 500 algorithm questions in the official account , some of which have been sorted into pdf documents. , As of now, there are more than 800 pages in total (and will continue to increase), you can reply to the keyword "pdf" in the official account to download.
Hello, everyone, my name is Boge, I like programming, especially algorithms, and I can’t extricate myself from being addicted to it. In the past 3 years, I have been writing algorithmic solutions on the official account. I have output more than 500 questions, including some classic question types. The combination of graphics and text makes the algorithm less boring. Through these articles, you can get started easily. Today, if you have nothing to do, I will sort out some of the algorithm questions I wrote before, so that everyone can read it. If you think it is good, you can also click on the collection.
"You can see the next part of the series:"
Dynamic programming related algorithms
465. Recursive and dynamic programming to solve the triangle minimum path sum
430, the sword refers to Offer- dynamic programming to find regular expression matching
423, dynamic programming and recursive solution minimum path sum
413, dynamic programming to find the longest ascending subsequence
411, dynamic programming and recursive search for different paths II
409, dynamic planning for different paths
407, dynamic programming and sliding window to solve the longest repeated sub-array
395, dynamic programming to solve the wildcard matching problem
376, the edit distance of dynamic programming
370, the longest common substring and subsequence
Backtracking algorithm
451, Backtracking and bit operation solution subset
420, the sword refers to the path in the offer-backtracking algorithm solution matrix
391, Backtracking algorithm for combination problem
446, the backtracking algorithm solves the problem of gold miners
448. Several combined solutions
DFS and BFS related algorithm problems
455, the area surrounded by DFS and BFS solutions
453, DFS and BFS solution to find the sum of numbers from root to leaf node
445, BFS and DFS two ways to solve the number of islands
422, Sword Finger Offer- Use DFS and BFS to solve the robot's range of motion
417, BFS and DFS two ways to find the largest area of the island
Double pointer related issues
466. Use fast and slow pointers to convert an ordered linked list into a binary search tree
398, double pointer finds the longest substring without repeated characters
397, the double pointer seeks to catch the rain problem
396, the double pointer seeks to hold the most water container
447, double pointer unrotating linked list
449, the speed pointer solves the circular linked list
Binary tree correlation algorithm
464. BFS and DFS solution binary tree all paths
458, fill in the next right node pointer of each node II
457, the nearest common ancestor of the binary search tree
456, two ways to solve the right view of the binary tree
444, serialization and deserialization of binary trees
441, the sword refers to the post-order traversal sequence of the Offer-binary search tree
440, the sword refers to Offer-printing the binary tree from top to bottom II
439, the sword refers to Offer-print the binary tree from top to bottom
435, the sword refers to the Offer-symmetric binary tree
434, the sword refers to the mirror image of the offer-binary tree
433, the sword refers to the sub-structure of the Offer-tree
414, the sword refers to Offer-rebuild the binary tree
403, verify the binary search tree
401, delete the node in the binary search tree
400, zigzag hierarchical traversal of binary tree
399, Construct a binary tree from the pre-order and middle-order traversal sequence
388, Pre-order traversal to construct a binary tree
387, the maximum path sum in the binary tree
375, find the maximum value in each tree row
374, the minimum depth of a binary tree
372, the nearest common ancestor of the binary tree
367, the maximum depth of the binary tree
Linked List Related Algorithm
463. Three ways to judge palindrome linked list
462. Find the first common node of the two linked lists
461. Pairwise exchange of nodes in the linked list
460. Quick and slow pointer unwinding circular linked list II
459. 3 ways to delete the Nth node from the bottom of the linked list
432, the sword refers to Offer- 3 ways to reverse the linked list
431, the sword refers to the kth node from the bottom of the Offer-linked list
429, the sword refers to Offer-delete the node of the linked list
410, the sword refers to Offer-print the linked list from end to end
386, the next larger node in the linked list
381, merge two ordered linked lists (easy)
Stack related algorithms
438, the sword refers to the push and pop sequence of the Offer-stack
437, the sword refers to Offer-the stack containing the min function
416, the sword refers to Offer-using two stacks to implement the queue
Other classic algorithms
426, what is recursion, through this article, let you thoroughly understand recursion
394, the classic eight-queen problem and the N-queen problem
371, Knapsack Problem Series-Basic Knapsack Problem
356. Issues related to frog jumping
389, add two super large numbers
Bit operation related algorithms
357, swap the values of two numbers
361, alternate bit binary number
383, do not use "+", "-", "×", "÷" to realize the four arithmetic operations
364, the number series of bit 1 (one)
385, the number series of bit 1 (two)
402, the number series of bit 1 (three)
425, the sword refers to the number of 1s in Offer-Binary
data structure
352, data structure-2, linked list
368, data structure-5, hash table
Sort
Find
203, search-interpolation search
Other calculations
468、Two solutions to Timo’s attack
467. Recursive and non-recursive solution path sum problem
454, grouping of letter dysphoric words
443, the maximum sliding window
436, the sword refers to Offer-print matrix clockwise
427, the sword refers to the integer power of Offer-value
424, the sword refers to Offer-cut the rope
419, the sword refers to the smallest number of Offer-rotation array
418, the sword refers to the Offer-Fibonacci sequence
415, the best sightseeing combination
408, the sword refers to Offer-replace spaces
405、The problem of exchanging wine
406, the sword refers to the search in Offer- two-dimensional array
404, the sword refers to the repeated numbers in the Offer-array
392, check whether the array pair can be divisible by k
382, 5 problem-solving ideas for daily temperature
379, the largest rectangle in the histogram (difficult)
380, the missing first positive number (middle)
377. Adjust the array order so that odd numbers are in front of even numbers
351, the minimum number of moves makes the array elements equal II
350, the K-th smallest element in the ordered matrix
347, Guess the size of the number II
346, find the smallest K pair number
344, the largest divisible subset
342, Calculate the number of digits with different digits
There are too many, so I won’t list them one by one. You can check the WeChat official account ( data structure and algorithm ) for details.