docs/CATALOG.md

Project catalog

65 domain families × 4 cumulative project tiers = 260 tasks. Each ID below identifies a complete from-scratch project, not a patch. See README for contracts and correlation limitations.

#	Family	Category	Domain behavior
001	word_frequency	text	Input: text (string). Tokenize maximal ASCII [a-z0-9]+ runs after lowercasing. Return [{word,count}], sorted by decreasing count then ascending word. Non-ASCII letters are separators.
002	slug_registry	text	Input: titles (list of strings). Lowercase each, replace maximal runs outside ASCII a-z0-9 with a hyphen, strip hyphens, use "item" if empty. Assign in input order. If already used, append -2, -3, ... to the base until globally unique. Return slugs.
003	run_length	text	Input: text (string). Return [character,count] pairs for consecutive identical Unicode code points; retain order and include whitespace. Empty text produces [].
004	bracket_audit	text	Input: text. Audit (), [], {} ignoring all other code points. Return {balanced,position}. On first unmatched/mismatched closing bracket, position is its zero-based code-point index. If openings remain at EOF, position is the most recent unmatched opening. Balanced input has position:null.
005	text_wrap	text	Input: text and positive integer width. Split on Unicode whitespace. Greedily pack words into lines with single spaces; a next word fits iff length including separating space <= width. Never split a long word. Return lines without empty lines.
006	ngram_index	text	Input: tokens (strings), n (positive integer). Return [{tokens,positions}] for each distinct contiguous n-gram, sorted lexicographically by token sequence. Positions are ascending zero-based starting indices. n greater than length produces [].
007	glob_filter	text	Input: paths (strings), pattern. Return sorted unique matches using case-sensitive shell glob semantics: * matches any run including /, ? one character, [abc] a class, [!abc] a negated class. Python fnmatch.fnmatchcase semantics apply. No filesystem access.
008	edit_distance	text	Input: strings a,b of <=200 code points. Return Levenshtein distance with unit insertion, deletion and substitution costs. Compare Unicode code points, case-sensitive.
009	roman_codec	text	Input: integer number in 1..3999. Return canonical uppercase Roman numeral using subtractive pairs IV,IX,XL,XC,CD,CM.
010	caesar_cipher	text	Input: text and integer shift. Rotate only ASCII letters by shift modulo 26, preserving case. All other characters unchanged.
011	csv_records	data	Input: csv (string). Parse comma-separated CSV with double-quoted fields, doubled quote escaping and quoted newlines (Python csv.reader dialect excel). First row is unique nonempty header names. Subsequent rows have the same width. Return objects in source order. Empty document returns []. Blank data rows and malformed CSV are out of scope.
012	record_query	data	Input: rows (objects), where (object), select (list of field names). Keep rows containing every where field with an equal JSON value. Return selected fields for each in source order; missing selected fields become null. Values contain no booleans compared with numbers.
013	inner_join	data	Input: left,right (lists of objects), key (string). Return [{left,right}] for all pairs with key present on both sides and equal JSON values. Order by left source index then right source index; duplicates multiply. Null keys can match. No boolean-versus-number comparisons.
014	group_totals	data	Input: rows (objects), group,value (field names). Each row has a string group value and integer numeric value. Return [{key,count,sum}] sorted by key. Empty rows returns [].
015	json_flatten	data	Input: arbitrary JSON value. Return an object mapping JSON Pointer paths to leaves. Root path is "". Escape ~ as ~0 and / as ~1; array indices are decimal. Empty objects/arrays count as leaves. Nonempty containers do not produce their own entries.
016	merge_patch	data	Input: target,patch (JSON values). Apply JSON Merge Patch: a nonobject patch replaces the target. An object patch treats a nonobject target as {}; null-valued members remove keys; other members recursively merge. Arrays replace wholesale. Return resulting value.
017	json_pointer	data	Input: value (JSON), pointer (empty or starting /, valid 0/1 escapes). Resolve object keys or array indices. Array tokens must be 0 or a nonzero decimal digit followed by decimal digits (no leading zero, sign, or -). Return {found:true,value:...}; missing keys, noncontainers or out-of-range indices return {found:false,value:null}. Empty pointer returns root.
018	dedupe_records	data	Input: rows (objects), keys (field names). Retain first row for each distinct tuple of requested field values; missing fields equal null. Structural JSON equality ignores object key order. Keep source order. Boolean and numeric key values are not mixed.
019	pivot_table	data	Input: rows, row,column,value field names. Row/column values are strings; numeric values are integers. Return {rows:sorted row labels,columns:sorted column labels,values:2D sums}, filling missing cells with 0. Empty input yields three empty arrays.
020	schema_check	data	Input: schema object maps field names to {type,required}; value is an object. Types: string,integer,number,boolean,array,object,null. Booleans are neither integers nor numbers. For each schema field in lexical order, report {field,error:"required"} if missing and required, or {field,error:"type"} if present with wrong type. Optional missing fields and extra fields are ignored. No recursive validation.
021	interval_union	intervals	Input: intervals, list of [start,end] integer pairs with start<=end. Return sorted merged intervals, combining overlaps and touching endpoints. Retain isolated zero-length intervals.
022	interval_gaps	intervals	Input: intervals ([a,b] with a<=b), bounds [low,high] with low<=high. Return positive-length gaps in [low,high] after unioning and clipping occupied intervals. Touching endpoints do not make gaps. Sorted ascending; no zero-length results.
023	booking_peak	intervals	Input: bookings ([start,end] integer pairs, start<=end). Intervals are half-open; zero-length bookings ignored. Return {peak,at} for maximum simultaneous active bookings and earliest timestamp attaining that maximum. Empty effective input: {peak:0,at:null}. Endings at t happen before starts at t.
024	business_days	calendar	Input: start,end ISO dates (start<=end) and holidays (ISO dates). Return all Monday-Friday dates in [start,end) excluding holidays, ascending. Duplicate holidays have no additional effect. Dates are valid in years 1900..2100, range <=400 days.
025	calendar_month	calendar	Input: year (1900..2100), month (1..12). Return weeks as arrays of seven day numbers, Monday first. Use 0 for days outside the month; include only weeks intersecting this month.
026	moving_average	numeric	Input: values (finite numbers), window (positive integer). Return arithmetic means for all contiguous full windows. Empty input or window>length gives [].
027	statistics	numeric	Input: values (finite numbers). Return {count,min,max,mean,median,variance}. Variance is population variance (divide by n); even-length median is mean of middle two. Empty values: count=0 and all other fields null.
028	histogram	numeric	Input: finite numeric values and strictly increasing edges (>=2). Bins are [edge[i],edge[i+1]); values below first edge underflow, values >=last edge overflow. Return {counts,underflow,overflow}.
029	matrix_product	numeric	Input: a (m by n), b (n by p), nonempty rectangular integer matrices of compatible dimensions, each dimension <=20. Return matrix product.
030	polynomial	numeric	Input: integer coefficients in ascending power order (c0,c1,...) and integer evaluation points. Return values at each point. Empty coefficients denote zero polynomial.
031	prime_factors	numeric	Input: integer number in 1..10000000. Return [prime,exponent] pairs in ascending prime order; 1 returns [].
032	base_convert	numeric	Input: digits (valid integer representation, optional leading -, case-insensitive ASCII), from_base,to_base (2..36). Convert to lowercase digits 0-9a-z with no leading zero or plus; zero is "0". Magnitude <=2^100.
033	money_split	numeric	Input: nonnegative integer amount in cents, nonempty nonnegative integer weights with positive sum. Allocate by largest remainder: floor exact proportional shares, then give leftover cents to greatest fractional remainders, ties to lowest index. Return integer shares totaling amount.
034	invoice_total	numeric	Input: items [{price:nonnegative decimal string,quantity:nonnegative integer}], tax_rate (nonnegative decimal string). Sum exact price*quantity then round subtotal to cents using ROUND_HALF_UP. Tax = rounded subtotal * tax_rate, rounded half-up to cents. Total=subtotal+tax. Return {subtotal,tax,total} as strings with exactly two decimal places; do not use binary floating point for monetary arithmetic.
035	coin_change	numeric	Input: coins (positive integer denominations, duplicates allowed), amount (0..10000). Unlimited supply of each coin. Return minimum number of coins or null if impossible. Empty coins can make only zero.
036	graph_reach	graphs	Input: nodes (unique strings), edges ([from,to] directed pairs, endpoints in nodes), start (in nodes). Return sorted nodes reachable from start including itself. Allow cycles, self-edges and duplicate edges; <=100 nodes.
037	shortest_path	graphs	Input: nodes (unique strings), edges ([from,to,nonnegative integer weight], directed), start. Endpoints and start are in nodes. Return object mapping each node to shortest distance or null if unreachable. Cycles, parallel edges, zero weights allowed; <=100 nodes.
038	topological_order	graphs	Input: unique string nodes, directed edges [from,to]. Return topological order choosing lexicographically smallest currently available node each step, or null on any cycle. Duplicate edges allowed and do not change dependencies. Endpoints in nodes; <=100 nodes.
039	connected_components	graphs	Input: unique string nodes, undirected edges [a,b], endpoints in nodes. Return components as sorted lists of nodes, ordered by each component first node. Include isolated vertices; allow duplicate edges and self-loops.
040	grid_route	graphs	Input: grid (nonempty equal-length strings containing . or #), start,end ([row,column], valid coordinates). Move one cell up/down/left/right through . cells. Return shortest step count, or null if blocked/unreachable, including blocked start or end. Grid <=50x50.
041	tree_outline	graphs	Input: nodes [{id:unique string,parent:string or null}], forming a forest (all nonnull parents exist, no cycles), <=100 nodes. Return preorder [{id,depth}], roots and each sibling list sorted by id, roots depth 0.
042	dependency_build	graphs	Input: dependencies (object of string node -> dependency string list), targets (strings). Every referenced name exists. DFS each distinct target in sorted order, visit dependencies in sorted order, append each node after dependencies once. Return build order; return null on a cycle reachable from a target. Unreachable cycles ignored; <=100 nodes.
043	path_normalize	systems	Input: paths (POSIX path strings). Treat all paths as rooted at /. Remove repeated / and . segments; .. pops a segment if available and is ignored at root. Preserve other segment code points and backslashes literally. Return absolute paths without trailing / except root. No filesystem access.
044	url_query	systems	Input: query string (without leading ?). Parse &-separated key/value pairs using first =, retain blank values and bare keys, decode + as space and percent-encoded UTF-8. Return object of decoded keys -> lists of values in source order. Empty segments ignored. Python urllib.parse.parse_qsl with keep_blank_values=True semantics.
045	version_sort	systems	Input: versions valid MAJOR.MINOR.PATCH optionally -prerelease.identifiers; no build metadata, numeric components/identifiers have no leading zeros. Sort by semantic version precedence: numeric core, prerelease before release, numeric prerelease identifiers numerically and before nonnumeric; nonnumeric ASCII lexical; shorter equal prefix first. Stable equal versions retained.
046	lru_trace	systems	Input: nonnegative capacity and accesses (string keys). Simulate initially empty LRU cache. Hit moves key to most recent. Miss inserts and evicts oldest if full. Capacity 0 stores nothing. Return {hits,misses,keys}, keys oldest to newest.
047	rate_limit	systems	Input: events [{key:string,time:integer}] in nondecreasing time order, positive integer window, nonnegative limit. Per key, accept if fewer than limit previously accepted events have timestamps in (time-window,time]. Rejected events do not count. Process same-time events in input order. Return boolean decisions.
048	priority_queue	systems	Input: events of {op:"push",priority:integer,value:JSON} or {op:"pop"}. Smaller priority first, FIFO ties. Pop empty produces null. Return {popped:list of pop results,remaining:list of queued values in pop order}.
049	round_robin	systems	Input: jobs [{id:unique string,duration:positive integer}], positive integer quantum. All jobs arrive at 0 in input order. Repeatedly run first job min(remaining,quantum) time, append unfinished job to end. Return {slices:[{id,start,end}],completion:{id:completion time}}. Empty jobs gives empty structures.
050	inventory_ledger	business	Input: events [{sku:string,delta:integer}]. Stock initially absent/zero. Apply in order, rejecting an event if stock would become negative; rejected events leave no state. Accepted events create the SKU even if delta=0. Return {stock:object,rejected:zero-based event indices}.
051	bank_ledger	business	Input: balances (account -> nonnegative integer cents), transfers [{from,to,amount:positive integer}]. Reject missing accounts or insufficient source balance; otherwise subtract then add, including self-transfers. Return {balances,rejected:event indices}. Rejected transfers change nothing; never create accounts.
052	ballot_count	business	Input: candidates (unique strings), votes (strings). Count candidate votes, unrecognized votes invalid. Return {ranking:[{candidate,votes}],invalid}. Include zero-vote candidates. Rank by decreasing votes then ascending name.
053	search_rank	business	Input: documents [{id:unique string,text:string}], query string. Tokenize lowercase ASCII [a-z0-9]+. Score each document by total occurrence counts of distinct query tokens. Omit score=0 docs. Return [{id,score}] sorted by decreasing score then id.
054	log_summary	business	Input: events [{level:string,message:string}]. Return {counts:level->count,errors:messages of exactly ERROR-level events in source order}. Levels are case-sensitive; include only encountered levels.
055	uptime_report	business	Input: integer start<=end, downtime intervals [a,b] with a<=b. Clip to [start,end), merge overlaps, count duration without double-counting. Return {down,up}, up=end-start-down.
056	segment_intersection	geometry	Input: a,b,c,d each [integer x,integer y]. Return boolean whether closed segments ab and cd intersect, including collinear overlap, endpoint touches and degenerate point-segments. Coordinates magnitude <=100000.
057	polygon_area	geometry	Input: points, ordered integer [x,y] vertices of a simple polygon (clockwise or counterclockwise), possibly empty or fewer than three points. Return nonnegative area by shoelace, implicitly close last to first. Degenerate polygon has zero area.
058	skyline	geometry	Input: buildings [left,right,height], integer left<right and positive height. Return skyline keypoints [x,height] in ascending x where max active height changes. Buildings cover [left,right); omit redundant same-height points; finish with height 0 at last active end. Empty input returns [].
059	knapsack	optimization	Input: items [{weight:positive integer,value:nonnegative integer}], capacity (0..1000). Each item usable at most once; return maximum total value within capacity. Identical items remain independently usable; no need to return selected indices.
060	task_selection	optimization	Input: tasks [{id:unique string,start:integer,end:integer}], start<end. Greedy maximum-count nonoverlapping schedule: sort by (end,start,id), choose each task iff start>=previous chosen end. Return chosen IDs. Intervals are half-open, negative times allowed.
061	sequence_diff	optimization	Input: a,b (lists of strings, length<=100). Produce minimal insert/delete edit script via longest common subsequence. If current tokens equal, emit ["keep",token] and advance both. Otherwise choose deletion when remaining LCS lengths tie; else choose operation retaining longer LCS. Emit ["delete",token] or ["insert",token]; process until both exhausted.
062	finite_automaton	languages	Input: start (state string), accepting (state strings), transitions [{from,symbol,to}] with unique (from,symbol) and one-code-point symbols, words (strings). Simulate DFA separately per word. Missing transition rejects immediately. Return acceptance booleans. Empty word accepted iff start accepting.
063	content_manifest	systems	Input: files (object of logical file path -> text). Do not read filesystem. Return [{path,bytes,sha256}] sorted by path; bytes is length of UTF-8 encoding and sha256 is lowercase hexadecimal SHA-256 of that encoding. No newline insertion or Unicode normalization.
064	cellular_automaton	simulation	Input: live (integer [row,column] pairs, duplicates ignored), steps (0..20). Simulate Conway Life on infinite 2D grid, eight neighbors: live survives with 2 or 3, dead born with 3. Return sorted unique live pairs lexicographically. Initial <=50 cells.
065	expression_eval	languages	Input: tokens, a valid postfix integer expression as strings with binary operators +,-,*,/. Return integer result. Division truncates toward zero, including negative operands; all divisors nonzero. Other tokens are signed base-10 integers. All intermediate magnitudes <=2^100; expression leaves exactly one value.

Easy — 2–8B target

• kcb-easy-001-word-frequency
• kcb-easy-002-slug-registry
• kcb-easy-003-run-length
• kcb-easy-004-bracket-audit
• kcb-easy-005-text-wrap
• kcb-easy-006-ngram-index
• kcb-easy-007-glob-filter
• kcb-easy-008-edit-distance
• kcb-easy-009-roman-codec
• kcb-easy-010-caesar-cipher
• kcb-easy-011-csv-records
• kcb-easy-012-record-query
• kcb-easy-013-inner-join
• kcb-easy-014-group-totals
• kcb-easy-015-json-flatten
• kcb-easy-016-merge-patch
• kcb-easy-017-json-pointer
• kcb-easy-018-dedupe-records
• kcb-easy-019-pivot-table
• kcb-easy-020-schema-check
• kcb-easy-021-interval-union
• kcb-easy-022-interval-gaps
• kcb-easy-023-booking-peak
• kcb-easy-024-business-days
• kcb-easy-025-calendar-month
• kcb-easy-026-moving-average
• kcb-easy-027-statistics
• kcb-easy-028-histogram
• kcb-easy-029-matrix-product
• kcb-easy-030-polynomial
• kcb-easy-031-prime-factors
• kcb-easy-032-base-convert
• kcb-easy-033-money-split
• kcb-easy-034-invoice-total
• kcb-easy-035-coin-change
• kcb-easy-036-graph-reach
• kcb-easy-037-shortest-path
• kcb-easy-038-topological-order
• kcb-easy-039-connected-components
• kcb-easy-040-grid-route
• kcb-easy-041-tree-outline
• kcb-easy-042-dependency-build
• kcb-easy-043-path-normalize
• kcb-easy-044-url-query
• kcb-easy-045-version-sort
• kcb-easy-046-lru-trace
• kcb-easy-047-rate-limit
• kcb-easy-048-priority-queue
• kcb-easy-049-round-robin
• kcb-easy-050-inventory-ledger
• kcb-easy-051-bank-ledger
• kcb-easy-052-ballot-count
• kcb-easy-053-search-rank
• kcb-easy-054-log-summary
• kcb-easy-055-uptime-report
• kcb-easy-056-segment-intersection
• kcb-easy-057-polygon-area
• kcb-easy-058-skyline
• kcb-easy-059-knapsack
• kcb-easy-060-task-selection
• kcb-easy-061-sequence-diff
• kcb-easy-062-finite-automaton
• kcb-easy-063-content-manifest
• kcb-easy-064-cellular-automaton
• kcb-easy-065-expression-eval

Intermediate — 8–16B target

• kcb-intermediate-001-word-frequency
• kcb-intermediate-002-slug-registry
• kcb-intermediate-003-run-length
• kcb-intermediate-004-bracket-audit
• kcb-intermediate-005-text-wrap
• kcb-intermediate-006-ngram-index
• kcb-intermediate-007-glob-filter
• kcb-intermediate-008-edit-distance
• kcb-intermediate-009-roman-codec
• kcb-intermediate-010-caesar-cipher
• kcb-intermediate-011-csv-records
• kcb-intermediate-012-record-query
• kcb-intermediate-013-inner-join
• kcb-intermediate-014-group-totals
• kcb-intermediate-015-json-flatten
• kcb-intermediate-016-merge-patch
• kcb-intermediate-017-json-pointer
• kcb-intermediate-018-dedupe-records
• kcb-intermediate-019-pivot-table
• kcb-intermediate-020-schema-check
• kcb-intermediate-021-interval-union
• kcb-intermediate-022-interval-gaps
• kcb-intermediate-023-booking-peak
• kcb-intermediate-024-business-days
• kcb-intermediate-025-calendar-month
• kcb-intermediate-026-moving-average
• kcb-intermediate-027-statistics
• kcb-intermediate-028-histogram
• kcb-intermediate-029-matrix-product
• kcb-intermediate-030-polynomial
• kcb-intermediate-031-prime-factors
• kcb-intermediate-032-base-convert
• kcb-intermediate-033-money-split
• kcb-intermediate-034-invoice-total
• kcb-intermediate-035-coin-change
• kcb-intermediate-036-graph-reach
• kcb-intermediate-037-shortest-path
• kcb-intermediate-038-topological-order
• kcb-intermediate-039-connected-components
• kcb-intermediate-040-grid-route
• kcb-intermediate-041-tree-outline
• kcb-intermediate-042-dependency-build
• kcb-intermediate-043-path-normalize
• kcb-intermediate-044-url-query
• kcb-intermediate-045-version-sort
• kcb-intermediate-046-lru-trace
• kcb-intermediate-047-rate-limit
• kcb-intermediate-048-priority-queue
• kcb-intermediate-049-round-robin
• kcb-intermediate-050-inventory-ledger
• kcb-intermediate-051-bank-ledger
• kcb-intermediate-052-ballot-count
• kcb-intermediate-053-search-rank
• kcb-intermediate-054-log-summary
• kcb-intermediate-055-uptime-report
• kcb-intermediate-056-segment-intersection
• kcb-intermediate-057-polygon-area
• kcb-intermediate-058-skyline
• kcb-intermediate-059-knapsack
• kcb-intermediate-060-task-selection
• kcb-intermediate-061-sequence-diff
• kcb-intermediate-062-finite-automaton
• kcb-intermediate-063-content-manifest
• kcb-intermediate-064-cellular-automaton
• kcb-intermediate-065-expression-eval

Hard — 16–32B target

• kcb-hard-001-word-frequency
• kcb-hard-002-slug-registry
• kcb-hard-003-run-length
• kcb-hard-004-bracket-audit
• kcb-hard-005-text-wrap
• kcb-hard-006-ngram-index
• kcb-hard-007-glob-filter
• kcb-hard-008-edit-distance
• kcb-hard-009-roman-codec
• kcb-hard-010-caesar-cipher
• kcb-hard-011-csv-records
• kcb-hard-012-record-query
• kcb-hard-013-inner-join
• kcb-hard-014-group-totals
• kcb-hard-015-json-flatten
• kcb-hard-016-merge-patch
• kcb-hard-017-json-pointer
• kcb-hard-018-dedupe-records
• kcb-hard-019-pivot-table
• kcb-hard-020-schema-check
• kcb-hard-021-interval-union
• kcb-hard-022-interval-gaps
• kcb-hard-023-booking-peak
• kcb-hard-024-business-days
• kcb-hard-025-calendar-month
• kcb-hard-026-moving-average
• kcb-hard-027-statistics
• kcb-hard-028-histogram
• kcb-hard-029-matrix-product
• kcb-hard-030-polynomial
• kcb-hard-031-prime-factors
• kcb-hard-032-base-convert
• kcb-hard-033-money-split
• kcb-hard-034-invoice-total
• kcb-hard-035-coin-change
• kcb-hard-036-graph-reach
• kcb-hard-037-shortest-path
• kcb-hard-038-topological-order
• kcb-hard-039-connected-components
• kcb-hard-040-grid-route
• kcb-hard-041-tree-outline
• kcb-hard-042-dependency-build
• kcb-hard-043-path-normalize
• kcb-hard-044-url-query
• kcb-hard-045-version-sort
• kcb-hard-046-lru-trace
• kcb-hard-047-rate-limit
• kcb-hard-048-priority-queue
• kcb-hard-049-round-robin
• kcb-hard-050-inventory-ledger
• kcb-hard-051-bank-ledger
• kcb-hard-052-ballot-count
• kcb-hard-053-search-rank
• kcb-hard-054-log-summary
• kcb-hard-055-uptime-report
• kcb-hard-056-segment-intersection
• kcb-hard-057-polygon-area
• kcb-hard-058-skyline
• kcb-hard-059-knapsack
• kcb-hard-060-task-selection
• kcb-hard-061-sequence-diff
• kcb-hard-062-finite-automaton
• kcb-hard-063-content-manifest
• kcb-hard-064-cellular-automaton
• kcb-hard-065-expression-eval

Max — 60–200B target

• kcb-max-001-word-frequency
• kcb-max-002-slug-registry
• kcb-max-003-run-length
• kcb-max-004-bracket-audit
• kcb-max-005-text-wrap
• kcb-max-006-ngram-index
• kcb-max-007-glob-filter
• kcb-max-008-edit-distance
• kcb-max-009-roman-codec
• kcb-max-010-caesar-cipher
• kcb-max-011-csv-records
• kcb-max-012-record-query
• kcb-max-013-inner-join
• kcb-max-014-group-totals
• kcb-max-015-json-flatten
• kcb-max-016-merge-patch
• kcb-max-017-json-pointer
• kcb-max-018-dedupe-records
• kcb-max-019-pivot-table
• kcb-max-020-schema-check
• kcb-max-021-interval-union
• kcb-max-022-interval-gaps
• kcb-max-023-booking-peak
• kcb-max-024-business-days
• kcb-max-025-calendar-month
• kcb-max-026-moving-average
• kcb-max-027-statistics
• kcb-max-028-histogram
• kcb-max-029-matrix-product
• kcb-max-030-polynomial
• kcb-max-031-prime-factors
• kcb-max-032-base-convert
• kcb-max-033-money-split
• kcb-max-034-invoice-total
• kcb-max-035-coin-change
• kcb-max-036-graph-reach
• kcb-max-037-shortest-path
• kcb-max-038-topological-order
• kcb-max-039-connected-components
• kcb-max-040-grid-route
• kcb-max-041-tree-outline
• kcb-max-042-dependency-build
• kcb-max-043-path-normalize
• kcb-max-044-url-query
• kcb-max-045-version-sort
• kcb-max-046-lru-trace
• kcb-max-047-rate-limit
• kcb-max-048-priority-queue
• kcb-max-049-round-robin
• kcb-max-050-inventory-ledger
• kcb-max-051-bank-ledger
• kcb-max-052-ballot-count
• kcb-max-053-search-rank
• kcb-max-054-log-summary
• kcb-max-055-uptime-report
• kcb-max-056-segment-intersection
• kcb-max-057-polygon-area
• kcb-max-058-skyline
• kcb-max-059-knapsack
• kcb-max-060-task-selection
• kcb-max-061-sequence-diff
• kcb-max-062-finite-automaton
• kcb-max-063-content-manifest
• kcb-max-064-cellular-automaton
• kcb-max-065-expression-eval