Plangrid Software Engineer Interview Guide

The 60-second brief

As a Software Engineer at Plangrid (an Autodesk company), you are responsible for building high-performance, robust, and scalable systems that power the global construction technology ecosystem. Plangrid delivers real-time collaboration tools, blueprint rendering engines, and heavy-duty field management platforms used by millions of contractors, architects, and project managers worldwide. In this role, your code directly influences how critical infrastructure and physical environments are constructed across the globe. The problem space for a Software Engineer here is distinctively challenging. You will tackle complex data synchronizations across offline-first mobile devices, manage massive spatial datasets, and construct ultra-fast user interface workflows.

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

Focus areas

• Data Structures & Algorithms (DSA)
• System Design (basic to advanced)
• SQL

The Plangrid interview process

Plangrid candidates report 6 rounds over 4-6 weeks. The stages below are what candidates describe, not a published process.

Application Screen

Initial review of application to assess qualifications and fit for the role.

What to demonstrate

• Initial review of application to assess qualifications and fit for the role
• Depth in Data Structures & Algorithms (DSA)

How to prepare

• Answer aloud and timed: Explain the difference between compile-time and runtime polymorphism in C++ with practical examples.
• Answer aloud and timed: How do virtual functions and virtual tables (vtables) work under the hood?

Technical Screening

Assessment of algorithmic efficiency and core language fundamentals, often via CodeSignal/Scaler.

What to demonstrate

• Assessment of algorithmic efficiency and core language fundamentals, often via CodeSignal/Scaler
• Depth in Data Structures & Algorithms (DSA)

How to prepare

• Answer aloud and timed: Why would you choose C++ over a managed language like Java or Python for low-latency engine components?
• Answer aloud and timed: Explain the concept of Resource Acquisition Is Initialization (RAII) and how it prevents resource leaks.

Onsite Interview

Multiple rounds focusing on practical engineering capability, real-time collaboration, and architectural problem-solving.

What to demonstrate

• Multiple rounds focusing on practical engineering capability, real-time collaboration, and architectural problem-solving
• Depth in Data Structures & Algorithms (DSA)

How to prepare

• Answer aloud and timed: What is the memory layout of an object in C++, and what is the internal difference between a pointer to a constant versus a constant pointer?
• Answer aloud and timed: Write an algorithm to find the minimum element in a rotated sorted array.

Live Coding

Deep-dive coding session to evaluate coding skills and problem-solving abilities.

What to demonstrate

• Deep-dive coding session to evaluate coding skills and problem-solving abilities
• Depth in Data Structures & Algorithms (DSA)

How to prepare

• Answer aloud and timed: Implement a function to reverse nodes in $k$-group within a singly linked list.
• Answer aloud and timed: Given an array of integers, compute the product of all elements except the self element without using the division operator.

System Design

Evaluation of system design skills and architectural thinking.

What to demonstrate

• Evaluation of system design skills and architectural thinking
• Depth in Data Structures & Algorithms (DSA)

How to prepare

• Answer aloud and timed: Solve the sliding window maximum problem efficiently using appropriate data structures.
• Answer aloud and timed: Find all unique triplets in an array that sum to zero, ensuring optimal space complexity.

Behavioral Evaluation

Assessment of cultural fit and team collaboration through behavioral questions.

What to demonstrate

• Assessment of cultural fit and team collaboration through behavioral questions
• Depth in Data Structures & Algorithms (DSA)

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 behavioral evaluation above and write down what you would ask to confirm before it.

Where candidates lose points

Master core language mechanics

If interviewing for C++ roles, review pointers, memory references, virtual tables, and RAII. If interviewing for frontend roles, ensure you can write pure React/TypeScript live without reliance on heavy external libraries.

Think out loud during coding rounds

Interviewers value your thought process as much as your final code solution. Explain your approach, discuss runtime complexity trade-offs, and state assumptions before typing.

Prepare your resume projects in depth

Be prepared to justify every technical choice on your resume. Interviewers frequently conduct detailed discussions into your past architectural decisions, database schemas, and API choices.

Be ready for system design scenarios

Practice drawing out architecture flows from input ingestion down to data persistence and monitoring alerts.

Questions & practice

Explain the difference between compile-time and runtime polymorphism in C++ with practical examples.

Medium · Computer Science Fundamentals & OOP

