Maximum Profit from K Transactions
You have an array for which the i-th element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most k transactions.
ReadPartitioning an Array into K Equal Sum Subsets
Given an array of integers nums and a positive integer k, find whether it's possible to divide this array into k non-empty subsets whose sums are all equal.
ReadReversing Linked List Nodes in Groups of K
Reverse the nodes of a linked list, k at a time, and return the modified list.
ReadLongest Non-Contiguous, Non-Decreasing Subsequence
Find the longest non-contiguous, non-decreasing subsequence in an array of numbers.
ReadMaximum Points on a Line
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.
ReadMinimum Palindromic Partitions
Given a string, split it into as few strings as possible such that each string is a palindrome.
ReadBinary Tree Path Sums
You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need to start or end at the root or a leaf.
Read