cswork / libraryOpen practice workspace

Interview guides · PTC

PTC Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at PTC plays a foundational role in building and scaling technology solutions that bridge the physical and digital worlds. PTC develops industry-defining software across Computer-Aided Design (CAD), Product Lifecycle Management (PLM), Internet of Things (IoT), and Augmented Reality (AR). As a Software Engineer, your work directly impacts global manufacturing enterprises, aerospace innovators, automotive giants, and industrial leaders who rely on PTC products like Onshape, Windchill, Creo, and Vuforia to design, manufacture, and service complex physical products. In this position, you will work on engineering challenges that require deep computational rigor and software discipline.

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

Focus areas

  • Data Structures & Algorithms (DSA)
  • Java Fundamentals
  • Problem Solving

The PTC interview process

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

Initial Screening

The first step involves a review of the candidate's application and qualifications.

What to demonstrate

  • The first step involves a review of the candidate's application and qualifications
  • 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 Assessments

Candidates undergo coding tests and technical discussions to evaluate their technical skills.

What to demonstrate

  • Candidates undergo coding tests and technical discussions to evaluate their technical skills
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: How does memory management differ between value and reference types, and what happens during object slicing in C++?
  • Answer aloud and timed: Explain the internal mechanics of a HashMap in Java, including hash collisions, bucket reindexing, and treeification.

Behavioral Interviews

Interviews focus on assessing the candidate's motivations and fit within the company culture.

What to demonstrate

  • Interviews focus on assessing the candidate's motivations and fit within the company culture
  • 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 interviews above and write down what you would ask to confirm before it.

Where candidates lose points

Master Your Resume Projects

Be prepared for deep technical cross-examination on every project listed on your resume. Interviewers will ask you to explain your architectural decisions, data storage choices, security implementations, and specific technical obstacles you overcame.

Practice Paper and Whiteboard Coding

Many PTC technical interviews rely on simple text editors, whiteboards, or physical paper rather than full-featured IDEs with autocomplete. Practice writing syntax-accurate code and tracing memory allocations by hand.

Brush Up on Basic SQL

Do not overlook database fundamentals. Expect to write live SQL queries involving join operations, duplicate record filtration, dynamic subqueries, and aggregate grouping functions during technical interviews.

Structure Your Puzzle Explanations

When presented with a logic puzzle, do not jump straight to a guess. State your initial assumptions, walk through test cases, quantify bounds, and explain your logical deduction step-by-step.

Questions & practice

What is the difference between abstraction and encapsulation, and how do you enforce encapsulation in Java?

Medium · Core Languages & Object-Oriented Design

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?

Explain the difference between compile-time and run-time polymorphism, dynamic method dispatch, and virtual fu

Medium · Core Languages & Object-Oriented Design

Explain the difference between compile-time and run-time polymorphism, dynamic method dispatch, and virtual function tables.

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?

How does memory management differ between value and reference types, and what happens during object slicing in

Medium · Core Languages & Object-Oriented Design

How does memory management differ between value and reference types, and what happens during object slicing in C++?

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?

Explain the internal mechanics of a HashMap in Java, including hash collisions, bucket reindexing, and treeifi

Medium · Core Languages & Object-Oriented Design

Explain the internal mechanics of a HashMap in Java, including hash collisions, bucket reindexing, and treeification.

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 lazy evaluation in Java Streams and how it optimizes chain operations during computational execution.

Medium · Core Languages & Object-Oriented Design

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?

How do you reverse a singly linked list in-place and detect the start node of a cycle using two pointers?

Medium · Data Structures & Algorithmic Problem So

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 representing terrain heights, calculate the total trapped rainwater in O(1) auxilia

Medium · Data Structures & Algorithmic Problem So

Given an array of integers representing terrain heights, calculate the total trapped rainwater in O(1) auxiliary space.

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?

Write a function to generate all lexicographical permutations of a string and analyze its asymptotic time comp

Medium · Data Structures & Algorithmic Problem So

Write a function to generate all lexicographical permutations of a string and analyze its asymptotic time complexity.

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?

How would you construct an efficient custom String class in C++ while manually implementing dynamic memory res

Medium · Data Structures & Algorithmic Problem So

How would you construct an efficient custom String class in C++ while manually implementing dynamic memory resizing and functions like strlen?

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?

Given a binary tree, write a recursive algorithm to find its maximum height and another to determine the longe

Medium · Data Structures & Algorithmic Problem So

Given a binary tree, write a recursive algorithm to find its maximum height and another to determine the longest path between any two nodes.

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?

How do system processes utilize stack versus heap memory, and what happens at the machine level during functio

Medium · Systems, Databases & Backend Architectur

How do system processes utilize stack versus heap memory, and what happens at the machine level during function calls and stack unwinding?

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?

Explain the differences between the C preprocessor, compiler, and linker when resolving global symbols and dyn

Medium · Systems, Databases & Backend Architectur

Explain the differences between the C preprocessor, compiler, and linker when resolving global symbols and dynamic link libraries.

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 SQL query to identify duplicate entries in a table based on specific attributes while retaining prima

Medium · Systems, Databases & Backend Architectur

Write an SQL query to identify duplicate entries in a table based on specific attributes while retaining primary key uniqueness.

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. 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

  1. 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.
  2. 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.
  3. 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.
  4. 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 ACID properties of relational databases and how transaction isolation levels prevent dirty reads.

Medium · Systems, Databases & Backend Architectur

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?

Compare Monolithic architectures to Spring Boot Microservices, detailing how JWT tokens handle stateless authe

Medium · Systems, Databases & Backend Architectur

Compare Monolithic architectures to Spring Boot Microservices, detailing how JWT tokens handle stateless authentication across distributed endpoints.

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?

