Programming interview questions, tips and knowledge, system design, big data.

##题目 ####Interleaving String Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example,Given:s1 = "aabcc",s2 = "dbbca", When s3 = "aadbbcbcac", return true.When s3 = "aadbbbaccc", return false.

##题目 ####Intersection of Two Linked Lists Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: A: a1 → a2 ↘ c1 → c2 → c3 ↗ B: b1

##题目 ####Isomorphic Strings Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may

##题目 ####Jump Game II Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps. For example:Given array A

##题目 ####Jump Game Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index. For example:A = [2,3,1,1,4], return true. A =

##题目 ####Kth Largest Element in an Array Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. For example,Given [3,2,1,5,6,4] and k = 2, return 5. ####Note:You may assume k is always valid, 1 ≤ k ≤ array’s leng

##引言由于国外的很多会议都使用LaTeX进行排版，例如自然语言处理顶级会议ACL。因此，为了投国外的期刊与会议，我也开始学习LaTeX。 但是遗憾的是，现有的LaTeX入门教材都太长了，导致我这个想半天搞定它开始写论文的想法付之东流。因此，在这里，只为了能够快速入门LaTeX,本人写了这一篇入门教程，其中只涉及到写论文的基本知识点，让您能够半天搞定LaTeX。 当涉及到高级知识的方面，请自行找“谷哥”和“度娘”。

##题目 ####Largest Number Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330. Note: The result may be very large, so you need to return a string instead of an integer. ####Credits:Speci

##题目 ####Largest Rectangle in Histogram Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram. Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3]. The largest rectangle

##题目 ####LRU Cache Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set. get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.set(key, value) - Set or insert th

##题目 ####Length of Last Word Given a string s consists of upper/lower-case alphabets and empty space characters ‘ ‘, return the length of last word in the string. If the last word does not exist, return 0. ####Note:A word is defined as a character sequence consists of non-space characters only. For

##题目 ####Letter Combinations of a Phone Number Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. > Input:Digit string “23” Output: [“ad”, “ae”, “af”, “bd”, “be”

##题目 ####Linked List Cycle II Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Follow up:Can you solve it without using extra space?

##题目 ####Linked List Cycle Given a linked list, determine if it has a cycle in it. Follow up:Can you solve it without using extra space?

该节主要讲解ls,cd,pwd 命令。 这里对linux常用的命令进行整理，以便日后查看。–来自实验楼。

该节主要讲解cut,paste,tr 命令。 这里对linux常用的命令进行整理，以便日后查看。–来自实验楼。

该节主要讲解more,less,head,tail 命令。 这里对linux常用的命令进行整理，以便日后查看。–来自实验楼。

该节主要讲解comm,diff,patch 命令。 这里对linux常用的命令进行整理，以便日后查看。–来自实验楼。

该节主要讲解find,xargs 命令。 这里对linux常用的命令进行整理，以便日后查看。–来自实验楼。

该节主要讲解mkdir,rm,mv,cp,cat,nl 命令。 这里对linux常用的命令进行整理，以便日后查看。–来自实验楼。