129 articles

📰 Dev.to · tracelit

Articles from Dev.to · tracelit · 129 articles · Updated every 3 hours · View all reads

All ⚡ AI Lessons (10511) ArXiv cs.AIDev.to · FORUM WEBDev.to AIForbes InnovationOpenAI NewsHugging Face Blog
LeetCode 323: Number Of Connected Components In An Undirected Graph — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 323: Number Of Connected Components In An Undirected Graph — Step-by-Step Visual Trace
Given n nodes labeled from 0 to n-1 and a list of undirected edges, return the number of connected components in the graph.
LeetCode 435: Non Overlapping Intervals — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 435: Non Overlapping Intervals — Step-by-Step Visual Trace
Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.
LeetCode 268: Missing Number — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 268: Missing Number — Step-by-Step Visual Trace
Given an array nums containing n distinct numbers in the range [0, n], find the one number that is missing from this range.
LeetCode 1851: Minimum Interval To Include Each Query — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 1851: Minimum Interval To Include Each Query — Step-by-Step Visual Trace
Given a list of intervals and queries, find the minimum length interval that contains each query point, returning -1 if no interval contains the query.
LeetCode 155: Min Stack — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 155: Min Stack — Step-by-Step Visual Trace
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. All operations must be performed in O(1) time complexity.
LeetCode 746: Min Cost Climbing Stairs — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 746: Min Cost Climbing Stairs — Step-by-Step Visual Trace
Find the minimum cost to reach the top of a staircase where you can climb either 1 or 2 steps at a time, and each step has an associated cost. You can start fro
LeetCode 21: Merge Two Sorted Lists — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 21: Merge Two Sorted Lists — Step-by-Step Visual Trace
Merge two sorted linked lists into one sorted linked list by splicing together the nodes of the first two lists.
LeetCode 252: Meeting Rooms — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 252: Meeting Rooms — Step-by-Step Visual Trace
Given an array of meeting time intervals, determine if a person could attend all meetings without any conflicts. Return false if any two meetings overlap in tim
LeetCode 253: Meeting Rooms Ii — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 253: Meeting Rooms Ii — Step-by-Step Visual Trace
Given a list of meeting time intervals, determine the minimum number of meeting rooms required to schedule all meetings without conflicts.
LeetCode 53: Maximum Subarray — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 53: Maximum Subarray — Step-by-Step Visual Trace
Find the contiguous subarray within a one-dimensional array of numbers that has the largest sum and return that sum.
LeetCode 152: Maximum Product Subarray — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 152: Maximum Product Subarray — Step-by-Step Visual Trace
Find the contiguous subarray within an array of integers that has the largest product and return that product.
LeetCode 695: Max Area Of Island — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 695: Max Area Of Island — Step-by-Step Visual Trace
Find the maximum area of an island in a 2D binary grid where 1 represents land and 0 represents water. An island is formed by connecting adjacent lands horizont
LeetCode 146: Lru Cache — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 146: Lru Cache — Step-by-Step Visual Trace
Design and implement a data structure for Least Recently Used (LRU) cache that supports get and put operations in O(1) time complexity.
LeetCode 3: Longest Substring Without Repeating Characters — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 3: Longest Substring Without Repeating Characters — Step-by-Step Visual Trace
Find the length of the longest substring within a given string that contains all unique characters with no repeating characters.
LeetCode 424: Longest Repeating Character Replacement — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 424: Longest Repeating Character Replacement — Step-by-Step Visual Trace
Find the length of the longest substring containing the same letter that you can get after performing at most k character replacements. You can replace any char
LeetCode 300: Longest Increasing Subsequence — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 300: Longest Increasing Subsequence — Step-by-Step Visual Trace
Find the length of the longest strictly increasing subsequence in an array of integers. A subsequence maintains the relative order of elements but doesn''t need
LeetCode 329: Longest Increasing Path In A Matrix — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 329: Longest Increasing Path In A Matrix — Step-by-Step Visual Trace
Find the length of the longest increasing path in a matrix where you can move in four directions (up, down, left, right) to adjacent cells with strictly increas
LeetCode 1143: Longest Common Subsequence — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 1143: Longest Common Subsequence — Step-by-Step Visual Trace
Find the length of the longest common subsequence (LCS) between two strings, where a subsequence maintains the relative order of characters but doesn''t need to
LeetCode 141: Linked List Cycle — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 141: Linked List Cycle — Step-by-Step Visual Trace
Given the head of a linked list, determine if the linked list has a cycle in it. A cycle exists if there is some node in the list that can be reached again by c
LeetCode 84: Largest Rectangle In Histogram — Step-by-Step Visual Trace
Dev.to · tracelit 4d ago
LeetCode 84: Largest Rectangle In Histogram — Step-by-Step Visual Trace
Find the area of the largest rectangle that can be formed in a histogram represented by an array of bar heights. Each bar has width 1 and the rectangle must be