Pattern Matching
Everything on SkillVeris tagged Pattern Matching — collected across the glossary, study notes, blog, and cheat sheets.
16 resources across 3 libraries
Study Notes(1)
Cheat Sheets(6)
F# Cheat Sheet
Core syntax for F#, covering bindings, functions, pipelines, discriminated unions, and pattern matching on .NET.
Erlang Cheat Sheet
Core Erlang syntax covering modules, pattern matching, recursion, and the actor-model process/message-passing primitives.
Racket Cheat Sheet
Fundamental Racket syntax covering definitions, higher-order functions, list operations, and pattern matching with match.
OCaml Cheat Sheet
Practical OCaml syntax covering let bindings, pattern matching, lists, and algebraic data types like records, variants, and options.
C# Records & Pattern Matching Cheat Sheet
Explains C# records for immutable value-based types, the with expression, and modern pattern matching including property and positional patterns.
Scala Functional Programming Cheat Sheet
Covers Scala functions and currying, pattern matching, functional collection operations, and core functional programming concepts like immutability.
Interview Questions(9)
How Do You Find the Longest Common Substring?
The longest common substring is the longest contiguous block of characters that appears identically in both strings, found with a 2D dynamic programming table…
What is a Suffix Tree?
A suffix tree is a compressed trie containing every suffix of a given string, built in O(n) time, that lets you answer substring existence, longest common subs…
What is the KMP String Matching Algorithm?
The Knuth-Morris-Pratt (KMP) algorithm finds all occurrences of a pattern in a text in O(n + m) time by precomputing a failure function (also called the longes…
What is the Rabin-Karp Algorithm?
Rabin-Karp finds pattern occurrences in a text by hashing the pattern and every equal-length substring of the text using a rolling hash, comparing hash values…
What is the Z-Algorithm for String Matching?
The Z-algorithm computes, for every position in a string, the length of the longest substring starting there that also matches a prefix of the whole string, bu…
How Do You Construct a Suffix Array?
A suffix array is built by generating every suffix of a string, sorting those suffixes lexicographically, and storing only their starting indices, which naive…
Knuth-Morris-Pratt vs Rabin-Karp: What is the Difference?
KMP guarantees O(n + m) worst-case time by precomputing a failure function that avoids re-scanning matched characters after a mismatch, while Rabin-Karp uses r…
What is the Aho-Corasick Algorithm?
Aho-Corasick is a multi-pattern string-matching algorithm that builds a trie of all patterns augmented with failure links, letting it search text for every occ…
What is a Sealed Class?
A sealed class is a class (or interface) that explicitly restricts which other classes are allowed to extend or implement it, using a “permits” clause naming t…