Dataford
Interview QuestionsInterview GuidesExperiencesCoaching
New
Pricing
Get started
Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
Experiences
Practice
Mock InterviewsTimed interview simulations with feedbackCoaching1:1 coaching with people at your target companiesSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Build my plan

Testing a Given Function

MediumCoding00:00
Practice interviewer
In session
5 left
00:00

Your question is Testing a Given Function. Take a moment with it on the right.

Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).

You need to log in / sign up to chat or submit.

Problem

Cambridge Intelligence's graph-visualization library needs a small utility that computes the degree (number of connected links) of every node in a chart, so the UI can size nodes by how connected they are. A colleague wrote the function below and is about to merge it without any tests.

interface ChartNode { id: string; }
interface ChartLink { id1: string; id2: string; }

function computeDegrees(nodes: ChartNode[], links: ChartLink[]): Record<string, number> {
  const degrees: Record<string, number> = {};

  for (const node of nodes) {
    degrees[node.id] = 0;
  }

  for (const link of links) {
    degrees[link.id1]++;
    degrees[link.id2]++;
  }

  nodes.sort((a, b) => degrees[b.id] - degrees[a.id]);

  return degrees;
}

You are asked to review this before it merges. How would you test computeDegrees, and what test cases would you insist on seeing before you'd trust it in the chart renderer? Explain your reasoning, don't just list test names.