At Sourgum, a Software Engineer plays a pivotal role in revolutionizing a legacy industry by building the core technology that powers modern waste management and logistics. This is not just about writing clean code; it is about solving complex real-world problems such as dynamic routing, real-time dispatch, marketplace optimization, and supply-demand matching. Your work directly impacts how commercial and residential customers manage waste, driving both environmental sustainability and operational efficiency. The engineering team at Sourgum is responsible for building a scalable B2B marketplace and logistics platform. As a Software Engineer, you will work on high-impact products that handle complex transactional workflows, spatial data processing, and automated scheduling. The systems you design and maintain must be robust enough to handle high concurrency while remaining intuitive for haulers, customers, and internal operations teams. This role requires a unique blend of technical excellence, adaptability, and product ownership. Because Sourgum operates in a fast-paced, high-growth environment, engineers are expected to take end-to-end ownership of their features—from initial architecture and database design to deployment and monitoring. If you enjoy solving tangible, physical-world logistics problems using modern software architecture, this position offers an exceptionally rewarding and intellectually stimulating environment.
Recruiter Screening
reportedInitial screening by a recruiter to assess candidate fit for the role.
What to demonstrate
- Initial screening by a recruiter to assess candidate fit for the role
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Be able to walk your CV end to end in two minutes, and say why this company specifically.
- Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.
Technical Conversation
reportedDiscussion with the hiring manager or engineering leadership to evaluate technical skills.
What to demonstrate
- Discussion with the hiring manager or engineering leadership to evaluate technical skills
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Answer aloud and timed: Write a function to merge overlapping time intervals for vehicle dispatch schedules.
- Answer aloud and timed: Optimize a search algorithm to find the nearest waste hauler from a database of service providers based on zip codes.
Hands-on Technical Assessments
reportedIncludes live paired programming and data structures and algorithms challenges.
What to demonstrate
- Includes live paired programming and data structures and algorithms challenges
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Answer aloud and timed: How would you design a real-time GPS tracking system for a fleet of waste-hauling trucks?
- Answer aloud and timed: Design a scalable notification service that alerts customers and drivers of schedule changes via SMS and push notifications.
Comprehensive Onsite
reportedFinal loop covering system design, whiteboarding, deep-dive technical discussions, and behavioral interviews.
What to demonstrate
- Final loop covering system design, whiteboarding, deep-dive technical discussions, and behavioral interviews
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Answer aloud and timed: Describe how you would handle database scaling and read/write optimization for a high-volume B2B marketplace.
- Answer aloud and timed: How would you architect a distributed locking mechanism to prevent double-booking of a single hauler's inventory?
PracHub editorial advice for the preparation topics above.
Focus on logistics constraints
When designing systems or writing code, show that you understand real-world constraints such as network drops, GPS inaccuracy, and time-sensitive scheduling.
Communicate your trade-offs explicitly
Sourgum values engineers who understand that no architecture is perfect. Always explain why you chose a specific database, framework, or algorithm over another.
Do not rush through the live coding rounds
Sourgum interviewers pay close attention to code readability, variable naming, and how you handle edge cases, not just whether your code compiles.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Given an array of logistics coordinates, write an algorithm to find the most efficient route sequence that min
Given an array of logistics coordinates, write an algorithm to find the most efficient route sequence that minimizes total distance.
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?
Write a function to merge overlapping time intervals for vehicle dispatch schedules.
Write a function to merge overlapping time intervals for vehicle dispatch schedules.
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?
Find overlapping job attempts and peak concurrency from lease records
A day of job_run history yields about 50,000,000 attempt records: (job_run_id, job_type, attempt, started_at, finished_at which is NULL when the worker died, lease_expires_at). Leases expire on a clock, so a job that outran its lease ran twice. Produce (a) every job_run_id whose attempts overlapped in wall-clock time and (b) the peak number of simultaneously running attempts per job_type with the minute it occurred. Target O(n log n). State how you treat a NULL finished_at and what clock skew does to your answer.
Approach
- Define the interval before sorting anything: an attempt occupies [started_at, COALESCE(finished_at, lease_expires_at)). finished_at is observed and lease_expires_at is only a promise, so every attempt without a finish contributes an estimate and the whole result is a lower bound on overlap rather than an exact count.
- For peak concurrency, sweep: emit 2n endpoints, sort by (timestamp, kind) with ends ordered before starts at equal timestamps, then walk the sequence maintaining a counter per job_type and record each type's maximum with its timestamp. O(n log n) dominated by the sort, O(n) space, or O(1) extra if the sort is external and the walk streams.
- For overlap detection, do not compare attempts pairwise. A single global sort by (job_run_id, started_at) gives both the grouping and the order; within a group, keep the maximum end seen so far and report an overlap exactly when the next start is less than that running maximum, which is one linear pass after the sort.
- Half-open intervals matter and are easy to get wrong: with closed intervals an attempt ending at the same millisecond another begins reads as concurrency two, and across 50,000,000 records that artefact swamps the real signal.
Follow-up
- A handler is not idempotent and you have found 400 overlapping jobs. Which of them actually caused damage, and what would you query to find out?
- Peak concurrency for one job_type is 4 against a configured cap of 4. Is the cap working, or is the data hiding attempts that never started?
Find version gaps and relay lag with window functions
outbox_event holds event_id, aggregate_type, aggregate_id, aggregate_version, event_type, payload, status ('pending','published','dead'), attempts, created_at, published_at. A projection is missing rows and you must decide whether the relay skipped events or the consumer dropped them. Write three queries over the last seven days: one listing every aggregate_id whose published aggregate_version sequence has a hole, one giving per-day counts with a running total, and one returning the newest published event per aggregate. For each, say where the window function is evaluated relative to WHERE and LIMIT. PostgreSQL 16.
Approach
- Gaps: compute lead(aggregate_version) OVER (PARTITION BY aggregate_id ORDER BY aggregate_version) in a subquery, then filter next_version <> aggregate_version + 1 in the outer query. Window functions are evaluated after WHERE, GROUP BY and HAVING and before the outer ORDER BY and LIMIT, so the predicate cannot sit in the same WHERE clause and PostgreSQL 16 has no QUALIFY.
- Say what the seven-day filter does to the answer: it truncates every partition, so the first row per aggregate has no predecessor inside the window and a hole spanning the boundary is invisible. Widen the window, or join to resource.version as the authority for the true maximum.
- Running total: SELECT date_trunc('day', created_at) AS d, count() AS n, sum(count()) OVER (ORDER BY date_trunc('day', created_at) ROWS UNBOUNDED PRECEDING). An aggregate inside a window call is legal because grouping runs before windowing. The grouping key is unique per row here so ROWS and RANGE agree, but write the frame anyway — over ungrouped rows with tied timestamps the default RANGE frame pulls in every peer row and the total jumps.
- Newest per aggregate: DISTINCT ON (aggregate_id) ... ORDER BY aggregate_id, aggregate_version DESC is the cheap PostgreSQL-only form when an index matches that order; row_number() OVER (PARTITION BY aggregate_id ORDER BY aggregate_version DESC) = 1 is the portable form and needs a subquery for the same evaluation-order reason as the gap query.
Follow-up
- Relay failover redelivers events. Does a duplicate break the gap query, and how would you detect one from this table alone?
- Turn the gap check into a continuous monitor rather than a query someone runs after an incident. What does it watch?
Denormalise tenant onto revisions and backfill it live
resource_revision (revision_id, resource_id, version, actor_user_id, change_kind, patch, request_id, created_at) has 400M rows and no tenant column; tenant_id lives only on resource. Two reads need it: a tenant-scoped audit feed ordered by created_at DESC, and an offboarding purge. Both join back to resource today. Justify adding tenant_id to resource_revision against those two reads, name the anomaly the copy introduces and the constraint that prevents it, then give the ordered migration for a live table taking 1.2k writes/second — the lock each step takes, how the backfill is batched, and where each step stops being reversible. PostgreSQL 16.
Approach
- Justify from the access path rather than from taste. Without the column, the audit feed either scans resource_revision by created_at and discards other tenants' rows, or resolves the tenant's resource_ids first and probes with them — both proportional to the tenant's whole history rather than to one page. With (tenant_id, created_at DESC, revision_id DESC) it is a seek that stops at 50 rows, and the purge becomes a ranged delete instead of a join.
- Name the cost exactly: a second copy of a fact can disagree with the first. Make the disagreement unwritable rather than documented — add UNIQUE (resource_id, tenant_id) on resource so it can serve as a foreign-key target, then FOREIGN KEY (resource_id, tenant_id) REFERENCES resource (resource_id, tenant_id) on the revision table. A revision can then only ever carry its parent's tenant.
- Step one, expand: ALTER TABLE resource_revision ADD COLUMN tenant_id BIGINT NULL, with no default, so it is a catalogue change and no rewrite. It still needs ACCESS EXCLUSIVE for an instant, and that instant queues behind the longest open transaction on the table while every later query queues behind it — set lock_timeout to 2s and retry rather than wait.
- Step two, dual-write: deploy the writer that populates tenant_id on every new revision while reads still use the join. Reversible by redeploying the previous build, because nothing reads the column yet.
Follow-up
- The backfill is half finished and a rollback is required. What state is the table in, and what does the previous build do with a half-populated column?
- How do you verify the backfill actually finished, given rows are still being inserted while it runs?
Implement a custom rate-limiter to protect Sourgum's external API endpoints from abuse.
Implement a custom rate-limiter to protect Sourgum's external API endpoints from abuse.
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- Design the error taxonomy before the success shape; callers branch on it.
Follow-up
- What happens if the caller retries after a timeout?
- How does a client discover it is on an old version of this contract?
Optimize a search algorithm to find the nearest waste hauler from a database of service providers based on zip
Optimize a search algorithm to find the nearest waste hauler from a database of service providers based on zip codes.
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- Design the error taxonomy before the success shape; callers branch on it.
Follow-up
- What happens if the caller retries after a timeout?
- How does a client discover it is on an old version of this contract?
How would you design a real-time GPS tracking system for a fleet of waste-hauling trucks?
How would you design a real-time GPS tracking system for a fleet of waste-hauling trucks?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Design a scalable notification service that alerts customers and drivers of schedule changes via SMS and push
Design a scalable notification service that alerts customers and drivers of schedule changes via SMS and push notifications.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Describe how you would handle database scaling and read/write optimization for a high-volume B2B marketplace.
Describe how you would handle database scaling and read/write optimization for a high-volume B2B marketplace.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
How would you architect a distributed locking mechanism to prevent double-booking of a single hauler's invento
How would you architect a distributed locking mechanism to prevent double-booking of a single hauler's inventory?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Listing latency scales with page size, not with filters
The tenant listing endpoint reads resource filtered by tenant_id and status, ordered by updated_at DESC, and returns each row plus the owner's display name from app_user and the actor of that resource's latest resource_revision. p99 is 55 ms at 10 rows per page and 1.4 s at 200. Database telemetry shows 401 statements per request, each under 1 ms, and nothing in the slow-query log. Diagnose the cause and give the fix, stating the statement count per request and the p99 you expect afterwards.
Approach
- Read the counters before forming a theory. 401 statements for 200 rows is one driver query plus two per row, and sub-millisecond execution with an empty slow-query log rules out a bad plan. The time is round trips, which is why it is invisible in every per-query metric and scales with rows returned rather than with filter selectivity.
- Name the two per-row statements from their normalised text: a single-row app_user lookup by user_id, and a resource_revision lookup by resource_id ordered by version DESC LIMIT 1. Confirm by dropping those two response fields and watching the statement count fall to one. That locates the calls in the serialisation layer, not the repository.
- Check that the arithmetic accounts for the whole gap. Measure one round trip to the replica in isolation; 400 trips at roughly 3 ms of network plus 0.2 ms of execution is about 1.3 s on top of a 55 ms baseline, which matches. If the multiplication had fallen short, the N+1 would only be part of the story and you would keep looking.
- Batch both lookups. Collect owner_user_ids and resource_ids from the driver query, then issue WHERE tenant_id = $1 AND user_id = ANY($2) for the users, and PostgreSQL's SELECT DISTINCT ON (resource_id) ... WHERE resource_id = ANY($2) ORDER BY resource_id, version DESC for the latest revision, which the UNIQUE (resource_id, version) index serves directly. On an engine without DISTINCT ON, use a lateral join or a row_number window. Three statements per request at any page size.
Follow-up
- The page size is capped at 200 today. What breaks first if it is raised to 2,000, and is it still this bug?
- How do you stop the next N+1 from reaching production, given that no individual query is slow and the endpoint's tests pass?
Built from the rounds and topics Sourgum candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Sourgum loop
- Write out the reported sequence: Recruiter Screening, Technical Conversation, Hands-on Technical Assessments, Comprehensive Onsite.
- For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.
Deliverable: A one-page map of the 4 reported rounds, with the weakest marked.
02Work Data Structures & Algorithms (DSA)
- Spend the session on Data Structures & Algorithms (DSA), which Sourgum candidates report being tested on.
- Write one worked example in Data Structures & Algorithms (DSA) and time yourself on it.
Deliverable: One timed worked example in Data Structures & Algorithms (DSA).
03Work System Design
- Spend the session on System Design, which Sourgum candidates report being tested on.
- Write one worked example in System Design and time yourself on it.
Deliverable: One timed worked example in System Design.
04Work Algorithmic Thinking
- Spend the session on Algorithmic Thinking, which Sourgum candidates report being tested on.
- Write one worked example in Algorithmic Thinking and time yourself on it.
Deliverable: One timed worked example in Algorithmic Thinking.
05Answer out loud: Coding & Data Structures
- Answer aloud, timed: Given an array of logistics coordinates, write an algorithm to find the most efficient route sequence that minimizes total distance.
- Answer aloud, timed: Implement a custom rate-limiter to protect Sourgum's external API endpoints from abuse.
Deliverable: Spoken answers to 2 reported Coding & Data Structures question(s), under time.
06Answer out loud: System Design & Architecture
- Answer aloud, timed: How would you design a real-time GPS tracking system for a fleet of waste-hauling trucks?
- Answer aloud, timed: Design a scalable notification service that alerts customers and drivers of schedule changes via SMS and push notifications.
Deliverable: Spoken answers to 2 reported System Design & Architecture question(s), under time.
07Answer out loud: Behavioral & Leadership
- Answer aloud, timed: Describe a time you had to make a technical trade-off to meet a tight business deadline. What was the outcome?
- Answer aloud, timed: How do you handle a situation where you disagree with a product manager's priority or requirements?
Deliverable: Spoken answers to 2 reported Behavioral & Leadership question(s), under time.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
Describe a time you had to make a technical trade-off to meet a tight business deadline. What was the outcome?
Describe a time you had to make a technical trade-off to meet a tight business deadline. What was the outcome?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
How do you handle a situation where you disagree with a product manager's priority or requirements?
How do you handle a situation where you disagree with a product manager's priority or requirements?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
Tell me about a complex technical bug you encountered in production and how you went about diagnosing and reso
Tell me about a complex technical bug you encountered in production and how you went about diagnosing and resolving it.
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
How do you mentor junior engineers and foster a culture of high code quality within your team?
How do you mentor junior engineers and foster a culture of high code quality within your team?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
- 01
Describe a time you had to make a technical trade-off to meet a tight business deadline. What was the outcome?
- 02
How do you handle a situation where you disagree with a product manager's priority or requirements?
- 03
Tell me about a complex technical bug you encountered in production and how you went about diagnosing and resolving it.
- 04
How do you mentor junior engineers and foster a culture of high code quality within your team?
How difficult is the Sourgum interview process?
The process is highly challenging and comparable in difficulty to FAANG technical loops. You will face rigorous coding, system design, and deep-dive technical discussions, requiring thorough preparation.
Sourgum Software Engineer candidate reports ↗What is the primary tech stack used at Sourgum?
While the team values language-agnostic problem solvers, the core stack heavily leverages modern backend frameworks (such as Node.js and Python), relational databases, and cloud-native infrastructure on AWS.
Sourgum Software Engineer candidate reports ↗Where are these roles located, and is there a hybrid policy?
The engineering team is primarily centered around Jersey City, NJ. Candidates should expect to work in a hybrid capacity, combining in-office collaboration with remote flexibility.
Sourgum Software Engineer candidate reports ↗How long does the entire interview loop take from start to finish?
The typical timeline spans 3 to 5 weeks, depending on candidate availability and the scheduling of the final onsite rounds. The recruitment team keeps candidates closely updated at each stage.
Sourgum Software Engineer candidate reports ↗What topics does Sourgum test in interviews?
Sourgum interviews most often cover Data Structures & Algorithms (DSA), CRM Usage (Customer Relationship Management), System Design, Account Management, and Algorithmic Thinking. The exact emphasis depends on the specific role you apply for.
Sourgum Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01Sourgum Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Cognition Software Engineer Interview Guide
What Cognition asks Software Engineer candidates, from reported rounds and questions.
Discord Software Engineer Interview Guide
Database practice for Discord candidates: how an index changes a query plan, and which anomalies survive a given isolation level, since read committed still permits non-repeatable reads.
CoreWeave Software Engineer Interview Guide
Failure-handling practice for CoreWeave software engineer candidates: requests whose outcome a timeout leaves unknown, where a retry is safe, and deduplicating at the receiver instead of assuming exactly-once delivery.
Aerospike Software Engineer Interview Questions & Guide 2026
Aerospike database-engine preparation through an original single-owner Python key-value store with bounded logical index accounting, disk-offset reads, conditional writes, tombstones, process-restart recovery and 3,240 checks. Existing 14 p