Count Fertile Pyramids in a Land solution leetcode A farmer has a rectangular grid of land with m rows and n columns that can be divided into unit cells. Each cell is either fertile (represented by a 1) or barren (represented by a 0). All cells outside the grid are considered barren. Continue reading Count Fertile Pyramids in a Land solution leetcode
LCS Problem Dev C++ code #include <bits/stdc++.h> using namespace std; int lcs(string a, string b, int m, int n ) { if (m == 0 || n == 0) return 0; if (a[m-1] == b[n-1]) return 1 + lcs(a, Continue reading LCS Problem Dev C++ code
Kth Smallest Product of Two Sorted Arrays solution leetcode Given two sorted 0-indexed integer arrays nums1 and nums2 as well as an integer k, return the kth (1-based) smallest product of nums1[i] * nums2[j] where 0 <= i < nums1.length and 0 <= j < nums2.length. Example 1: Kth Smallest Product of Two Sorted Continue reading Kth Smallest Product of Two Sorted Arrays solution leetcode
The Time When the Network Becomes Idle solution leetcode There is a network of n servers, labeled from 0 to n – 1. You are given a 2D integer array edges, where edges[i] = [ui, vi] indicates there is a message channel between servers ui and vi, and they can pass any number Continue reading The Time When the Network Becomes Idle solution leetcode
Remove Colored Pieces if Both Neighbors are the Same Color solution leetcode There are n pieces arranged in a line, and each piece is colored either by ‘A’ or by ‘B’. You are given a string colors of length n where colors[i] is the color of the ith piece. Alice and Bob are Continue reading Remove Colored Pieces if Both Neighbors are the Same Color solution leetcode
inimum Number of Moves to Seat Everyone solution leetcode There are n seats and n students in a room. You are given an array seats of length n, where seats[i] is the position of the ith seat. You are also given the array students of length n, where students[j] is the position of the jth student. You may Continue reading inimum Number of Moves to Seat Everyone solution leetcode
Simple Polygon solution kickstart Round G You are given two integers, the number of vertices NN and area AA. You need to construct a simple polygon of NN vertices such that the area of the polygon is exactly A2A2, and all the vertices have non-negative integer coordinates with Continue reading Simple Polygon solution kickstart Round G – You are given two integers, the number of vertices NN and area AA. You need to construct a simple polygon of NN vertices such that the area of the polygon is exactly A2A2, and all the vertices have non-negative integer coordinates with value up to 109109.
Simple Polygon solution kickstart Round G You are given two integers, the number of vertices NN and area AA. You need to construct a simple polygon of NN vertices such that the area of the polygon is exactly A2A2, and all the vertices have non-negative integer coordinates with Continue reading Simple Polygon solution kickstart Round G
Banana Bunches Solution Kickstart You are given two integers, the number of vertices NN and area AA. You need to construct a simple polygon of NN vertices such that the area of the polygon is exactly A2A2, and all the vertices have non-negative integer coordinates with value up Continue reading Banana Bunches Solution Kickstart – You are given two integers, the number of vertices NN and area AA. You need to construct a simple polygon of NN vertices such that the area of the polygon is exactly A2A2, and all the vertices have non-negative integer coordinates with value up to 109109.
Staying Hydrated Solution Kickstart With online classes in full swing, it is important for Grace to take breaks and keep herself hydrated at all times. She has decided to place a water bottle in her room in the most convenient Continue reading Staying Hydrated Kickstart Solution – With online classes in full swing, it is important for Grace to take breaks and keep herself hydrated at all times. She has decided to place a water bottle in her room in the most convenient place