At North Point Technology, the Software Engineer role is central to delivering high-stakes, mission-critical solutions for the National Geospatial-Intelligence Agency (NGA). You will not just be writing code; you will be building geospatial data management applications that directly support national security and intelligence distribution. The work is defined by its complexity, requiring you to bridge the gap between cutting-edge technology and the urgent, evolving needs of our customers. You will join a high-performing Scrum team, working in a collaborative environment where ownership and curiosity are rewarded. Whether you are developing frontend web interfaces, integrating RESTful APIs, or optimizing containerized workflows, your contributions will have a tangible impact on how intelligence is processed and shared. We prioritize engineers who are as comfortable navigating ambiguity as they are implementing robust technical solutions. ##### Tip Because our work supports the NGA, your ability to articulate how your technical solutions solve mission-specific problems is just as important as your coding proficiency.
Screening Call
reportedDiscuss your background, clearance status, and interest in the mission.
What to demonstrate
- Discuss your background, clearance status, and interest in the mission
- Depth in Scrum / Agile Development
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 Interviews
reportedSeries of interviews focusing on coding skills, tech stack experience, and teamwork.
What to demonstrate
- Series of interviews focusing on coding skills, tech stack experience, and teamwork
- Depth in Scrum / Agile Development
How to prepare
- Answer aloud and timed: How do you approach creating responsive web layouts from static design images?
- Answer aloud and timed: Can you explain the difference between LESS and SASS and how you utilize them for maintainable styling?
Collaborative Discussion
reportedEngage with technical leads and project managers about past projects and technical decisions.
What to demonstrate
- Engage with technical leads and project managers about past projects and technical decisions
- Depth in Scrum / Agile Development
How to prepare
- Answer aloud and timed: What are the common challenges you face when consuming RESTful APIs in a frontend-heavy application?
- Answer aloud and timed: How do you handle a situation where a technical requirement is unclear or ambiguous?
Final Technical Assessment
reportedDemonstrate progressive levels of detail from architectural thinking to tactical coding.
What to demonstrate
- Demonstrate progressive levels of detail from architectural thinking to tactical coding
- Depth in Scrum / Agile Development
How to prepare
- Answer aloud and timed: Describe your experience using Git and GitHub in a multi-developer environment. How do you manage merge conflicts?
- Answer aloud and timed: How do you prioritize tasks when working within a Sprint?
PracHub editorial advice for the preparation topics above.
Show your work
When answering technical questions, walk the interviewer through your logic, including why you rejected certain approaches in favor of your final solution.
Know the mission
Research the NGA and understand the role that geospatial intelligence plays in national security; showing that you understand our customer's mission will set you apart.
Clarify the scope
If a question seems broad, ask clarifying questions before diving into the solution. This demonstrates a professional approach to requirements gathering.
Be ready for the clearance check
Have your clearance information ready and be prepared to discuss it early in the process.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Diff a projection against the primary without per-row point reads
The listing projection has drifted and some rows show a stale version. The primary holds 40,000,000 resource rows across 12,000 tenants while serving 1,200 writes and 14,000 reads per second. The obvious repair, reading each resource row and comparing its version against the projection, is correct and would eventually finish. Explain precisely why it is unacceptable here, then give a diff that finds the differing rows, state its complexity, and make it safe to run against a live primary. Replication lag is usually under 100 ms and is not bounded.
Approach
- Quantify the naive cost rather than calling it slow: 40,000,000 point reads at even 0.5 ms each is over five hours serialised, and the only lever is concurrency, which is exactly what you cannot spend. The primary's pool is sized for the write path, and 40,000,000 random reads evict the buffer cache that sustains the 85 percent cache hit rate, so the audit degrades the system it is auditing.
- Replace random access with one ordered pass per side. Both sides can be read in (tenant_id, resource_id) order, which is a sequential scan on each and a merge join in O(n) time and O(1) memory. For a dense diff that is the whole answer, and it reads the primary once instead of 40,000,000 times.
- For the expected sparse case, compare range hashes instead of rows: partition the key space, compute per range an order-independent aggregate over hash(resource_id, version), compare aggregates, and descend only into ranges that differ. With d differing rows and branching factor B, at most d ranges mismatch per level, so the drill-down examines O(d log_B(n/d)) ranges and reads full rows only in mismatching leaves.
- Aggregate with a sum modulo 2^64 or a multiset hash, never XOR. XOR is order-independent but self-cancelling, so two rows wrong in the same way, or a row duplicated on one side, leave the range aggregate matching and the range is declared clean.
Follow-up
- The diff reports 900 stale rows. How do you decide between patching those rows and rebuilding the projection from resource_revision?
- Same job, but the projection lives in a search index that cannot be scanned in key order. What changes?
Identify the heaviest tenants in a five-minute window under memory pressure
The edge service handles about 3,000 requests per second across roughly 50,000 tenants, peaking near 9,000. Expose the 50 heaviest tenants by request count over the trailing five minutes so limits can be tightened before one tenant's backfill starves the fleet. You may not retain five minutes of raw records. Give the exact solution and its memory, then the bounded-memory approximation with its error stated as a formula, and say which you would ship and at what tenant cardinality that choice changes.
Approach
- Do the exact version first, because it is affordable at this cardinality: a ring of 300 one-second counters per tenant, advanced lazily, is 1,200 bytes of counters per tenant and roughly 60 to 90 MB for 50,000 tenants with overhead. Carry a running total and subtract the bucket you overwrite so a window read is O(1) rather than 300 adds.
- Extract the top 50 with a size-k min-heap over the tenant sums: O(d log k) for d tenants, against O(d log d) to sort them all. Maintaining the heap continuously instead of on query requires a tenant-to-heap-index map, because incrementing a count already inside the heap means sifting from a known position, and without that map you rebuild the heap on every request.
- State the approximation precisely rather than gesturing at sketches. Misra-Gries with m counters retains every item whose true count exceeds N/(m+1), and each retained count underestimates the truth by at most N/(m+1). With m = 1,000 and N = 900,000 requests in the window the error is roughly 900 requests, which is fine for spotting a tenant sending 50,000 and useless for ranking two tenants 200 apart.
- Say what breaks when the window slides: Misra-Gries and Space-Saving are insert-only and cannot be decremented as records age out. The workable construction is one summary per sub-window, say ten seconds, with 30 summaries merged at query time, and the merged error is the sum of the per-summary errors, so the bound degrades linearly in the number of sub-windows.
Follow-up
- The heaviest tenant is heavy because of one export job rather than user traffic. Should the limiter treat those as the same tenant?
- Two tenants sit tied at the boundary of the top 50. Does your answer flap, and does the flapping matter?
Track a rolling failure rate per destination for circuit decisions
The egress service delivers about 1,500 webhooks per second across roughly 40,000 destinations, each call bounded by a 10 second timeout. Maintain, per destination, the failure rate over the trailing 60 seconds so a caller can ask before dispatch whether the circuit should open. Attempts arrive as (destination_id, finished_at_ms, outcome). Requirement: amortised O(1) per attempt, with total memory bounded by the destination count rather than by traffic. Give the structure, its exact memory, and the rule that stops a destination with three attempts from opening a circuit.
Approach
- Name the exact-deque version and then reject it as the default. Holding timestamps and advancing a tail pointer past anything older than now minus 60 seconds is a correct two-pointer window at amortised O(1) per attempt, but its memory tracks in-window traffic, so one destination in a retry storm holds hundreds of thousands of entries while thousands of quiet destinations hold none.
- Use a ring of 60 one-second buckets per destination, each bucket a pair of counters for attempts and failures. On an attempt, advance the ring by the elapsed whole seconds, zeroing at most min(elapsed, 60) buckets, then increment the head. That is amortised O(1) with a fixed footprint per destination.
- State the footprint: 60 buckets times two 4-byte counters is 480 bytes of payload per destination, so 40,000 destinations is roughly 20 to 25 MB with per-entry overhead, bounded by the catalogue rather than by the rate. The cost is granularity, since the oldest bucket ages out in whole seconds, which is far tighter than the decision needs.
- Require a minimum sample before the circuit may open. A destination with three attempts and three failures reads as 100 percent and is not evidence; a floor of roughly 20 attempts in the window makes the ratio meaningful, and below that floor use a run of consecutive failures as the trigger instead.
Follow-up
- The fleet is 30 instances and each sees roughly a thirtieth of a destination's traffic. Where does the rate actually live, and what does a per-instance answer get wrong?
- A destination answers in 9.5 seconds and succeeds. It is not failing but it is consuming your per-destination concurrency. What signal should open the circuit here?
Hold a per-tenant active cap against concurrent creates
A tenant on the standard plan may hold at most 50 resources with status='active'. The create handler runs SELECT count(*) FROM resource WHERE tenant_id = $1 AND status = 'active', compares to 50, then inserts. Two creates arrive 3 ms apart on different instances and the tenant lands at 51. Name the anomaly, say whether PostgreSQL 16 READ COMMITTED or REPEATABLE READ prevents it and why, then give an implementation that holds the cap at READ COMMITTED with the exact statements. Finally, say what changes when the cap is 'at most one running export per tenant' on job_run.
Approach
- Name it: write skew. The two transactions read an overlapping set and write disjoint rows, so there is no row-level conflict for the engine to detect and each commit is individually legal.
- Rule out the levels precisely. READ COMMITTED takes a fresh snapshot per statement and takes no lock on the counted rows, so both see 49. PostgreSQL's REPEATABLE READ is snapshot isolation: it removes non-repeatable reads and phantoms within the snapshot but still admits write skew, because the anomaly is not a re-read of a changed row, it is a read of a set that a concurrent transaction invalidates. Only SERIALIZABLE closes it, by tracking the read dependency and aborting one transaction with SQLSTATE 40001 — a guarantee that exists only if the application re-runs the whole transaction from the read.
- Convert the set predicate into a single-row conflict: keep tenant.active_resource_count and run UPDATE tenant SET active_resource_count = active_resource_count + 1 WHERE tenant_id = $1 AND active_resource_count < 50 in the same transaction as the INSERT. Zero affected rows is the cap, returned as 409. The row lock serialises the decision at any isolation level, and contention is bounded to one tenant's row — which is also the fair-scheduling unit, unlike a global counter that would convoy every tenant behind one row.
- State the cost you just took on: a counter is a second source of truth that can drift, so every path that changes status must adjust it inside the same transaction, and a periodic reconciliation has to exist, with resource_revision as the authority for what the count should have been.
Follow-up
- A resource moves from archived back to active. Which statements change, and what breaks if the counter update and the status change land in different transactions?
- The cap becomes plan-dependent and a plan can change mid-month. Where does the number 50 live, and who reads it?
Write the update path that detects a concurrent edit
resource carries version INT NOT NULL DEFAULT 1. resource_revision holds revision_id, resource_id, version, actor_user_id, change_kind, patch JSONB, request_id, created_at with UNIQUE (resource_id, version). outbox_event holds aggregate_type, aggregate_id, aggregate_version, event_type, payload, status. A PUT carries the version the client read. Write the exact statements for the single transaction that applies the edit, records the revision and enqueues 'resource.updated', and give the handler's branch on zero affected rows. Then say what PostgreSQL 16 does under READ COMMITTED when two of these updates hit one row at once.
Approach
- One transaction, three writes, no network call inside it: UPDATE resource SET title = $3, version = version + 1, updated_at = now() WHERE resource_id = $1 AND tenant_id = $4 AND version = $2; then INSERT the resource_revision row at version $2 + 1; then INSERT the outbox_event row at the same aggregate_version. The event goes to a table rather than a broker because no transaction spans both.
- Branch on the affected-row count before doing anything else. Zero has three causes — stale version, wrong tenant, row gone — so re-read once and map to 409 carrying the current version, or 404 for an id outside the caller's tenant, which also stops the endpoint confirming that another tenant's id exists.
- State the engine behaviour instead of assuming it. Under READ COMMITTED the second UPDATE blocks on the row lock, and when the first commits PostgreSQL re-evaluates the WHERE clause against the newly committed row, so the version predicate now fails and the statement reports zero rows. Under REPEATABLE READ the identical collision raises SQLSTATE 40001 instead, so the handler must fold both shapes into one conflict response.
- Keep UNIQUE (resource_id, version) even though the predicate already serialises writers. It is what makes a lost update unwritable if any other path ever reaches the revision table, and it converts a logic bug into 23505 rather than into a silently missing history row.
Follow-up
- A client sends the version it read ten minutes ago and the resource has moved three versions. What is in your 409 so it can resolve the conflict without a full re-fetch?
- Two editors, two disjoint fields, no overlap. Does your answer still refuse the second write, and should it?
How do you ensure Section 508 Compliance in your frontend development?
How do you ensure Section 508 Compliance in your frontend development?
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 approach creating responsive web layouts from static design images?
How do you approach creating responsive web layouts from static design images?
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?
Can you explain the difference between LESS and SASS and how you utilize them for maintainable styling?
Can you explain the difference between LESS and SASS and how you utilize them for maintainable styling?
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 the common challenges you face when consuming RESTful APIs in a frontend-heavy application?
What are the common challenges you face when consuming RESTful APIs in a frontend-heavy application?
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 prioritize tasks when working within a Sprint?
How do you prioritize tasks when working within a Sprint?
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?
Tell us about a time you had to learn a new tool or framework on the fly to meet a project deadline.
Tell us about a time you had to learn a new tool or framework on the fly to meet a project deadline.
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 approach Continuous Integration and Deployment (CI/CD) workflows?
How do you approach Continuous Integration and Deployment (CI/CD) workflows?
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?
One customer endpoint stalls deliveries to every other destination
The egress service delivers about 1.5k webhooks/second across 40,000 destinations, with a per-destination concurrency cap of 4 and a 10-second connect-plus-read timeout. Throughput falls to 300/second, queue depth climbs, and p99 delivery latency for unaffected destinations goes from 200 ms to minutes, while the error rate barely moves. One tenant holds 900 destination rows whose URLs share a hostname that now answers in 9.5 seconds. Explain the mechanism with the arithmetic, then give the containment in the order you would apply it.
Approach
- Look at saturation before errors. A flat error rate with collapsing throughput says nothing is failing, things are waiting, so the first signal to pull is in-flight request count or pool wait time rather than the error counter. This is the distinction that decides the whole investigation.
- Group in-flight work by resolved host, not by destination id. The cap is keyed per destination row, so 900 rows sharing one hostname buy 3,600 concurrent slots against a single host, each held for 9.5 seconds. The bulkhead was never a bulkhead for that host, and grouping by the wrong dimension is why the dashboard looked healthy.
- Do the arithmetic in both directions. Required concurrency is arrival rate times latency, so 1.5k/second at 200 ms needs about 300 in flight, which is entirely consumed by 3,600 slow slots; conversely whatever concurrency is left sustains rate equals concurrency divided by 9.5 seconds, which is the 300/second you are seeing. Matching both numbers is what promotes this from a plausible story to the mechanism.
- Explain why the circuit breaker never helped. It opens on consecutive failures, and a 9.5-second response inside a 10-second timeout is a success. Slow is not failing, so an error-rate breaker cannot see this; you need a slow-call ratio, a deadline propagated from the caller's remaining budget, or a concurrency limiter.
Follow-up
- The host recovers to 80 ms. How long does the queue take to drain, and what does the drain do to the recovered host?
- Where should the 10-second timeout number actually come from?
Built from the rounds and topics North Point Technology candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the North Point Technology loop
- Write out the reported sequence: Screening Call, Technical Interviews, Collaborative Discussion, Final Technical Assessment.
- 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 Scrum / Agile Development
- Spend the session on Scrum / Agile Development, which North Point Technology candidates report being tested on.
- Write one worked example in Scrum / Agile Development and time yourself on it.
Deliverable: One timed worked example in Scrum / Agile Development.
03Work JavaScript (Modern Standards)
- Spend the session on JavaScript (Modern Standards), which North Point Technology candidates report being tested on.
- Write one worked example in JavaScript (Modern Standards) and time yourself on it.
Deliverable: One timed worked example in JavaScript (Modern Standards).
04Work Frontend Web Development
- Spend the session on Frontend Web Development, which North Point Technology candidates report being tested on.
- Write one worked example in Frontend Web Development and time yourself on it.
Deliverable: One timed worked example in Frontend Web Development.
05Answer out loud: Technical Proficiency & Web Development
- Answer aloud, timed: How do you ensure Section 508 Compliance in your frontend development?
- Answer aloud, timed: Describe your experience with JavaScript modularization and strict mode compliance.
Deliverable: Spoken answers to 2 reported Technical Proficiency & Web Development question(s), under time.
06Answer out loud: Agile & Team Collaboration
- Answer aloud, timed: How do you handle a situation where a technical requirement is unclear or ambiguous?
- Answer aloud, timed: Describe your experience using Git and GitHub in a multi-developer environment. How do you manage merge conflicts?
Deliverable: Spoken answers to 2 reported Agile & Team Collaboration question(s), under time.
07Answer out loud: System Architecture & DevOps
- Answer aloud, timed: What is your experience with Docker and Kubernetes in a production environment?
- Answer aloud, timed: How do you approach Continuous Integration and Deployment (CI/CD) workflows?
Deliverable: Spoken answers to 2 reported System Architecture & DevOps 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 your experience with JavaScript modularization and strict mode compliance.
Describe your experience with JavaScript modularization and strict mode compliance.
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 a technical requirement is unclear or ambiguous?
How do you handle a situation where a technical requirement is unclear or ambiguous?
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?
Describe your experience using Git and GitHub in a multi-developer environment. How do you manage merge confli
Describe your experience using Git and GitHub in a multi-developer environment. How do you manage merge conflicts?
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?
What is your experience with Docker and Kubernetes in a production environment?
What is your experience with Docker and Kubernetes in a production environment?
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?
Describe your experience working with open-source solutions and how you vet them for use in secure environment
Describe your experience working with open-source solutions and how you vet them for use in secure environments.
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 your experience with JavaScript modularization and strict mode compliance.
- 02
How do you handle a situation where a technical requirement is unclear or ambiguous?
- 03
Describe your experience using Git and GitHub in a multi-developer environment. How do you manage merge conflicts?
- 04
What is your experience with Docker and Kubernetes in a production environment?
How long does the interview process typically take?
From the initial screen to a final decision, the process generally takes a few weeks, though this can vary based on scheduling and the specific clearance verification requirements of the role.
North Point Technology Software Engineer candidate reports ↗What is the most important thing to focus on during the technical interview?
Focus on explaining your thought process. We are less interested in memorized syntax and more interested in how you approach problem-solving, how you handle edge cases, and how you ensure your code is maintainable.
North Point Technology Software Engineer candidate reports ↗Is there a specific culture at North Point Technology I should know about?
We pride ourselves on being a close-knit, engineer-first organization. We value curiosity, direct communication, and a shared commitment to our mission. You will find that our leadership is accessible and deeply involved in the work we do.
North Point Technology Software Engineer candidate reports ↗Are these roles remote?
Due to the nature of the work and the requirement for TS/SCI clearance, these roles are typically on-site at the specific locations listed.
North Point Technology Software Engineer candidate reports ↗What topics does North Point Technology test in interviews?
North Point Technology interviews most often cover Security Clearance (TS/SCI), Kubernetes, Python, Java, and AWS. The exact emphasis depends on the specific role you apply for.
North Point Technology 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.
- 01North Point Technology 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.
Vercel Software Engineer Interview Guide
Debugging practice for Vercel software engineer prep built on a reproduction you trust, narrowing to the smallest failing input, and changing one variable per run so the result stays attributable.
XANT Software Engineer Interview Guide
What XANT asks Software Engineer candidates, from reported rounds and questions.
Whisker Software Engineer Interview Guide
What Whisker asks Software Engineer candidates, from reported rounds and questions.
WorldWide Technology Holding Software Engineer Interview Guide
What WorldWide Technology Holding asks Software Engineer candidates, from reported rounds and questions.