I am a nerdy software engineer
I am available for projects and learning
May 11 · 13 min read · This is a walkthrough in conversation format. One developer is building their first Midnight contract. The other has shipped a few. What follows is the kind of conversation that saves you a week of de
Join discussion
Jan 15 · 3 min read · 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...
Join discussionJan 13 · 3 min read · 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...
Join discussionJan 12 · 2 min read · When navigating a 2D grid, the shortest path depends entirely on how you are allowed to move. In many competitive programming problems, you are restricted to horizontal and vertical movements (Manhattan Distance). However, what happens when you can m...
Join discussion
Jan 11 · 3 min read · 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...
Join discussion