Forward Deployed GenAI Engineering

Build automated use case scoring and data readiness evaluation tools for client discovery workshops.

Build Pydantic models that define the data structures for use case scoring: criteria definitions with configurable weights, structured response schemas for validated evaluations, and scored use case results. Then implement the deterministic weighting, validation, and ranking logic that turns raw…

Build the UseCaseScoringEngine class that ranks proposed AI use cases with deterministic weighted multi-criteria scoring. The engine registers weighted criteria, normalizes the weights, computes each use case's weighted-sum aggregate, and produces a ranked best-first list. Pure model-free…

Build the request-handling layer of a use case scoring API. Implement an evaluate handler for single use case scoring, a batch handler for batch evaluation with ranking, and a criteria handler that exposes normalized scoring weights. Every handler is deterministic: it validates the request and…

Rebuild lab_1's interview-state-machine on LangGraph's StateGraph (define question_generation/response_capture/follow_up_analysis/insight_extraction nodes with edges + conditional routing over InterviewState) instead of the hand-rolled next_state/advance dispatch; the existing LLM…

Implement deterministic structured insight extraction from discovery interview transcripts. Students build an extractor that classifies each transcript utterance into pain points, opportunities, or requirements using keyword-marker rules with a fixed precedence order, then aggregates the insights…

Build a deterministic save-and-resume API for discovery interview sessions. Students implement an in-memory session store and a stage state machine — create a session, record answers, advance through a fixed stage sequence (completing at the final stage), snapshot a session to a plain dict, and…

Build a deterministic multi-provider router that maps model names to providers (OpenAI, Gemini, Anthropic), resolves each provider's proxy base URL from configuration, produces a complete routing decision, and computes an ordered fallback chain across configured providers. No LLM is called…

Build a deterministic benchmarking aggregator that turns recorded provider probe samples into a comparison: compute each sample's USD cost from a fixed pricing table, aggregate per-provider latency and cost stats, identify the fastest and cheapest provider, and filter providers by a latency…

Build a deterministic feasibility analyzer that scores candidate providers (each pre-rated on quality, speed, and cost) with a weighted formula, gates them on compliance and a minimum-score bar, compares two providers head-to-head, and ranks all candidates to recommend the best feasible one. No…