As a Software Engineer at Inadev, you are at the intersection of complex problem-solving and scalable software delivery. This role is critical to the organization’s mission of providing high-impact digital solutions, often involving modern cloud architectures, microservices, and robust API integrations. You will be responsible for building, maintaining, and scaling systems that directly support our clients' most demanding technical requirements. Success in this role requires more than just technical proficiency; it demands a mindset geared toward continuous learning and adaptability. You will frequently collaborate with cross-functional teams, including product managers and senior leadership, to translate business objectives into functional code. Whether you are optimizing existing services or architecting new features, your work will directly influence the efficiency and reliability of the platforms Inadev is known for. 02 · Compensation
Initial Screening
reportedHigh-level discussions about your experience to assess fit for the role.
What to demonstrate
- High-level discussions about your experience to assess fit for the role
- Depth in Python
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 Evaluation
reportedDeep dives into your technical capabilities through various assessments.
What to demonstrate
- Deep dives into your technical capabilities through various assessments
- Depth in Python
How to prepare
- Answer aloud and timed: Explain your approach to solving complex algorithmic puzzles.
- Answer aloud and timed: How do you design and implement scalable microservices?
Managerial/Panel Review
reportedFinal review with management or a panel to evaluate overall fit and skills.
What to demonstrate
- Final review with management or a panel to evaluate overall fit and skills
- Depth in Python
How to prepare
- Answer aloud and timed: What are the best practices for building and securing APIs?
- Answer aloud and timed: Can you explain the core concepts of OOP (Object-Oriented Programming) and how they apply to your code?
PracHub editorial advice for the preparation topics above.
Prioritize clarity over complexity
When answering technical questions, start with a simple, robust solution before discussing advanced optimizations.
Communicate your thought process
In coding rounds, talk through your logic. This helps the interviewer understand how you approach problems, even if you run into a syntax error.
Prepare for behavioral questions
Use the STAR method (Situation, Task, Action, Result) to frame your stories about past projects and challenges.
Be ready to discuss CI/CD
Many roles at Inadev involve automated workflows; having a clear understanding of your deployment process is a major plus.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Can you write a function to generate the Fibonacci sequence?
Can you write a function to generate the Fibonacci sequence?
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?
How would you approach a logical coding challenge under time constraints?
How would you approach a logical coding challenge under time constraints?
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 solving complex algorithmic puzzles.
Explain your approach to solving complex algorithmic puzzles.
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?
How do you design and implement scalable microservices?
How do you design and implement scalable microservices?
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?
What are the best practices for building and securing APIs?
What are the best practices for building and securing APIs?
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 core concepts of OOP (Object-Oriented Programming) and how they apply to your code?
Can you explain the core concepts of OOP (Object-Oriented Programming) and how they apply to your code?
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?
p99 jumped on one listing filter while p50 stayed flat
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
- 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.
- 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.
- 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.
- 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?
Built from the rounds and topics Inadev candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Inadev loop
- Write out the reported sequence: Initial Screening, Technical Evaluation, Managerial/Panel Review.
- 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.
02Work Python
- Spend the session on Python, which Inadev candidates report being tested on.
- Write one worked example in Python and time yourself on it.
Deliverable: One timed worked example in Python.
03Work React.js
- Spend the session on React.js, which Inadev candidates report being tested on.
- Write one worked example in React.js and time yourself on it.
Deliverable: One timed worked example in React.js.
04Work Coding / Algorithmic Problem Solving
- Spend the session on Coding / Algorithmic Problem Solving, which Inadev candidates report being tested on.
- Write one worked example in Coding / Algorithmic Problem Solving and time yourself on it.
Deliverable: One timed worked example in Coding / Algorithmic Problem Solving.
05Answer out loud: Coding and Algorithms
- Answer aloud, timed: Can you write a function to generate the Fibonacci sequence?
- Answer aloud, timed: How would you approach a logical coding challenge under time constraints?
Deliverable: Spoken answers to 2 reported Coding and Algorithms question(s), under time.
06Answer out loud: Technical Domain Knowledge
- Answer aloud, timed: How do you design and implement scalable microservices?
- Answer aloud, timed: What are the best practices for building and securing APIs?
Deliverable: Spoken answers to 2 reported Technical Domain Knowledge question(s), under time.
07Answer out loud: Behavioral and Leadership
- Answer aloud, timed: How do you stay updated with emerging technologies like AI?
- Answer aloud, timed: Tell me about a time you had to learn a new tool or language quickly to complete a project.
Deliverable: Spoken answers to 2 reported Behavioral and Leadership question(s), under time.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
How do you handle SQL database queries and performance optimization?
How do you handle SQL database queries and performance optimization?
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 with CI/CD pipelines and automated deployment.
Describe your experience with CI/CD pipelines and automated deployment.
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 stay updated with emerging technologies like AI?
How do you stay updated with emerging technologies like AI?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
Tell me about a time you had to learn a new tool or language quickly to complete a project.
Tell me about a time you had to learn a new tool or language quickly to complete a 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 feedback from stakeholders or senior leadership?
How do you handle feedback from stakeholders or senior leadership?
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 process for working within a team to resolve a technical blocker.
Describe your process for working within a team to resolve a technical blocker.
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
How do you handle SQL database queries and performance optimization?
- 02
Describe your experience with CI/CD pipelines and automated deployment.
- 03
How do you stay updated with emerging technologies like AI?
- 04
Tell me about a time you had to learn a new tool or language quickly to complete a project.
How difficult are the technical interviews?
The difficulty is generally considered average, focusing on practical application rather than obscure brain teasers. If you are comfortable with basic data structures and your core language, you will be well-prepared.
Inadev Software Engineer candidate reports ↗What is the typical timeline for the hiring process?
While it varies, the process generally moves within a few weeks from the initial screen to the final decision. If you do not hear back within a reasonable timeframe, it is acceptable to follow up with your recruiter.
Inadev Software Engineer candidate reports ↗Is there an emphasis on specific coding languages?
Yes, given the focus on Python and React.js, you should be prepared to write code in these languages during your technical assessment.
Inadev Software Engineer candidate reports ↗What differentiates successful candidates?
Successful candidates are those who demonstrate both technical competence and a genuine interest in the business impact of their work. Being able to explain *why* you chose a specific technical path is often more important than the code itself.
Inadev Software Engineer candidate reports ↗What topics does Inadev test in interviews?
Inadev interviews most often cover Python, Project Management, React.js, Requirements Management, and Coding / Algorithmic Problem Solving. The exact emphasis depends on the specific role you apply for.
Inadev 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.
- 01Inadev 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.
Discord Software Engineer Interview Guide
Database practice for Discord candidates: how an index changes a query plan, and which anomalies survive a given isolation level, since read committed still permits non-repeatable reads.
Cohere Software Engineer Interview Guide
Testing exercises for Cohere software engineer prep: choosing boundary cases over repetition, isolating tests from shared clock and ordering, and treating an intermittent failure as a defect rather than noise.
Rystad Energy Software Engineer Interview Guide
Prepare for Rystad Energy software interviews with worked Python validation, OOP and decorator examples, plus an ingestion case and practical checks.
Webcreek Software Engineer Interview Guide
What Webcreek asks Software Engineer candidates, from reported rounds and questions.