As a Software Engineer at Porter, you are at the heart of one of India’s most dynamic logistics-technology platforms. You are responsible for building and scaling the systems that power real-time logistics, fleet management, and complex delivery routing. Your work directly impacts the efficiency of thousands of driver-partners and the reliability of service for millions of customers, making this a role where technical decisions have immediate, tangible business consequences. The engineering culture at Porter is one of pragmatic problem-solving. You will be expected to balance rapid feature delivery with the long-term stability of high-traffic systems. Whether you are optimizing a database query for a high-concurrency order management service or designing a new microservice to handle peak demand, you are contributing to a platform that is constantly evolving to solve the challenges of urban logistics.
Initial Screening
reportedThe process begins with an initial screening to assess candidate fit.
What to demonstrate
- The process begins with an initial screening to assess candidate fit
- 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.
Online Assessments
reportedCandidates complete assessments featuring multiple-choice questions and algorithmic coding challenges.
What to demonstrate
- Candidates complete assessments featuring multiple-choice questions and algorithmic coding challenges
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Answer aloud and timed: Implement a solution for an advanced prime number generation problem.
- Answer aloud and timed: Explain your approach to balancing time and space complexity during a live coding session.
Technical Interviews
reportedDeep-dive technical interviews focus on problem-solving and technical knowledge.
What to demonstrate
- Deep-dive technical interviews focus on problem-solving and technical knowledge
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Answer aloud and timed: Design a Parking Lot System with class diagrams.
- Answer aloud and timed: Design a Tic-Tac-Toe game, focusing on object-oriented principles.
Inverse Interview
reportedCandidates have the opportunity to ask questions about the team's challenges and technical debt.
What to demonstrate
- Candidates have the opportunity to ask questions about the team's challenges and technical debt
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Answer aloud and timed: Design an OTP system capable of being used by multiple internal services.
- Answer aloud and timed: Explain the use of SOLID principles and how you would apply them to a real-world service.
Hiring Manager Discussion
reportedFinal discussions with the hiring manager to evaluate fit and potential.
What to demonstrate
- Final discussions with the hiring manager to evaluate fit and potential
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Prepare two projects you led end to end, each with the decision you owned and what it cost.
- Have three questions about the team's roadmap and how success is measured in the first six months.
PracHub editorial advice for the preparation topics above.
Prioritize Code Quality
Even in a time-pressured interview, aim for clean, readable code. Use meaningful variable names and modularize your logic.
Think Out Loud
Your interviewer is interested in your thought process. Explain your trade-offs as you design your solution; it helps them guide you if you get stuck.
Master your Resume
Be prepared to discuss every technology and project mentioned in your profile in depth. If you mention Postgres, be ready for questions on indexing and transaction isolation levels.
Prepare for the Inverse Round
Use this as an opportunity to demonstrate your seniority by asking about the company's long-term technical roadmap.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Find the second largest element in an array.
Find the second largest element in an array.
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?
Solve the Valid Parenthesis String problem (LeetCode 678).
Solve the Valid Parenthesis String problem (LeetCode 678).
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?
Implement a solution for an advanced prime number generation problem.
Implement a solution for an advanced prime number generation problem.
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?
Explain your approach to balancing time and space complexity during a live coding session.
Explain your approach to balancing time and space complexity during a live coding session.
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?
Replace offset paging on the resource feed with keyset
resource holds resource_id, tenant_id, owner_user_id, title, body_ref, version, status ('draft','active','archived','deleted'), created_at, updated_at, deleted_at, with an index on (tenant_id, status, updated_at DESC, resource_id DESC). The listing endpoint returns active resources for one tenant, newest update first, 50 per page, today with LIMIT 50 OFFSET n. Tenants reach page 400 and rows are created while they read. Write the keyset query, define what the cursor carries and how it is encoded, and say which part of the index each predicate uses. Assume PostgreSQL 16.
Approach
- Name the two failures separately. OFFSET 20000 makes the server produce and discard 20,000 rows, so page cost grows with depth rather than with page size. Independently, any write that changes how many rows sort above the offset moves the window between two fetches, and the direction decides which anomaly you get: an insert lands at the head of updated_at DESC and pushes already-returned rows down past the boundary, so they are returned a second time; a delete above the offset, or a row whose updated_at is bumped above the cursor, pulls rows up and one is never returned at all. Nothing in the response reveals either.
- Write the seek: WHERE tenant_id = $1 AND status = 'active' AND (updated_at, resource_id) < ($2, $3) ORDER BY updated_at DESC, resource_id DESC LIMIT 50. The row-value comparison is one index range rather than a disjunction, and both columns are NOT NULL, which is what makes that comparison well defined.
- Map each predicate onto the index: tenant_id and status are equality on the leading columns, (updated_at, resource_id) is the range, and the ORDER BY matches the index order so no Sort node appears and the scan stops after 50 rows. The DESC in the definition only matters for mixed directions — a plain ascending btree on the same columns is read backwards for this query.
- Put both sort columns in the cursor and nothing the client can tamper with into another tenant: base64 of (updated_at, resource_id), validated server-side, with tenant_id taken from the principal.
Follow-up
- The client asks for 'jump to page 400'. What do you offer instead, and what does the honest version cost?
- Sort order becomes user-selectable across four columns. How many indexes is that, and which would you refuse to add?
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?
Design a Parking Lot System with class diagrams.
Design a Parking Lot System with class diagrams.
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 Tic-Tac-Toe game, focusing on object-oriented principles.
Design a Tic-Tac-Toe game, focusing on object-oriented principles.
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 an OTP system capable of being used by multiple internal services.
Design an OTP system capable of being used by multiple internal services.
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?
Explain the use of SOLID principles and how you would apply them to a real-world service.
Explain the use of SOLID principles and how you would apply them to a real-world service.
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 shipping or logistics management model.
Design a shipping or logistics management model.
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 system similar to BookMyShow, covering database design and service architecture.
Design a system similar to BookMyShow, covering database design and service architecture.
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?
Explain your choice between PostgreSQL and MongoDB for specific service requirements.
Explain your choice between PostgreSQL and MongoDB for specific service requirements.
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?
Every query on one table stalls for forty seconds mid-deploy
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
- 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.
- 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.
- 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.
- 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?
Built from the rounds and topics Porter candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Porter loop
- Write out the reported sequence: Initial Screening, Online Assessments, Technical Interviews, Inverse Interview, Hiring Manager Discussion.
- 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 5 reported rounds, with the weakest marked.
02Work Data Structures & Algorithms (DSA)
- Spend the session on Data Structures & Algorithms (DSA), which Porter 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 Low-Level Design (LLD)
- Spend the session on Low-Level Design (LLD), which Porter candidates report being tested on.
- Write one worked example in Low-Level Design (LLD) and time yourself on it.
Deliverable: One timed worked example in Low-Level Design (LLD).
04Work System Design
- Spend the session on System Design, which Porter 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.
05Answer out loud: Data Structures and Algorithms
- Answer aloud, timed: Find the second largest element in an array.
- Answer aloud, timed: Solve the Valid Parenthesis String problem (LeetCode 678).
Deliverable: Spoken answers to 2 reported Data Structures and Algorithms question(s), under time.
06Answer out loud: Low-Level Design (LLD)
- Answer aloud, timed: Design a Parking Lot System with class diagrams.
- Answer aloud, timed: Design a Tic-Tac-Toe game, focusing on object-oriented principles.
Deliverable: Spoken answers to 2 reported Low-Level Design (LLD) question(s), under time.
07Answer out loud: High-Level Design (HLD)
- Answer aloud, timed: Design a shipping or logistics management model.
- Answer aloud, timed: Design a system similar to BookMyShow, covering database design and service architecture.
Deliverable: Spoken answers to 2 reported High-Level Design (HLD) 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.
Walk through a complex technical challenge you faced in a previous project.
Walk through a complex technical challenge you faced in a previous project.
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 disagreements on technical architecture?
How do you handle disagreements on technical architecture?
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 are you looking for in your next role, and why Porter?
What are you looking for in your next role, and why Porter?
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
Walk through a complex technical challenge you faced in a previous project.
- 02
How do you handle disagreements on technical architecture?
- 03
What are you looking for in your next role, and why Porter?
How long should I prepare for the interview?
Given the mix of DSA, LLD, and HLD, most candidates benefit from 3–6 weeks of structured preparation. Focus on practicing standard problems until you can solve them under time constraints.
Porter Software Engineer candidate reports ↗Is the system design round always focused on logistics?
Not necessarily. While logistics-related questions are common, you may be asked to design generic high-traffic systems like BookMyShow or notification services to test your general architectural intuition.
Porter Software Engineer candidate reports ↗What is the most common reason for rejection?
Aside from technical performance, candidates are often passed over if they struggle to justify their design decisions or if they fail to show a deep understanding of the core technologies they listed on their resume.
Porter Software Engineer candidate reports ↗What topics does Porter test in interviews?
Porter interviews most often cover Case Study Analysis, SQL, Python, Low-Level Design (LLD), and High-Level Design (HLD). The exact emphasis depends on the specific role you apply for.
Porter 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.
- 01Porter 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.
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.
Together Ai Software Engineer Interview Guide
Failure-handling practice for Together Ai 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.
Spotify Software Engineer Interview Guide
Timed practice for Spotify software engineer candidates who lose time to the clock: short problems taken end to end, then reviewed against a written rubric rather than a passing test run.