Cory Heidaran Charitable Foundation (CHCF)’s Post

Day 504 of Daily LeetCode | 2373. Largest Local Values in a Matrix (Easy) https://lnkd.in/e6G_bArF This function takes a square matrix grid as input and returns a new matrix where each element is the maximum value found in a 3x3 subgrid of the original matrix. It iterates over the matrix using a sliding window approach to extract these 3x3 subgrids, flattens them, and computes the maximum value for inclusion in the result matrix. The resulting matrix is smaller by a border of one cell around the original grid due to the window size.

I created LinkedList notes including definition, types, general node structure, Advantages & Disadvantages and Patterns that help to more understanding including all steps first I give definitions,types , general node structure, Advantages & Disadvantages that Portion

topic: method overloading and constructor overloading https://lnkd.in/gUEXq9zi #100daysofcode #day8

Array [] Of Object {} And Map() Method

What is a linear structural system?

Dynamic test of pile foundation . 2% of the total pile foundation is tested.

Explaining the structure and components of package.json:

Day 43 of LeetCode | Minimum Size Subarray Sum Today, I tackled the "Minimum Size Subarray Sum" problem. The objective was to find the minimal length of a contiguous subarray with a sum greater than or equal to a given target value. If no such subarray exists, the function should return 0. I approached this problem using the sliding window technique. As I traversed through the array, I maintained a running sum and adjusted the window size dynamically. Whenever the sum met or exceeded the target, I shrunk the window from the left to see if I could get a smaller subarray with the same condition. Watch the full breakdown here: https://lnkd.in/eXwCWsFP

Similar to array insertion is one of the basic operations in a linked list also. But instead of shifting element, it is much easy to insert in an element in a linked list, you just have to point the pointers of previous element to the inserted element and then point it to next element- easy-peasy. Similarly you can create a linked list from scratch by inserting first element who points to null until next element is inserted.

Chart of types of extension header with suitable example, help me to understand the phenomenon of next header with respect to extension header