LeetCode 53: Maximum Subarray
Problem DescriptionGiven an integer array nums, find the subarray with the largest sum, and return its sum.Example 1Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: The subarray [4,-1,2,1]
LeetCode 1235: Maximum Profit in Job Scheduling
Problem DescriptionWe have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i].You're given the startTime, endTime and profit arrays, retur
LeetCode 2781: Length of the Longest Valid Substring
Problem DescriptionYou are given a string word and an array of strings forbidden.A string is called valid if none of its substrings are present in forbidden.Return the length of the longest valid subs
Java Miscellaneous
Sort a two-dimensional array:Suppose intervals is a two-dimensional array int[][].Arrays.sort( intervals, (a,b)->Integer.compare(a[0], b[0]) );Note how the lambda expression is writte. Or you can w
Common Concepts and Algorithms for Coding Interview
This post summarizes several common concepts and algorithms that can be helpful for coding interview. The concept is taken from the Book: Cracking the Coding Interview.Bit ManipulationBit operations:
Basic Data Structures
OverviewThis post will cover several data structures which are important for coding interview. Definitions, implementations, and common usages will be discussed. The following data structures are incl
LeetCode 45: Jump Game II
Problem DescriptionYou are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0].Each element nums[i] represents the maximum length of a forward jump from index
Good LeetCode Problems
The post maintains a list of leetcode problems that deserve a second try after some time but are less tricky so we do not provide the solution here.43. Multiple Strings44. Wildcard Matching49. Group A
LeetCode 42: Trapping Rain Water
Problem DescriptionGiven n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.Example 1Input: height = [0,1,0,2,1,0,
LeetCode 35: Search Insert Position
Problem DescriptionGiven a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You mu