You are given a 2D matrix of size m x n, consisting of non-negative integers. You are also given an integer k. The value of coordinate (a, b) of the matrix is the XOR of all matrix[i][j] where 0 <= i <= a < m and 0 <= j <= b < n (0-indexed). Find the kth largest value (1-indexed) of all the coordinates of matrix.
We have a collection of stones, each stone has a positive integer weight.
Given a binary string s, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
Given a `m * n` grid, where each cell is either `0` (empty) or `1` (obstacle). In one step, you can move up, down, left or right from and to an empty cell. Return the minimum number of steps to walk from the upper left corner `(0, 0)` to the lower right corner `(m-1, n-1)` given that you can eliminate **at most** `k` obstacles. If it is not possible to find such walk return -1.
Given the `root` of a binary tree, return *the sum of values of its deepest leaves*.
Consider a directed graph, with nodes labelled `0, 1, …, n-1`. In this graph, each edge is either red or blue, and there could be self-edges or parallel edges. Each `[i, j]` in `red_edges` denotes a red directed edge from node `i` to node `j`. Similarly, each `[i, j]` in `blue_edges` denotes a blue directed edge from node `i` to node `j`. Return an array `answer` of length `n`, where each `answer[X]` is the length of the shortest path from node `0` to node `X` such that the edge colors alternate along the path (or `-1` if such a path doesn’t exist).
You are given an array of `k` linked-lists `lists`, each linked-list is sorted in ascending order. *Merge all the linked-lists into one sorted linked-list and return it.*
Given a set of points in the xy-plane, determine the minimum area of a rectangle formed from these points, with sides parallel to the x and y axes.
Given an array `nums` with `n` integers, your task is to check if it could become non-decreasing by modifying **at most one element**.
Given the `root` of a binary tree, return *the bottom-up level order traversal of its nodes’ values*. (i.e., from left to right, level by level from leaf to root).