Approach

1. Say what the runtime actually does before reasoning about the code.
2. Name what is shared across threads and what owns each piece of state.
3. Identify the window where an invariant is briefly untrue.
4. 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?

What is the memory layout of an object in C++, and what is the internal difference between a pointer to a cons

Medium · Computer Science Fundamentals & OOP

What is the memory layout of an object in C++, and what is the internal difference between a pointer to a constant versus a constant pointer?

Approach

1. Say what the runtime actually does before reasoning about the code.
2. Name what is shared across threads and what owns each piece of state.
3. Identify the window where an invariant is briefly untrue.
4. 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?

Write an algorithm to find the minimum element in a rotated sorted array.

Medium · Data Structures & Algorithms

Approach

1. Restate the input: its shape, its size, and what is guaranteed about it.
2. Name the brute-force solution and its complexity before improving on it.
3. Choose the data structure from the access pattern, not from familiarity.
4. 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?

Implement a function to reverse nodes in $k$-group within a singly linked list.

Medium · Data Structures & Algorithms

Approach

1. Restate the input: its shape, its size, and what is guaranteed about it.
2. Name the brute-force solution and its complexity before improving on it.
3. Choose the data structure from the access pattern, not from familiarity.
4. 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?

Given an array of integers, compute the product of all elements except the self element without using the divi

Medium · Data Structures & Algorithms

Given an array of integers, compute the product of all elements except the self element without using the division operator.

Approach

1. Restate the input: its shape, its size, and what is guaranteed about it.
2. Name the brute-force solution and its complexity before improving on it.
3. Choose the data structure from the access pattern, not from familiarity.
4. 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?

Solve the sliding window maximum problem efficiently using appropriate data structures.

Medium · Data Structures & Algorithms

Approach

1. Restate the input: its shape, its size, and what is guaranteed about it.
2. Name the brute-force solution and its complexity before improving on it.
3. Choose the data structure from the access pattern, not from familiarity.
4. 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 all unique triplets in an array that sum to zero, ensuring optimal space complexity.

Medium · Data Structures & Algorithms

Approach

1. Restate the input: its shape, its size, and what is guaranteed about it.
2. Name the brute-force solution and its complexity before improving on it.
3. Choose the data structure from the access pattern, not from familiarity.
4. 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?

Describe the key differences between synchronous and asynchronous functions in JavaScript/TypeScript.

Medium · Web Technologies, Frameworks & API Desig

Approach

1. Say what the runtime actually does before reasoning about the code.
2. Name what is shared across threads and what owns each piece of state.
3. Identify the window where an invariant is briefly untrue.
4. 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?

Describe an instance where an interview or project requirement was ambiguous. How did you establish clarity an

Medium · Behavioral & Team Collaboration

Describe an instance where an interview or project requirement was ambiguous. How did you establish clarity and make forward progress?

Approach

1. Restate the input: its shape, its size, and what is guaranteed about it.
2. Name the brute-force solution and its complexity before improving on it.
3. Choose the data structure from the access pattern, not from familiarity.
4. 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?

Explain why the owner filter ignores the listing index

Medium · composite index · query plans · sort elimination

The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.

Approach

1. Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
2. For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
3. Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
4. Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.

Follow-up

• 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
• A dashboard runs this for 40 owners in one page load. What changes about the design?

Hold a per-tenant active cap against concurrent creates

Hard · write skew · isolation levels · constraints

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

1. 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.
2. 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.
3. 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.
4. 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?

How do virtual functions and virtual tables (vtables) work under the hood?

Medium · Computer Science Fundamentals & OOP

Approach

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

Follow-up

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

Why would you choose C++ over a managed language like Java or Python for low-latency engine components?

Medium · Computer Science Fundamentals & OOP

Approach

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

Follow-up

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

Explain the concept of Resource Acquisition Is Initialization (RAII) and how it prevents resource leaks.

Medium · Computer Science Fundamentals & OOP

Approach

1. Clarify what is being asked and what a complete answer contains.
2. State your assumptions explicitly before working the problem.
3. Say what you would check first and why it is the highest-information step.
4. 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 WebSockets differ from standard HTTP polling, and when would you choose GraphQL over REST?

Medium · Web Technologies, Frameworks & API Desig

Approach

