Search for a command to run...
Series
A compilation of LeetCode DSA Hard and Medium problems solved in Rust
Geometry-based coding challenges often look intimidating because of coordinates and constraints, but they frequently boil down to finding patterns in sequences. A perfect example is the Maximum Square Hole Area problem. In this article, we’ll explore...
Link : https://leetcode.com/problems/separate-squares-i/ When working with computational geometry, we often face challenges involving area distribution. A classic example is finding a specific line that divides a set of shapes—in this case, squares—i...
The Challenge link :https://leetcode.com/problems/maximal-rectangle Given a binary matrix, we need to find the largest area of a rectangle consisting only of 1s. Example Matrix: 1 0 1 0 0 1 0 1 1 1 1 1 1 1 1 1 0 0 1 0 In this case, the maximal recta...
When we are asked to make two strings equal by deleting characters, our first instinct might be to find the Longest Common Subsequence (LCS). This problem is almost exactly that, but with a twist: instead of counting the number of characters, we are ...
When working with binary trees, we often need to identify specific nodes based on their depth. A classic challenge is finding the smallest subtree that contains every single deepest node in the tree. In this post, we’ll break down the logic, visualiz...
When you first encounter the Max Dot Product of Two Subsequences problem on LeetCode, it might look like a variation of the Longest Common Subsequence (LCS). However, the inclusion of negative numbers and the requirement for a non-empty result adds a...