Problem statement Given an m x n matrix matrix and an integer k, return the max sum of a rectangle in the matrix such that its sum is no larger than k. It is guaranteed that there will be a rectangle with a sum no larger than k. Problem statement tak...
Problem statement Given an integer array nums, return the maximum difference between two successive elements in its sorted form. If the array contains less than two elements, return 0. You must write an algorithm that runs in linear time and uses lin...
Problem statement Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return the reordered list. The first node is considered odd, and the second node is even, and so on. ...
Problem statement Write a program to solve a Sudoku puzzle by filling the empty cells. A sudoku solution must satisfy all of the following rules: Each of the digits 1-9 must occur exactly once in each row. Each of the digits 1-9 must occur exactly on...
Problem statement Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class: LRUCache(int capacity) Initialize the LRU cache with positive size capacity. int get(int key) Return the valu...
Problem statement You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interv...
Problem statement Given an integer array nums and an integer k, return the Kth largest element in the array. Note that it is the Kth largest element in the sorted order, not the Kth distinct element. You must solve it in O(n) time complexity. Problem...
Problem statement A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that: Every adjacent pair of words differs by a single letter. Every si for 1...
Problem statement Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring. Problem statement taken from: https://leetcode.com/problems/longest-valid-parentheses Example 1: ...