tag

#iteration

3 pages tagged

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 386: Lexicographical Numbers

Problem Restatement We are given an integer n . We need to return all numbers from 1 to n in lexicographical order. Lexicographical order means dictionary order, as if the numbers were strings. For example, when n = 13 , the numbers are ordered like this: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9] The problem asks for an algorithm that runs in O(n) time...
leetcode depth-first-search trie iteration May 10, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 203: Remove Linked List Elements

Problem Restatement We are given the head of a singly linked list and an integer val . We need to remove every node whose value equals val . Return the new head of the linked list after all removals. The official statement says: given the head of a linked list and an integer val , remove all the nodes of the linked list that have Node.val == val , and...
leetcode linked-list iteration May 10, 2026
Wiki › Algorithms › 02. Data Structures › 1. Core Data Structures and Operations › 1.1 Arrays and Dynamic Arrays ›

Array Scan

Array Scan Array scan processes elements sequentially from left to right (or right to left). It forms the basis of many algorithms, including aggregation, filtering, searching, and transformations. You use it when every element must be inspected at least once. Problem Given an array $A$ of length $n$, compute an aggregate value such as: $$ \sum_{i=0}^{n-1} A[i] $$ or apply a function to each element. Algorithm Sequential scan: scan(A, f,...
data-structures arrays scan iteration