Find the maximum sum of any continuous subarray of size K
You are given an array of integers with size N, and a number K. Find the maximum sum of continuous subarray of size K.
The Archive of
Intentional Thought
Technical essays, architectural deep-dives, and practical guides at the intersection of code and design.
Page 15 of 30
Graph Topological Sorting - Build System Order Example
Topological sort on a DAG using DFS — explained with a build system dependency example where packages must be compiled in dependency order.
Binary Tree - Level Order Traversal
Given a Binary tree, print out nodes in level order traversal from left to right.
Four Sum - Leet Code Solution
LeetCode "4Sum" solved by sorting plus fixing two elements and two-pointering the rest, skipping duplicates, with full code walkthrough.
Leetcode - Rearrange Spaces Between Words
LeetCode "Rearrange Spaces Between Words" solved by counting spaces and dividing them evenly between word gaps, with full code walkthrough.
Leetcode - Maximum Non Negative Product in a Matrix
LeetCode "Maximum Non-Negative Product in a Matrix" solved with a max/min dynamic programming table, with full code walkthrough.
Leetcode - Split a String Into the Max Number of Unique Substrings
Given a string s, return the maximum number of unique substrings that the given string can be split into.
Crawler Log Folder - Leet Code Solution
LeetCode "Crawler Log Folder" solved by tracking folder depth with a simple counter, with full code walkthrough and complexity analysis.
Replace all spaces in a string with %20
Replace all spaces in a string with '%20' (three characters). Do this in place and assume you have enough space in array
Determine if a string has all unique characters
Implement an algorithm to determine if a string has all the characters as unique.
Valid Palindrome - Leet Code Solution
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
Valid Anagrams - Leet Code Solution
Given two strings s and t , write a function to determine if t is an anagram of s.