You have two identical glass balls and a 100-story building. What is the minimum number of drops required to d

Medium · Analytical Puzzles & Logical Reasoning

You have two identical glass balls and a 100-story building. What is the minimum number of drops required to determine the exact floor where a ball breaks?

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?

You are outside a closed room with three light switches, each connected to one of three lamps inside. You can

Medium · Analytical Puzzles & Logical Reasoning

You are outside a closed room with three light switches, each connected to one of three lamps inside. You can enter the room only once; how do you match each switch to its corresponding lamp?

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 how you would solve an inlet-outlet water tank balance puzzle to maintain constant dynamic equilibrium

Medium · Analytical Puzzles & Logical Reasoning

Explain how you would solve an inlet-outlet water tank balance puzzle to maintain constant dynamic equilibrium given variable flow rates.

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 would you implement a dictionary lookup structure for one million words (maximum 20 characters each) over

Medium · Analytical Puzzles & Logical Reasoning

How would you implement a dictionary lookup structure for one million words (maximum 20 characters each) over a 25-character alphabet with optimal space efficiency?

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?

p99 jumped on one listing filter while p50 stayed flat

Medium · query planning · composite index · percentiles

After a release that added an owner_user_id filter to the resource listing, p99 rose from 90 ms to 1.9 s while p50 stayed at 40 ms. Traffic and row counts are unchanged. resource carries the index (tenant_id, status, updated_at DESC, resource_id DESC). The new query filters tenant_id and owner_user_id, orders by updated_at DESC, resource_id DESC, and takes 20 rows. On PostgreSQL, explain the shape of the regression, prove it from a query plan, and give the index you would add.

Approach

  1. Start from the shape. A flat p50 with a moved p99 means a subset of requests changed cost, not all of them, so the first job is naming the subset. Bucket the endpoint's latency by the tenant's row count; the natural hypothesis is that large tenants are a small share of requests and all of the tail.
  2. Get the plan for the new query on a large tenant with EXPLAIN (ANALYZE, BUFFERS). Expect an index scan over the tenant's range, a filter discarding most of it, then a Sort feeding the Limit, possibly reporting Sort Method: external merge Disk. Read actual rows on the scan node, not estimated.
  3. Explain why the existing index cannot serve it. A composite B-tree is seekable only as a left prefix, and with no equality predicate on status the scan cannot treat updated_at as an ordering, because rows in the tenant's range are ordered by status first. Everything matching must be read and sorted before LIMIT 20 can apply, so a tenant with 400,000 rows pays 400,000 rows to return 20.
  4. Add (tenant_id, owner_user_id, updated_at DESC, resource_id DESC). Equality on the first two columns leaves the index ordered by updated_at within that pair, so the plan becomes an index scan that stops after 20 rows with no Sort node. PostgreSQL can scan a B-tree backwards, so the DESC markers matter only if the two sort columns ever disagree in direction; keeping them explicit documents the order the keyset cursor depends on.

Follow-up

  • The endpoint paginates with OFFSET. What does page 500 cost with your index, and what does the keyset version cost?
  • How would you have caught this before release, given that a 10,000-row seed database produces the same plan shape at an unnoticeable cost?

Suggested practice checklist

Built from the rounds and topics PTC candidates report.

Day 1 — Map the PTC loop

  • Write out the reported sequence: Initial Screening, Technical Assessments, Behavioral Interviews.
  • 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 3 reported rounds, with the weakest marked.

Day 2 — Work Data Structures & Algorithms (DSA)

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

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

Deliverable: One timed worked example in Java Fundamentals.

Day 4 — Work Problem Solving

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

Deliverable: One timed worked example in Problem Solving.

Day 5 — Answer out loud: Core Languages & Object-Oriented Design

  • Answer aloud, timed: What is the difference between abstraction and encapsulation, and how do you enforce encapsulation in Java?
  • Answer aloud, timed: Explain the difference between compile-time and run-time polymorphism, dynamic method dispatch, and virtual function tables.

Deliverable: Spoken answers to 2 reported Core Languages & Object-Oriented Design question(s), under time.

Day 6 — Answer out loud: Data Structures & Algorithmic Problem Solving

  • Answer aloud, timed: How do you reverse a singly linked list in-place and detect the start node of a cycle using two pointers?
  • Answer aloud, timed: Given an array of integers representing terrain heights, calculate the total trapped rainwater in O(1) auxiliary space.

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

Day 7 — Answer out loud: Systems, Databases & Backend Architecture

  • Answer aloud, timed: Write an SQL query to identify duplicate entries in a table based on specific attributes while retaining primary key uniqueness.
  • Answer aloud, timed: Explain the ACID properties of relational databases and how transaction isolation levels prevent dirty reads.

Deliverable: Spoken answers to 2 reported Systems, Databases & Backend Architecture question(s), under time.

Behavioural preparation

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

Why are you interested in joining PTC, and which specific product area (such as Onshape, Windchill, or Creo) e

Medium · Behavioral & Cultural Fit

Why are you interested in joining PTC, and which specific product area (such as Onshape, Windchill, or Creo) excites you most?

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 challenging bug or performance bottleneck you encountered in a previous project and how you systema

Medium · Behavioral & Cultural Fit

Describe a challenging bug or performance bottleneck you encountered in a previous project and how you systematically isolated and fixed it.

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 manage competing technical priorities or changing requirements under tight sprint deadlines?

Medium · Behavioral & Cultural Fit

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 time when you received constructive code review feedback that required you to re-architect par

Medium · Behavioral & Cultural Fit

Tell me about a time when you received constructive code review feedback that required you to re-architect part of your solution.

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?