Explore skills

AlphaFold/ESMFold structure prediction and confidence interpretation.

Prefix tree for O(m) string insert/search and O(p+k) prefix queries; ideal for autocomplete and dictionary membership.

Topological sort using DFS and Kahn's BFS algorithms for DAG ordering, cycle detection, and critical path analysis.

A completion-claim gate that requires outputting the self-check table and fixing any ✗ rows before reporting completion. This is a lean discipline-gate version.

Bottom-up Dynamic Programming with tabulation, covering edit distance, LCS, and space optimization using rolling arrays.

Suffix arrays are a space-efficient sorted suffix index, offering O(n log n) construction and O(m log n) pattern search.

Stack (LIFO) and Queue (FIFO) — array and linked-list implementations, O(1) operations, common applications.

Score matching, noise schedules, DDIM sampling, and DDRM inverse problems for diffusion generative models.

Needleman-Wunsch global and Smith-Waterman local sequence alignment, including DP table fill, traceback, and scoring matrices.

Red-black tree: a self-balancing BST with O(log n) operations, maintaining 5 invariants, and fixing insertions with rotations and recoloring.

Naive O(nm) brute-force string matching — sliding window baseline, when acceptable, motivation for KMP/Rabin-Karp.

Counting sort, radix sort, and bucket sort are O(n) non-comparison sorts that bypass the Omega(n log n) lower bound.