PriceLabs Full Stack Developer (SDE-1) Interview Experience (2 YOE)

pricelabs logo
pricelabs
· Full Stack Developer (SDE-1)· 2y exp
April 23, 2026 · 0 reads

Summary

I completed a three‑round interview process for a Full Stack Developer (SDE‑1) role at PriceLabs, including a take‑home assignment, HR discussion, and a technical interview where I solved the Merge Intervals problem; I am currently awaiting feedback.

Full Experience

I recently went through the interview process for a Full Stack Developer (SDE-1) role at PriceLabs. I had initially applied via Instahyre, though I don’t recall the exact timeline as the recruiter reached out after a considerable gap.

Round 1: Take-Home Assignment

The process began with a short take-home assignment based on pseudocode. The task was fairly straightforward — I was required to:

  • Understand the given pseudocode
  • Share the expected output
  • Provide a brief explanation of the logic

This round primarily evaluated basic problem-solving and reasoning skills.

Round 2: HR Discussion

This was a standard discussion with the recruiter covering:

  • My current role and responsibilities
  • Past experience
  • Priorities and expectations from the role

Round 3: Technical Interview (45 minutes)

The technical round was direct and focused, with no formal introduction. It started immediately with discussions around the assignment.

Topics covered:

  • Assignment Deep Dive: I was asked to explain the logic and output again, followed by implementing the solution with some modifications and edge cases identification.
  • Coding Problem: Solved the Merge Intervals problem (LeetCode #56). The focus was on correctness, approach, and edge case handling.
  • Conceptual Questions: CAP Theorem, Writing a basic SQL update query in PostgreSQL, Difference between PUT and PATCH (RestAPI)

The round was well‑rounded, testing both coding ability and fundamental concepts.

Current Status

Awaiting feedback from HR.

Interview Questions (1)

1.

Merge Intervals

Data Structures & Algorithms·Medium

Solve the classic "Merge Intervals" problem (LeetCode #56). Given a collection of intervals, merge all overlapping intervals and return an array of the non-overlapping intervals that cover all the intervals in the input.

📣 Found this helpful? Please share it with friends who are preparing for interviews!

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!