Joveo | SDE1 | Interview Experience

joveo logo
joveo
· SDE I
January 23, 2026 · 66 reads

Summary

I interviewed at Joveo for an SDE1 role, which included an Online Assessment and two interview rounds focused on Data Structures & Algorithms, System Design, and behavioral questions. Despite solving most coding problems, I ultimately received a rejection.

Full Experience

Recruiter find out profile using Instahyre and reached out via call, gave a small assessment to complete within a day.

OA:
1 hour assesment on Hackerearth with 1 question. Problem was related to Huffman encoding/decoding. Solved 7/10 test cases.

Next day, Recruiter called and confirmed to move with next interview round. Scheduled a small 20 mins round for DSA/Coding.

Interview Round 1:
Was asked to design a LRU cache with get/put functionality with O(1) complexity on Google Doc. When cache hit the capacity while putting, least recently used key should be evicted. Get/Put both operation makes a key most recently used.

Leetcode link: https://leetcode.com/problems/lru-cache/

Created Deque kind of structure with removal of node from head while eviction and addition of node to tail on get/put operation. Didn't get much time to review it though, since it was only of 20 min.

After few days, recruiter called and gave positive feedback, then scheduled another round of interview.

Interview Round 2:
Was asked a bunch of technical questions based on skills mentioned in resume.
How Elastic Search Works
Questions on Kafka CDC
Other few things as well, not remember exactly

Then got a coding question on priting elements in spiral fashion in a matrix.

Leetcode link: https://leetcode.com/problems/spiral-matrix/

Was able to solve it, but couldn't able to pass one test case (we have to track m/n and i/j, so might have done something wrong at one place)

No time left for figuring out the bug.


Received a rejection mail after few days.

Interview Questions (5)

1.

Huffman Encoding/Decoding Problem

Data Structures & Algorithms

Problem was related to Huffman encoding/decoding. Solved 7/10 test cases.

2.

Design LRU Cache

Data Structures & Algorithms

Was asked to design a LRU cache with get/put functionality with O(1) complexity on Google Doc. When cache hit the capacity while putting, least recently used key should be evicted. Get/Put both operation makes a key most recently used.

3.

How Elastic Search Works

System Design

How Elastic Search Works

4.

Kafka CDC Questions

System Design

Questions on Kafka CDC

5.

Spiral Matrix Traversal

Data Structures & Algorithms

Got a coding question on priting elements in spiral fashion in a matrix.

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!