Leetcode Blind 75

Lite version of LeetCode Blind 75 question bank

I compiled this LeetCode Blind 75 question bank because the version I found on other platforms is not on LeetCode (for unknown reasons!). Therefore, all the questions in this list are on the LeetCode platform.

Note: Some questions are paid content. If you find free versions of these questions on other platforms, please share them in the comment area, thank you!

If you have enough time, please visit my warehouse: Blind-75

Array

1. Sum of two numbers
2. The best time to buy and sell stocks
3. Duplicate elements exist
4. The product of arrays other than itself
5. Maximum subsequence sum
6. Maximum product subarray
7. Minimum value in rotated sorted array
8. Search rotated sorted array
9. Sum of three numbers
10. The container that holds the most water

Binary

1. Sum of two integers
2. Number of bit 1
3. Bit count
4. Lost Numbers
5. Inversion bit

Dynamic Planning

1. Climb the stairs
2. Change Exchange
3. Longest increasing subsequence
4. Longest common subsequence
5. Word Splitting
6. Combined sum
7. Robbery
8. Robbery II
9. Decoding method
10. Different paths
11. Jumping Game

Picture

1. Clone image
2. Course Schedule
3. Course Schedule II
4. Pacific-Atlantic water flow problem
5. Number of islands
6. The longest continuous sequence
7. Alien Dictionary (LeetCode paid)
8. Graphic valid tree (LeetCode paid)
9. The number of connected components in an undirected graph (LeetCode paid)

Interval

1. Insert range
2. Merge interval
3. No overlapping intervals
4. Meeting Room (LeetCode paid)
5. Conference Room II (LeetCode paid)

Linked list

1. Reverse linked list
2. Circular linked list
3. Merge two ordered linked lists
4. Merge k sorted linked lists
5. Delete the Nth node from the bottom of the linked list
6. Rearrange linked list

Matrix

1. Matrix zero
2. Spiral Matrix
3. Rotate image
4. Word Search

String

1. The longest substring without repeated characters
2. Longest repeating character replacement
3. Minimum window substring
4. Valid letter anagrams
5. Alphabetic anagram grouping
6. Valid brackets
7. Number of palindromes
8. The longest palindromic substring
9. Palindrome substring
10. Encoding and decoding strings (LeetCode paid)

Tree

1. Maximum depth of binary tree
2. Same tree
3. Flip Binary Tree
4. Binary tree maximum path sum
5. Binary tree level-order traversal
6. Serializing and Deserializing Binary Trees
7. Subtree of binary tree
8. Construct a binary tree from pre-order and in-order traversal sequences
9. Verify Binary Search Tree
10. The Kth smallest element in the binary search tree
11. The nearest common ancestor of a binary search tree
12. Implement Trie (prefix tree)

Okay, my name is Jaimin Bariya. I write about data structures and algorithms, Python, AI-ML, and React, but I love all of these areas. If you found this article helpful, please like, favorite, and share it on your LinkedIn (if you’re ready to start the challenge today).

If you are free, please leave a message in the comment area and tell me the topic you would like to see my next article. See you next time ? ?

Happy programming :)

The above is the detailed content of Leetcode Blind 75. For more information, please follow other related articles on the PHP Chinese website!