Interview guides · goML

goML Software Engineer Interview Guide

goML Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

As a Software Engineer at goML, you will play a pivotal role in bridging the gap between advanced machine learning capabilities and production-ready software applications. goML specializes in delivering high-impact AI and machine learning solutions, which means software engineering here is not just about writing standard web applications. It is about building the robust infrastructure, responsive user interfaces, and highly performant APIs required to serve complex ML models to end-users. Your work will directly impact how clients interact with cutting-edge AI technologies. Whether you are optimizing a frontend dashboard in React to visualize real-time data or structuring backend APIs to handle high-throughput requests, your contributions ensure that machine learning models perform reliably at scale.

This guide is scoped to a Software Engineer candidate at goML.

Focus areas

Analytical & Problem-Solving
JavaScript Fetch Concepts
API Fundamentals

The goML interview process

goML candidates report 3 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.

Online Assessment or Group Discussion

Initial screening focusing on logical reasoning, aptitude, and coding challenges or assessing communication skills and collaboration.

What to demonstrate

Initial screening focusing on logical reasoning, aptitude, and coding challenges or assessing communication skills and collaboration
Depth in Analytical & Problem-Solving

How to prepare

Answer aloud and timed: Explain the difference between state and props in React.
Answer aloud and timed: How does the Fetch API work in JavaScript, and how do you handle asynchronous operations using async/await?

One-on-One Technical Interviews

In-depth interviews covering core computer science subjects, frontend concepts, project experience, and problem-solving scenarios.

What to demonstrate

In-depth interviews covering core computer science subjects, frontend concepts, project experience, and problem-solving scenarios
Depth in Analytical & Problem-Solving

How to prepare

Answer aloud and timed: Describe the box model in CSS and how you would center a div both horizontally and vertically.
Answer aloud and timed: What are React Hooks, and when would you use useEffect?

Managerial or HR Round

Final evaluation of career goals, strengths, weaknesses, and cultural fit within the company.

What to demonstrate

Final evaluation of career goals, strengths, weaknesses, and cultural fit within the company
Depth in Analytical & Problem-Solving

How to prepare

Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
Re-read the description of the managerial or hr round above and write down what you would ask to confirm before it.

Where candidates lose points

Structure your self-introduction

Candidates have reported that the initial self-introduction can set the tone for the entire interview. Take the time to structure your introduction, highlighting key projects, your technical stack, and your interest in AI/ML solutions.

Be prepared for a comprehensive self-introduction

Candidates have reported spending up to 7 minutes walking through their background, so ensure your story is structured and highlights your technical milestones clearly.

Explain your design decisions

When discussing your projects, do not just list the technologies you used. Explain why you chose React, how you structured your state, or why you designed an API in a specific way.

Questions & practice

How does the Fetch API work in JavaScript, and how do you handle asynchronous operations using async/await?

Medium · Frontend & Web Technologies

Approach

Say what the runtime actually does before reasoning about the code.
Name what is shared across threads and what owns each piece of state.
Identify the window where an invariant is briefly untrue.
Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

What happens if two callers reach this at the same time?
Where could this allocate more than you expect?

How do you optimize a search algorithm when dealing with a massive, unsorted dataset?

Medium · Analytical Thinking & Puzzles

Approach

Restate the input: its shape, its size, and what is guaranteed about it.
Name the brute-force solution and its complexity before improving on it.
Choose the data structure from the access pattern, not from familiarity.
State the target complexity and say which constraint rules the naive version out.

Follow-up

How does this change if the input no longer fits in memory?
What is the worst case, and how likely is it on real data?

Canonicalise a request body into a stable idempotency fingerprint

Medium · parsing · canonicalisation · hashing

idempotency_key.request_fingerprint is a SHA-256 over the method, path and canonicalised body, and a retry whose fingerprint differs must be rejected with 422 rather than served the stored response. Write the canonicaliser. Bodies are JSON up to 256 KB nested at most 32 levels; clients vary key order, whitespace and unicode escaping, and some send 64-bit ids as JSON numbers. Produce a deterministic byte string such that semantically identical bodies match and any semantic difference does not. State your complexity and name two normalisations you refuse to perform.

Approach

Parse once into a tree, then re-serialise under fixed rules: object keys sorted, array order preserved, one escaping convention, no insignificant whitespace. Parsing is O(n) and sorting keys is O(k log k) per object, so O(n log n) overall with O(depth) stack, and the 32-level cap is enforced during parsing because hostile nesting is how a canonicaliser becomes a stack overflow.
Sort keys by their UTF-8 bytes and say why the obvious implementation is wrong in some runtimes: a default string comparison that orders by UTF-16 code units places surrogate pairs, meaning code points from U+10000 up, below U+E000 to U+FFFF, which is not UTF-8 byte order, so two services written in different languages disagree on the same document.
Do not re-encode numbers through a double. IEEE-754 binary64 represents integers exactly only up to 2^53, so normalising a 19-digit id through a float changes it, and 1 against 1.0 cannot be reconciled without deciding whether they are the same value. Preserve the literal token, and require ids as strings at the API boundary if you want them comparable.
Reject duplicate keys rather than picking one. JSON permits them and parsers disagree, most keeping the last, so any choice you make ties the fingerprint to a parser detail that the code handling the request does not necessarily share.

Follow-up

A client sends the same logical request with an extra field your API ignores. Same key, different fingerprint, so you return 422. Is that the right answer?
Where does the fingerprint get computed relative to request decompression and the body-size limit?

What are your long-term career goals as a Software Engineer, and why do you want to join a fast-paced environm

Medium · Project & Behavioral Discussion

What are your long-term career goals as a Software Engineer, and why do you want to join a fast-paced environment like goML?

Approach

Name the grain you start from and join outward from it.
Check whether any join is one-to-many before aggregating, or the sums inflate.
Say which index the query would use, and what makes it unusable.
Handle the rows that do not match: that is usually the actual question.

Follow-up

How does the query change if that join becomes one-to-many?
What happens to this when the table is ten times larger?

Stop tag and share joins from fanning out a page

Medium · join fan-out · semi-joins · many-to-many

resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.

Approach

Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.

Follow-up

The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
A resource can be shared with the same user twice under different permissions. Does your count change, and should it?

Explain the difference between state and props in React.

Medium · Frontend & Web Technologies

Approach

Clarify what is being asked and what a complete answer contains.
State your assumptions explicitly before working the problem.
Say what you would check first and why it is the highest-information step.
Work from the requirement backwards to the design.

Follow-up

What assumption would you test first?
How would you know your answer was wrong?

Describe the box model in CSS and how you would center a div both horizontally and vertically.

Medium · Frontend & Web Technologies

Approach

Clarify what is being asked and what a complete answer contains.
State your assumptions explicitly before working the problem.
Say what you would check first and why it is the highest-information step.
Work from the requirement backwards to the design.

Follow-up

What assumption would you test first?
How would you know your answer was wrong?

What are React Hooks, and when would you use `useEffect`?

Medium · Frontend & Web Technologies

Approach

Clarify what is being asked and what a complete answer contains.
State your assumptions explicitly before working the problem.
Say what you would check first and why it is the highest-information step.
Work from the requirement backwards to the design.

Follow-up

What assumption would you test first?
How would you know your answer was wrong?

How do you optimize the performance of a web application experiencing slow render times?

Medium · Frontend & Web Technologies

Approach

Clarify what is being asked and what a complete answer contains.
State your assumptions explicitly before working the problem.
Say what you would check first and why it is the highest-information step.
Work from the requirement backwards to the design.

Follow-up

What assumption would you test first?
How would you know your answer was wrong?