Tasket (zeta) SDE Intern Interview Experience
- Posted
- 28 Apr 2026
Summary
I interviewed for an SDE Intern position at Zeta, cleared the online assessment and two onsite rounds, but was ultimately rejected.
How it went
date - april 2026
zeta came on campus to hire for sde interns (6m), first was an online assessment. ppl who cleared it were shortlisted for offline interviews
in office interviews
round 1 - dsa (very easy)
q1 -> delete node in a linked list
link - leetcode.com/problems/delete-node-in-a-linked-list
q2 -> tribonacci sequence
from brute to most optimal tc: O(n) sc: O(1)
link - leetcode.com/problems/n-th-tribonacci-number
q3 -> search an element in a rotated subarray
link - leetcode.com/problems/search-in-rotated-sorted-array
solved all questions optimally and quite quick, followed by a brief talk on goals and aspirations.
round 2 - technical
1 hr. round, complete deep dive of resume, talked about previous intenship experience, projects, trade offs took. also was asked some questions regd. sytem design and ai engineering in general.
answered all questions well.
verdict: rejected
thoughts:
this was actually the first time i was giving an in office offline dsa interview and the expereince has been very good, they also provided breakfast and lunch. I'm quite down right now since I was not selected (the comp. was too good for intern level >= maang) but still sulking about it is not going to do me any good, just have got to continue the grind.
lmk if any questions.
Questions asked (3)
- 01
Delete Node in a Linked List
Data Structures & Algorithms · Easy
Open the problemGiven only the node to be deleted (not the head of the list) in a singly linked list, delete that node from the list. It is guaranteed that the node is not the tail node.
- 02
Nth Tribonacci Number
Data Structures & Algorithms · Easy
Open the problemCalculate the
nth Tribonacci number where the sequence starts with0, 1, 1and each subsequent number is the sum of the previous three numbers. - 03
Search in Rotated Sorted Array
Data Structures & Algorithms · Medium
Open the problemGiven an integer array
numssorted in ascending order, possibly rotated at an unknown pivot, and a target value, determine the index of the target. Return-1if the target is not present.