问题：
Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal to the end point of the interval i, which can be called that j is on the “right” of i.
For any interval i, you need to store the minimum interval j’s index, which means that the interval j has the minimum start point to build the “right” relationship for interval i. If the interval j doesn’t exist, store -1 for the interval i. Finally, you need output the stored value of each interval as an array.

问题：
Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.
Example:

问题：
Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
Example 1:

一面：
上来问了三个算法
1.两个链表相加

Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.

问题：
Given a binary tree, return all root-to-leaf paths.
Note: A leaf is a node with no children.

问题：
Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.

一天来百度两个部门的面试，确实有点吃不消。
百度云
一面：自我介绍
.ArrayList和LinkedList区别

今年的就业形式是真的紧张，看着周围的同学们都各种投递实习简历，我也耐不住投了阿里、网易、pdd，网易是简历一直在投递状态，pdd是笔试完就没有下文了，后来听说是网易今年裁员太严重，已经不招人了，pdd是已经在线下招人招够了，线上只是走形式了，哈哈，然后就逼着自己硬着头皮面阿里了。

讲真，去年面过百度和头条的实习，发现阿里的周期是真的长，从3月31号到4月18号还在等HR面。

最近导师安排个项目，硬件设备是利用http post的方式向服务器发送数据，原来一直是用java自带的http请求进行编码的，但是考虑到该项目后续会有高并发的问题，就采用了netty的方式来实现http server端。大家如果对netty不太熟悉的同学可以去看《netty权威指南》，链接走起~~~https://pan.baidu.com/s/1jnVoKWhL4TQiIg15gpFlkQ