摘要：
package _interview_question /** * we have 2 arrays in sorted order, no duplicates. we need find the max continuous length AP [arithmetic prog] in the 阅读全文
摘要：
package LeetCode_1027 import kotlin.collections.HashMap /** * 1027. Longest Arithmetic Subsequence * https://leetcode.com/problems/longest-arithmetic- 阅读全文
摘要：
/** *The Sieve of Eratosthenes is an algorithm used to generate all prime numbers smaller than N. * The method is to take increasingly larger prime nu 阅读全文
摘要：
package LeetCode_1027 /** * 1027. Longest Arithmetic Subsequence * https://leetcode.com/problems/longest-arithmetic-subsequence/description/ * * Given 阅读全文
摘要：
package LeetCode_346 import java.util.* /** * 346. Moving Average from Data Stream * (Prime) * Given a stream of integers and a window size, calculate 阅读全文
摘要：
package LeetCode_413 /** * 413. Arithmetic Slices * https://leetcode.com/problems/arithmetic-slices/description/ * * A sequence of numbers is called a 阅读全文
摘要：
package LeetCode_414 /** * 414. Third Maximum Number * Given a non-empty array of integers, return the third maximum number in this array. * If it doe 阅读全文
摘要：
package LeetCode_1472 import java.util.* /** * 1472. Design Browser History * https://leetcode.com/problems/design-browser-history/description/ * * Yo 阅读全文
摘要：
package LeetCode_410 /** * 410. Split Array Largest Sum * https://leetcode.com/problems/split-array-largest-sum/description/ * * Given an array nums w 阅读全文
摘要：
package LeetCode_1603 /** * 1603. Design Parking System * https://leetcode.com/problems/design-parking-system/description/ * */ class ParkingSystem(bi 阅读全文