287. Find the Duplicate Number
Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), pro…
142. Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note…
49. Group Anagrams
Given an array of strings, group anagrams together. For example, given: [“eat”, “tea”, “tan”, “ate”,…
Queue & Stack解题方法小结
LeetCode上的相关题目(easy) 155, 225, 232, 346 常用方法 Stack: push(), pop(), peak(), empty() Queue(LinkedList)…
346. Moving Average from Data Stream
Given a stream of integers and a window size, calculate the moving average of all integers in the sl…
155. Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. pu…
225. Implement Stack using Queues
Implement the following operations of a stack using queues. push(x) — Push element x onto stac…
232. Implement Queue using Stacks
Implement the following operations of a queue using stacks. push(x) — Push element x to the ba…
Array解题方法小结
LeetCode上的相关题目(easy) 26, 27, 35, 48, 88 118, 119, 121, 122, 136, 162, 167, 169 217, 219, 243, 268, …
Senior front-end Engineer Interview – 高级前端工程师面试准备知识清单
最近接到一个偏前端的面试通知，作为一个老司机，突然发现无从下手，前端不就是HTML + CSS + JS三件套嘛，好像什么都挺清楚的，但是深入一想，好像知识体系还是非常模糊的，这里特地整理下材料，希望…