01 Pinduoduo (2 side technology + HR side)
one side
- Talk about the project, very detailed
- Resolve written test questions
- Mqtt, Http, WebSocket protocol related content
- C++ polymorphism implementation
- Pre-compilation protection
- Dynamic link and static link
- Process fork process
- C++ constructor and destructor related
- Deep copy and shallow copy
- Virtual functions and inlining
- C++ memory allocation
- O(logn), O(n), O(nlongn), O(n^2), O(n^logn), O(n^3) algorithm each give an example
- The underlying implementation of map and hashMap
- Hash function, hash conflict related
- Stable sorting and unstable sorting, complexity of various sorting algorithms
- Graphql、 Restful
- Topic 1. Give a sequence, such as {1,4,6,3,8,7}, and then print the corresponding histogram
- Problem 2. Given a function g(x) can produce 1 with probability p, probability 1-p produces 0, let you write a f(x) with g(x), you can produce 1 with probability q, probability 1-q Produces 0;
Two sides
- The knowledge of the chat is very broad.
- Project related
- The difference between Tcp and Udp, Tcp congestion control, three-way handshake, HTTP protocol, ARP protocol, how to detect collisions, ICMP protocol, DNS protocol
- The process of data from the application layer to the physical layer and then to the application layer
- Memory alignment rules
- The difference between multithreading and multiprocessing
- Multi-thread synchronization
- Inter-process communication method
- Which message queues have been used
- Implementation of shared memory
- RPC
- System interrupt, interrupt vector table
- User space and kernel space switching
- IO model (blocking, non-blocking, IO multiplexing, signal-driven IO, asynchronous IO)
- select, poll, epoll
- epoll implementation
- Static link and dynamic link
- Virtual memory, program loading process
- The process of using TCP communication (create socket, bind, listen, accept...)
- Red-black tree, B tree, B+ tree
- Balance transformation process
- Comparison of hash and red-black tree
- Adapter mode (design mode)
- Implementation of iterator
- Kernel related (unlikely)
- The difference between golang and c++
- copy on write
- fork
- Daemon
- Soft connection and hard connection
- Heap sort process
- Topic: Handwriting insertion sort (just ask if you are lucky!)
HR face
......
02 Byte Beat (3 technical talk project + HR side)
one side
- Project related
- const, static, explict, volatile keywords
- Virtual function implementation (RTTI)
- Implementation and usage of several smart pointers
- C++11 new features
- Template specialization
- The difference between new and malloc
- C++ memory space layout
- Vector underlying implementation
- map, hashmap bottom layer implementation
- Rebase and merge usage (git)
- bss segment
- Multi-thread and synchronization, multi-process communication mode
- I have used the library, and the role of this library, to achieve (lcm, libconfig)
- Topic 1. Multi-thread alternate printing
- Topic 2. Reverse linked list (recursive and non-recursive methods)
Two sides
- Project related
- placement new
- Destructor and Constructor and Polymorphism
- How to restrict objects can only be created on the heap
- How to restrict objects can only be created on the stack
- How to make the class not be inherited
- How to control the memory allocation of vector
- Realization of multi-thread synchronization
- Singleton mode
- Factory mode
- Priority queue
- Implementation of iterator
- Range for statement and dynamic insertion and deletion
- There are still a lot of things that I can’t remember (chat-style interview, interview experience and good)
- Topic: The min() function to implement O(1) stack (dual stack method)
Three sides (nearly two hours)
- Chat project, super fine
- Some simple questions are basically mentioned above, so I won’t repeat them.
- Topic 1. Given a set of hundreds of thousands of ips, determine whether any ip belongs to this set
- Topic 2. Given a string, judge whether the string is looped or not (the string's first digit is connected, if a position can be found, the string obtained clockwise from this position is equal to the string obtained counterclockwise, which is Ring etc.)
- Topic 3. Math problem, use a formula to express the sum of all factors of a number N
03 360 (2 side technology + HR side)
one side
- Project related
- Polymorphic implementation
- Static keyword usage
- Pass by value and pass by reference
- RPC
- Implementation of message queue
- Implementation of epoll
- override, overload, overwrite
- Call C in c++
- Critical section
- Handwritten strcpy function
- I can’t remember the others, (I just woke up, the face was confused)
Two sides
- Project related
- websocket protocol
- JavaScript and C++ communication
- OSM (map related, mentioned in the project)
- Satellite positioning related
- Given a person's latitude and longitude, how to quickly locate which building a person is located in (index, multi-level index design)
HR face
......
04 NetEase (2 side technology + HR side)
one side
- static keyword
- const keyword
- Locality of program operation
- Program loading process
- Virtual Memory
- Deep copy, shallow copy
- What are the errors that cause the program to crash
- The difference between TCP and UDP
- TCP congestion control
- Multi-process and multi-thread
- Dynamic link and static link
- C++ polymorphic implementation (RTTI)
- Smart pointer implementation
- Vector dot product and cross product
- Topic 1. Full arrangement
- Topic 2. Find the projection of a vector on another vector
- Topic 3. Pick out some numbers in a sequence (two numbers cannot be adjacent), and find the maximum value of the sum of all the picked numbers (dynamic programming)
- Problem 4. Given a function g(x) can produce 1 with probability p, and probability 1-p produces 0. Let you write a f(x) with g(x), which can produce 1 with probability q, and probability 1-q Produces 0;
- What games do you usually play, your views on games, whether you can charge up or not, and your views on players who charge up...
Two sides
- Chat project
- Some C++ problems are basically covered
- Books I have read, what I want to talk about
- Topic 1. Given a sequence {1,7,4,2,5,9}, find a position and divide the array into two parts so that the difference between the sum of these two parts is the smallest (three methods)
- Question 2. Given a matrix, find the path and minimum value from the top left to the bottom right, and find this path;
- Topic 3. Mathematics, among the three boxes, one box contains a treasure. You choose a box at random, and then the system will remove a box without a treasure for you. In the next two boxes, you will stick to the original The choice or choose another one
HR face
......
Due to space reasons, I will not list the real interview questions of each major company one by one here. The editor has compiled these real questions and their detailed answer analysis into PDF documents, and those in need can click the portal ! !
MySQL 20 essential interview questions (including analysis) + 21 MySQL performance tuning practices
Distributed interview analysis
Data Structures and Algorithms
Design Patterns
Due to space reasons, I will not list the real interview questions of each major company one by one here. The editor has compiled these real questions and their detailed answer analysis into PDF documents, and those in need can click the portal ! !
Summary of the real questions for the architecture special interview (Java, distributed, framework, middleware, Redis, Spring, concurrency, threading, Tomcat, design patterns...)
