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
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
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
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
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:
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