1. Say who the caller is and what they do when the call fails halfway.
2. Define the identity of a request so a retry cannot double-apply it.
3. Separate accepted, pending, failed and confirmed; they are different facts.
4. 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?

Build a full-stack React and Node.js web component featuring live form validation and secure state management.

Medium · Web Technologies, Frameworks & API Desig

Approach

1. Say who the caller is and what they do when the call fails halfway.
2. Define the identity of a request so a retry cannot double-apply it.
3. Separate accepted, pending, failed and confirmed; they are different facts.
4. 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 do you design a secure API endpoint that authenticates a user and returns a structured token response?

Medium · Web Technologies, Frameworks & API Desig

Approach

1. Say who the caller is and what they do when the call fails halfway.
2. Define the identity of a request so a retry cannot double-apply it.
3. Separate accepted, pending, failed and confirmed; they are different facts.
4. 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 distributed room reservation system capable of handling high concurrency without double

Medium · System Design & Architecture

How would you design a distributed room reservation system capable of handling high concurrency without double bookings?

Approach

1. Fix the scope first: who calls this, how often, and what they do when it fails.
2. Name the read and write paths separately; they rarely have the same bottleneck.
3. Choose a partition key and say what query it makes expensive.
4. 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 real-time messaging and alerting system for tracking job queue failures and monitoring pipeline outpu

Medium · System Design & Architecture

Design a real-time messaging and alerting system for tracking job queue failures and monitoring pipeline outputs.

Approach

1. Fix the scope first: who calls this, how often, and what they do when it fails.
2. Name the read and write paths separately; they rarely have the same bottleneck.
3. Choose a partition key and say what query it makes expensive.
4. 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 do you manage high cardinality issues in monitoring systems using tools like Prometheus and OpenTelemetry?

Medium · System Design & Architecture

Approach

1. Fix the scope first: who calls this, how often, and what they do when it fails.
2. Name the read and write paths separately; they rarely have the same bottleneck.
3. Choose a partition key and say what query it makes expensive.
4. 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?

Explain strategies for sampling trace data (head-based vs. tail-based) in distributed tracing collectors.

Medium · System Design & Architecture

Approach

1. Fix the scope first: who calls this, how often, and what they do when it fails.
2. Name the read and write paths separately; they rarely have the same bottleneck.
3. Choose a partition key and say what query it makes expensive.
4. 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 high-throughput data processing pipeline that gracefully handles network drops and offline storage sy

Medium · System Design & Architecture

Design a high-throughput data processing pipeline that gracefully handles network drops and offline storage synchronization.

Approach

1. Fix the scope first: who calls this, how often, and what they do when it fails.
2. Name the read and write paths separately; they rarely have the same bottleneck.
3. Choose a partition key and say what query it makes expensive.
4. 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?

Every query on one table stalls for forty seconds mid-deploy

Medium · lock contention · ddl · migrations

During a release on PostgreSQL, every query touching resource times out for about 40 seconds and then recovers with no intervention. The release ran one migration, ALTER TABLE resource ADD COLUMN archived_reason TEXT, and the migration log shows it completing in 6 ms. Unrelated tables showed no change in error rate. Explain how a 6 ms statement caused a 40-second stall, give the ordered checks you would run on a live system to confirm it, and give the migration procedure that prevents a repeat.

Approach

1. Separate the statement's duration from the lock's duration. ADD COLUMN with no default is a catalogue-only change and genuinely runs in milliseconds, but it requires ACCESS EXCLUSIVE, and it cannot acquire that until every transaction already touching the table has finished.
2. Account for the queueing, which is the part that surprises people. A lock request that is waiting blocks later requests for conflicting modes behind it rather than letting them overtake, so one long-open transaction holds the DDL and the DDL holds all the traffic. The stall length is set by the longest open transaction, not by the size of the change.
3. Confirm on a live system in this order: pg_stat_activity for that table ordered by xact_start, looking for the oldest transaction and specifically for state = idle in transaction; then pg_locks where granted = false to find the waiter; then join them on pid to name blocker and blocked. pg_blocking_pids() does that join for you and is the fastest single call.
4. Prevent rather than merely time it better. Set lock_timeout to a second or two on the migration session so the DDL abandons the queue after a bounded wait and is retried, instead of holding it for as long as the oldest transaction lives. Be exact about what that buys: queries arriving during the wait still queue behind the pending ACCESS EXCLUSIVE request, so each attempt costs them up to one lock_timeout of added latency. The outage goes from 40 seconds to about one second per attempt, not to zero. Also run migrations away from deploy-time peaks, and put a statement timeout and an idle-in-transaction timeout on the analytics role that opens the long transactions.

