As a Software Engineer at iHerb, you are at the core of a global e-commerce powerhouse that serves millions of customers. Your work directly impacts the platform's ability to scale, manage complex supply chains, and deliver a seamless shopping experience for health and wellness products worldwide. You will be tasked with building robust, high-performance systems that handle significant traffic, ensuring that the technology stack remains reliable and efficient as the company grows. This role requires a blend of technical depth and practical problem-solving. Whether you are working on front-end interfaces, back-end service architecture, or data-driven optimizations, you will be expected to contribute to a culture of high performance. You will collaborate with cross-functional teams to solve real-world challenges, moving beyond theoretical knowledge to implement solutions that drive tangible business results. ##### Tip The interview process at iHerb is known for its fast pace. If you are invited to an onsite, be prepared for a quick turnaround and ensure your schedule is flexible to accommodate multiple rounds.
Phone Screen
reportedEngage in a phone screen with a recruiter after the initial application.
What to demonstrate
- Engage in a phone screen with a recruiter after the initial application
- Depth in Algorithms (General)
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 Screening
reportedParticipate in one or more technical screenings with engineers or hiring managers.
What to demonstrate
- Participate in one or more technical screenings with engineers or hiring managers
- Depth in Algorithms (General)
How to prepare
- Answer aloud and timed: How do you handle responsive design requirements using CSS and media queries?
- Answer aloud and timed: What are the differences between various sorting algorithms and when would you use each?
Onsite/Virtual Panel Interview
reportedAttend an onsite or virtual panel interview covering technical depth, coding challenges, and behavioral assessment.
What to demonstrate
- Attend an onsite or virtual panel interview covering technical depth, coding challenges, and behavioral assessment
- Depth in Algorithms (General)
How to prepare
- Answer aloud and timed: How does the request-response cycle work in an IIS or.NET environment?
- Answer aloud and timed: How would you find a duplicate number in a collection?
PracHub editorial advice for the preparation topics above.
Own your projects
Be prepared to dive deep into any project listed on your resume; know the architecture, the challenges faced, and the results achieved.
Practice whiteboard coding
Even if you are a senior engineer, brush up on fundamental data structures and algorithmic complexity.
Ask questions
Use the interview to learn about their engineering culture, how they handle code reviews, and their approach to technical debt.
Stay professional
Regardless of the interviewer's demeanor, maintain a polite and professional tone; it reflects your ability to handle difficult stakeholders.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
What are the differences between various sorting algorithms and when would you use each?
What are the differences between various sorting algorithms and when would you use each?
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 find a duplicate number in a collection?
How would you find a duplicate number in a collection?
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?
Can you write a function to perform a Breadth-First Search (BFS) on a directed graph?
Can you write a function to perform a Breadth-First Search (BFS) on a directed graph?
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 implement a basic React component to manage a counter state?
How would you implement a basic React component to manage a counter state?
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?
Given a set of requirements, how would you structure a data model for a shopping cart?
Given a set of requirements, how would you structure a data model for a shopping cart?
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?
Stop tag and share joins from fanning out a page
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
- 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.
- 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.
- 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.
- 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 why the owner filter ignores the listing index
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
- 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.
- 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.
- 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.
- 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?
What are the three defining characteristics of Object-Oriented Programming (OOP)?
What are the three defining characteristics of Object-Oriented Programming (OOP)?
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 how you would set up a server or a database for a new project?
Can you explain how you would set up a server or a database for a new project?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
How does the request-response cycle work in an IIS or.NET environment?
How does the request-response cycle work in an IIS or.NET environment?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
What is your process for debugging a production issue you have never encountered before?
What is your process for debugging a production issue you have never encountered before?
Approach
- Establish what changed and when, before forming any theory.
- Pick a bisection that eliminates candidates whichever way it turns out.
- Check the instrumentation before believing the symptom.
- Separate the trigger from the cause; the deploy is rarely the bug.
Follow-up
- What would you look at first, and what would it rule out?
- How would you tell a cause from a coincidence here?
Built from the rounds and topics iHerb candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the iHerb loop
- Write out the reported sequence: Phone Screen, Technical Screening, Onsite/Virtual Panel Interview.
- 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 Algorithms (General)
- Spend the session on Algorithms (General), which iHerb candidates report being tested on.
- Write one worked example in Algorithms (General) and time yourself on it.
Deliverable: One timed worked example in Algorithms (General).
03Work Data Structures
- Spend the session on Data Structures, which iHerb candidates report being tested on.
- Write one worked example in Data Structures and time yourself on it.
Deliverable: One timed worked example in Data Structures.
04Work Whiteboarding
- Spend the session on Whiteboarding, which iHerb candidates report being tested on.
- Write one worked example in Whiteboarding and time yourself on it.
Deliverable: One timed worked example in Whiteboarding.
05Answer out loud: Technical and Domain Knowledge
- Answer aloud, timed: What are the three defining characteristics of Object-Oriented Programming (OOP)?
- Answer aloud, timed: Can you explain how you would set up a server or a database for a new project?
Deliverable: Spoken answers to 2 reported Technical and Domain Knowledge question(s), under time.
06Answer out loud: Coding and Algorithms
- Answer aloud, timed: How would you find a duplicate number in a collection?
- Answer aloud, timed: Can you write a function to perform a Breadth-First Search (BFS) on a directed graph?
Deliverable: Spoken answers to 2 reported Coding and Algorithms question(s), under time.
07Answer out loud: Behavioral and Process
- Answer aloud, timed: Tell me about a time you had to solve a complex technical challenge under pressure.
- Answer aloud, timed: How do you approach code reviews and maintain quality in a fast-moving environment?
Deliverable: Spoken answers to 2 reported Behavioral and Process 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 responsive design requirements using CSS and media queries?
How do you handle responsive design requirements using CSS and media queries?
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 solve a complex technical challenge under pressure.
Tell me about a time you had to solve a complex technical challenge under pressure.
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 approach code reviews and maintain quality in a fast-moving environment?
How do you approach code reviews and maintain quality in a fast-moving environment?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
Describe a situation where you disagreed with a technical decision made by a team lead.
Describe a situation where you disagreed with a technical decision made by a team lead.
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 responsive design requirements using CSS and media queries?
- 02
Tell me about a time you had to solve a complex technical challenge under pressure.
- 03
How do you approach code reviews and maintain quality in a fast-moving environment?
- 04
Describe a situation where you disagreed with a technical decision made by a team lead.
How long does the process take?
The process can be very fast, with some candidates receiving an offer within a few days of their final interview. However, communication can occasionally be delayed, so remain proactive in your follow-ups.
iHerb Software Engineer candidate reports ↗Is the technical interview very difficult?
It is generally considered average in difficulty, but it can be unpredictable. You should be prepared for a mix of standard algorithm questions and specific technical "trivia" related to the stack you use.
iHerb Software Engineer candidate reports ↗Does iHerb support remote work?
While many roles are based in Irvine, CA, check the specific job posting for location requirements as policies can evolve based on team needs.
iHerb Software Engineer candidate reports ↗What differentiates a successful candidate?
Successful candidates are those who can back up their technical claims with concrete examples from their past projects and who demonstrate a high level of passion for e-commerce at scale.
iHerb Software Engineer candidate reports ↗What topics does iHerb test in interviews?
iHerb interviews most often cover Problem Solving, Data Science, Stakeholder Management, Professionalism, and Stakeholder Communication. The exact emphasis depends on the specific role you apply for.
iHerb Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
Official role evidence, timestamped platform data and clearly labeled preparation advice.
- 01iHerb Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
candidate · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
platform · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
platform · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
housing organisation Software Engineer Interview Questions & Guide 2026
What housing organisation asks Software Engineer candidates, from reported rounds and questions.
aviya Software Engineer Interview Questions & Guide 2026
What aviya asks Software Engineer candidates, from reported rounds and questions.
AbsenceSoft Software Engineer Interview Questions & Guide 2026
What AbsenceSoft asks Software Engineer candidates, from reported rounds and questions.
ZURU Software Engineer Interview Guide
What ZURU asks Software Engineer candidates, from reported rounds and questions.