InfoSecPractitioner

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 Explanat...

118. Pascal's Triangle119. Pascal's Triangle II

2. Add Two Numbers67. Add Binary

EasyYou are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?0ms:public int climbStairs(int n)

206. Reverse Linked List92. Reverse Linked List II

EasyGiven a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3.2ms: public ListNode deleteD

EasyA binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59).Each LED represents a zero or one, with the least significant bit on

169. Majority Element229. Majority Element II

EasyGiven a string, find the first non-repeating character in it and return it’s index. If it doesn’t exist, return -1.Examples:s = “leetcode” return 0.s = “loveleetcode”, return 2. Note: You may as

EasyFind the sum of all left leaves in a given binary tree.Example:3/ \ 9 20 / \ 15 7There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.9ms: pub

15. 3Sum16. 3Sum Closest

1 . Two Sum EasyGiven an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution.Example: Given

217. Contains Duplicate219. Contains Duplicate II220. Contains Duplicate III

EasyGiven a binary tree, return all root-to-leaf paths.For example, given the following binary tree:1 / \ 2 3 \ 5 All root-to-leaf paths are:[“1->2->5”, “1->3”]5ms:public List<String> bi

112 . Path Sum EasyGiven a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example: Given the below bin

EasyGiven 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 define

MediumThere are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it’s off or turning

160 Intersection of Two Linked Lists EasyWrite 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 ...

242.Valid Anagram383. Ransom Note389. Find the Difference

EasyGiven a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.This is case sensitive, for example “Aa” is not cons

39.Combination Sum40.Combination Sum II216.Combination Sum III377.Combination Sum IV

Easy Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Rectangle Area Assume that

7. Reverse Integer190. Reverse Bits

EasyFind the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, …Note: n is positive and will fit within the range of a 32-bit signed integer (n < 231).Example 1:Input: 3Ou

EasyThe count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, …1 is read off as “one 1” or 11. 11 is read off as “two 1s” or 21. 21 is read off as “one 2,

EasyRotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note: Try to come up as many solutions as you can,

198. House Robber213. House Robber II337. House Robber III

MediumGiven a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, re

144. Binary Tree Preorder Traversal94. Binary Tree Inorder Traversal

MediumGiven a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case

MediumGiven an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O(n)

EasyDescription:Count the number of prime numbers less than a non-negative number, n.超时： public int countPrimes(int n) { int[] primes = new int[n/2+1]; int p = 0; int i = 2;

283. Move Zeroes26. Remove Duplicates from Sorted Array

235. Lowest Common Ancestor of a Binary Search Tree236. Lowest Common Ancestor of a Binar

EasyCompare two version numbers version1 and version2. If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and c

168. Excel Sheet Column Title171. Excel Sheet Column Number

EasyInvert a binary tree. 4/ \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 10ms: public TreeNode invertTree(TreeNode root) { if(root==null)

EasyGiven two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.0ms: public boo

EasyMerge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.2ms: public ListNode mergeTwoLists(ListNode l1, ListNode

EasyGiven a linked list, swap every two adjacent nodes and return its head.For example, Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. You ma