Recently, a friend chatted with me. He insisted on studying for 2 months and finally went to the big factory he dreamed of. The salary increase was very impressive. He also said that the current major domestic manufacturers and some unicorns have increasingly followed the practice of programming given questions through interviews to examine the solidity of data structures and algorithms.
In this way, even for developers who have worked for many years, they are easily hung up without training. So as to miss the best company. Shuaidi knew a lot of people with ordinary resumes before, and changed his trajectory into the big factory by brushing the questions, thus moving to a higher platform. Questions are really important
Because the algorithm is a necessary part of the technical interviews in big factories, business problems can be summarized and summarized, but the algorithm must rely on a solid foundation and the amount of questions.
The algorithm is not well-founded, and it is not only difficult for interviews, but also much weaker than others for the improvement of code performance and the control of programming languages. Therefore, it is difficult for students with a weak algorithm foundation to pass the interview with a big factory. However, only relying on questions to improve the algorithm's ability, the progress is too slow, and it is easy to fail to grasp the key points.
So, as a programmer, how do you learn algorithms well?
Reading a book? Video self-study?
Of course not! Because there are so many algorithmic knowledge points, the subject of enterprise investigation is ever-changing, and it will be combined with actual business. If you are self-study, it is difficult to persist without supervision, and there is no complete learning system and no one to guide, resulting in the final result is a little understanding, wasting a lot of time and cost.
The editor here is going to share with you a data structure and algorithm document + a high-frequency interview question on the algorithm and data structure of a big factory, with pictures and texts, very suitable for friends who need to learn data structures and algorithms! Due to space reasons, there is a need for data structure and algorithm notes. The complete document of the high-frequency interview questions on the algorithm and data structure of Dachang can be obtained for free!
Dachang algorithm and data structure high-frequency interview questions
Due to space reasons, friends who need data structure and algorithm documents + high-frequency interview questions of big factory algorithms and data structures can get them for free by scanning the code
One, stack and queue interview questions
-
Design a stack with getMin function
-
Queue composed of two stacks
-
How to order a stack using only recursive functions and stack operations
-
Cat and dog queue
-
Use one stack to sort another stack
-
Use stacks to solve the Tower of Hanoi problem
-
Generate an array of window maximums
-
Construct an array of MaxTree
-
Find the size of the largest matrix
-
The maximum value minus the minimum value is less than or equal to the number of sub-arrays of num
Second, the chain surface test questions
-
Print the common part of two ordered linked lists
-
Delete the Kth node from the bottom in the singly-linked list and the double-linked list
-
Delete the intermediate node of the linked list and the node at a/b
-
Reverse one-way and doubly linked lists
-
Reverse part of a singly linked list
-
Joseph's Problem of Circular Singly Linked List
-
Determine whether a linked list is a palindrome
-
Divide the singly linked list according to a certain value into the form of small left, equal middle, and large right
-
Copy the linked list with random pointer nodes
-
Two singly linked lists generate an additive linked list
Three, binary tree interview questions
-
Recursively and non-recursively implement binary tree pre-order, middle-order and post-order traversal
-
Print the boundary nodes of the binary tree
-
How to print a binary tree more intuitively
-
Serialization and deserialization of binary trees
-
God-level method of traversing binary trees
-
Find the longest path length whose cumulative sum is the specified value in the binary tree
-
Find the largest search binary subtree in the binary tree
-
Find the largest topological structure in the binary tree that meets the conditions of the search binary tree
Four, recursive and dynamic programming interview questions
-
Recursion and dynamic programming of Fibonacci series of problems
-
The minimum path sum of the matrix
-
The minimum amount of currency to exchange money
-
Number of ways to exchange money
-
Longest increasing subsequence
-
Tower of Hanoi
-
Longest common subsequence problem
-
Longest common substring problem
-
Dungeons and Dragons game problems
Five, string interview questions
-
Determine whether two strings are inflections of each other
-
The sum of number substrings in a string
-
Remove the substring with k consecutive 0s in the string
-
Determine whether two strings are mutually rotating words
-
Convert an integer string to an integer value
-
Replace the specified string that appears consecutively in the string
-
String statistics string
-
Determine whether all characters in the character array appear only once
Six, big data and space constraints interview questions
-
Understanding Bloom Filter
-
Use only 2GB of memory to find the most frequent number among 2 billion integers
-
Find a number that does not appear among 4 billion non-negative integers
-
Finding duplicate URLs in 10 billion URLs and the topK problem of search terms
-
Find the number that appears twice and the median of all numbers among 4 billion non-negative integers
-
The basic principle of consistent hashing algorithm
Seven, bit computing interview questions
-
No additional variables are used to exchange the values of two integers
-
Find the larger of the two numbers without any comparison and judgment
-
Use only bit operations without arithmetic operations to implement integer addition, subtraction, multiplication, and division operations
-
How many 1s are there in the binary representation of an integer
-
Find the odd number of occurrences in the array where other numbers appear even number of times
-
Find a number that appears only once in an array where other numbers appear k times
Eight: Array and Matrix Interview Questions
-
Circle printing matrix
-
Rotate the square matrix 90° clockwise
-
"Zigzag" printing matrix
-
Find the smallest number of k in the unordered array
-
The shortest array length that needs to be sorted
-
Find the number of occurrences greater than NIK in the array
-
Find numbers in a matrix with all rows and columns in order
-
The length of the longest integrable sub-array
-
Do not repeat print all the two-tuples and triples in the sorted array whose sum is a given value
-
The longest array length whose cumulative sum is a given value in an unsorted positive array
Java data structure and algorithm
The following is the directory:
This Java data structure and algorithm is a total of 584 pages, each chapter will be followed by chapter key questions and answers
Chapter 1: Overview of Data Structures and Algorithms
Chapter 2: Arrays
Chapter 3: Simple Sorting
Chapter 4: Stacks and Queues
Chapter 5: Linked List
Chapter 6: Recursion
Chapter 7: Advanced Sorting
Chapter 8: Binary Trees
Chapter 9: Red and Black Trees
Chapter 10: 2-3-4 Trees and External Storage
Chapter 11: Hash Table
Chapter 12: Heap
Chapter 13: Graphs
Chapter 14: Weighted Graphs
Chapter 15: Applications
Final words
Data structure and algorithms are the stepping stones of Internet giants, as well as the internal strength foundation for developers to strive for perfection and continuous improvement. Force yourself, follow the right teacher, find the right tutorial, learn the method, and overcome it step by step, and you will surely get the offer you are satisfied with.
Say the important thing a billion times: Scan the code and get it for free