1、Two Sum 2、Add Two Numbers 3、Longest Substring Without Repeating Characters 4. Median of Two Sorted Arrays 5、Longest Palindromic Substring 11. Container With Most Water 15. 3Sum 16. 3Sum Closest 17. Letter Combinations of a Phone Number 19. Remove Nth Node From End of List 20. Valid ...
LeetCode Top Interview Questions https://leetcode.com/problemset/top-interview-questions/
Only the space character ' ' is considered as whitespace character. Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. If the numerical value is out of the range of representable values, INT_MAX (231 ...
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below). How m...
LeetCode 指南语言: Java 说明: 每道题在代码头部都添加了我的解题思路和批注,Eg: /*** * 287. Find the Duplicate Number * 题意:n+1个数属于[1~n],找出重复的那个数 * 难度:Medium * 分类:Array, Two Pointers, Binary Search * 思路:如果nums[i]不在对应位置,则和对应位置交换。如果对应位置上...
/LeetCodeAnimation Demonstrate all the questions on LeetCode in the form of animation.(用动画的形式呈现解LeetCode题目的思路) 47.9k Java 01/09 3 /advanced-java 😮 互联网 Java 工程师进阶知识完全扫盲:涵盖高并发、分布式、高可用、微服务、海量数据处理等领域知识,后端同学必看,前端同学也可学习 37.6...
leetcode: https://leetcode.com/problems/rotate-image/ 解: [[1, 2, 3],[4, 5, 6],[7, 8, 9]]//The solution is to first take the transpose of the matrix.//After taking the transpose the resulting matrix is as follows.[[1, 4, 7],[2, 5, 8],[3, 6, 9]]//After the tr...
LeetCode Top Interview Questions 277. Find the Celebrity (Java版; Medium) 题目描述 Suppose you are at a party with n people (labeled from 0 to n - 1) and among them, there may exist one celebrity. The definition of a celebrity is that all the other n - 1 people know him/her but...
LeetCode Top 100 Liked Questions 617. Merge Two Binary Trees (Java版; Easy) welcome to my blog LeetCode Top 100 Liked Questions 617. Merge Two Binary Trees (Java版; Easy) 题目描述 第一次做; 核心:base case!; 递归函数逻辑:将传入的两个节点合并成一个节点, 让该节点分别连向处理好的左...
Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.