I applied online. The process took 3 weeks. I interviewed at Educative (WA) (Lahore) in May 2023
Interview
So, Interview process was very long, first online screening then call of full loop interviews that has three back to back rounds in a single day and then final interview with CTO.
All technical interviews were focused on data structures and optimization. But the overall recruitment selection was based on CGPA threshold which wasn't really good.
Interview questions [1]
Question 1
They asked many data structures problems and every problem had follow up question to improve its time complexity and space complexity.
I applied through college or university. The process took 4 weeks. I interviewed at Educative (WA) (Lahore) in Mar 2025
Interview
There was a screening call after which I was scheduled for 3 Technical On-Site Interviews on the same day, each lasting 1 hour with 3 separate Interviewers. After that, there was a final interview with the CEO.
Interview questions [1]
Question 1
The technical questions were mostly in the LeetCode style. The other questions were about my past projects.
Get actionable career advice tailored to you by joining more bowls.
Want the inside scoop on your own company?
Check out your Company Bowl for anonymous work chats.
Application
I applied through an employee referral. I interviewed at Educative (WA) (Lahore) in Mar 2025
Interview
It was the first round, basically a screening round where some senior engineer came, and asked me leetcode medium questions to solve with him. First, they asked me the a fibonacci series question, it was easy but the way he framed it and asked to return output was actually a bit confusing and i messed things up a bit. He wanted me to return the nth fibonacci number. The function would be passed a number n, and we would have to return that specific fibonacci number. I messed up when i ended up going one iteration ahead than what was required. it was on paper. The second question was a bit difficult, he asked me to return the nth largest number from a binary search tree without using recursion or a stack. Because, he wanted me to have O(1) space complexity. There was a bit complicated algorithm behind it which i didn't know at that time, hence, I couldn't do this question. My way of trying to reach the solution was a bit flawed too.
Interview questions [1]
Question 1
Not specifically anything he asked me, just a bit introduction and then we moved straight into the interview. Where he asked me to solve the leetcode questions on paper.
A total of 3 interviews, all of them having a few coding questions, after that a semi technical interview with the Vice President of engineering, You have to perform way better than just "average" to get an offer.