Follow-up

• The same release also wants NOT NULL on that column. What is the sequence that gets there without a long lock?
• Your lock_timeout retry fails ten times in a row because the analytics transaction is always open. What do you change?

Suggested practice checklist

Built from the rounds and topics Plangrid candidates report.

Day 1 — Map the Plangrid loop

• Write out the reported sequence: Application Screen, Technical Screening, Onsite Interview, Live Coding, System Design, Behavioral Evaluation.
• 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 6 reported rounds, with the weakest marked.

Day 2 — Work Data Structures & Algorithms (DSA)

• Spend the session on Data Structures & Algorithms (DSA), which Plangrid 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).

Day 3 — Work System Design (basic to advanced)

• Spend the session on System Design (basic to advanced), which Plangrid candidates report being tested on.
• Write one worked example in System Design (basic to advanced) and time yourself on it.

Deliverable: One timed worked example in System Design (basic to advanced).

Day 4 — Work SQL

• Spend the session on SQL, which Plangrid candidates report being tested on.
• Write one worked example in SQL and time yourself on it.

Deliverable: One timed worked example in SQL.

Day 5 — Answer out loud: Computer Science Fundamentals & OOP

• Answer aloud, timed: Explain the difference between compile-time and runtime polymorphism in C++ with practical examples.
• Answer aloud, timed: How do virtual functions and virtual tables (vtables) work under the hood?

Deliverable: Spoken answers to 2 reported Computer Science Fundamentals & OOP question(s), under time.

Day 6 — Answer out loud: Data Structures & Algorithms

• Answer aloud, timed: Write an algorithm to find the minimum element in a rotated sorted array.
• Answer aloud, timed: Implement a function to reverse nodes in $k$-group within a singly linked list.

Deliverable: Spoken answers to 2 reported Data Structures & Algorithms question(s), under time.

Day 7 — Answer out loud: Web Technologies, Frameworks & API Design

• Answer aloud, timed: How do WebSockets differ from standard HTTP polling, and when would you choose GraphQL over REST?
• Answer aloud, timed: Describe the key differences between synchronous and asynchronous functions in JavaScript/TypeScript.

Deliverable: Spoken answers to 2 reported Web Technologies, Frameworks & API Design question(s), under time.

Behavioural preparation

Behavioural rounds judge the decision you made and what it cost.

How do you handle state re-renders, hooks lifecycle, and performance optimization in modern React applications

Medium · Web Technologies, Frameworks & API Desig

How do you handle state re-renders, hooks lifecycle, and performance optimization in modern React applications?

Approach

1. Pick a story where you made the decision, not one where you watched it.
2. State the situation in two sentences and spend the rest on the reasoning.
3. Give the blast radius: what could have broken, and what you measured.
4. 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 a situation where your technical solution was more efficient than your manager's proposed approach. H

Medium · Behavioral & Team Collaboration

Describe a situation where your technical solution was more efficient than your manager's proposed approach. How did you handle the discussion?

Approach

1. Pick a story where you made the decision, not one where you watched it.
2. State the situation in two sentences and spend the rest on the reasoning.
3. Give the blast radius: what could have broken, and what you measured.
4. 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 past project where you had to make a difficult architectural compromise to meet a business dea

Medium · Behavioral & Team Collaboration

Tell me about a past project where you had to make a difficult architectural compromise to meet a business deadline.

Approach

1. Pick a story where you made the decision, not one where you watched it.
2. State the situation in two sentences and spend the rest on the reasoning.
3. Give the blast radius: what could have broken, and what you measured.
4. 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 approach code reviews when working with cross-functional or geographically distributed engineering

Medium · Behavioral & Team Collaboration

How do you approach code reviews when working with cross-functional or geographically distributed engineering teams?

Approach

1. Pick a story where you made the decision, not one where you watched it.
2. State the situation in two sentences and spend the rest on the reasoning.
3. Give the blast radius: what could have broken, and what you measured.
4. 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?