Educative (WA) logo

Educative (WA) Software Engineer Interview Questions
& Process

Real candidates share what happened, how many rounds they had,
and how the experience turned out.

Based on 56 interview experiences · FREE TO READ

3.2 Rounds average
Average Typical difficulty
85.7% Positive experience

Candidate interview experiences

First-hand accounts from people who interviewed at Educative (WA).

Showing 3 of 56
Educative (WA) logo
Educative (WA)

Software Engineer

Engineering · nearly a year ago

Entry Difficult Neutral experience No offer 1 round
Interview process
Technical screen
Interview formats
Coding

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.

Confirmed questions2 questions
  • return the nth fibonacci number on paper
  • return the nth largest number from a binary search tree without using recursion or a stack with O(1) space complexity
Educative (WA) logo
Educative (WA)

Software Engineer

Engineering · nearly a year ago

Mid Difficult Positive experience Accept offer 5 rounds
Interview process
Technical screen Technical screen Technical screen Technical screen Technical screen
Interview formats
Technical Coding

For a Software Engineer, they follow a three-round process: The first interview is a technical interview to screen candidates. Next is a full loop, which consists of 3 back-to-back 1 hour technical interviews. Finally, an Interview with the CTO.

Confirmed questions1 question
  • Programming questions include finding the minimum in a tree, balancing parentheses, and finding the nearest multiple to a number.
Educative (WA) logo
Educative (WA)

Software Engineer

Engineering · more than a year ago

Senior Average Negative experience Accept offer 5 rounds
Interview process
Recruiter call Technical screen Technical screen Technical screen Technical screen Presentation Offer
Interview formats
Technical Coding

I found the job on LinkedIn and applied online. After two days, I got a call for the first round. This interview was with a senior software engineer and lasted about an hour. I was given two coding questions to solve in Google Docs. They also told me about the company and its tech stacks. Twelve days later, I got called for round 2, which was a full loop coding round with three interviews back-to-back. Each interview had two coding questions. Three days after round 2, I got a call for the final interview, which was a week after the coding round. This last interview was with the VP of Engineering. The HR team was really helpful throughout and scheduled interviews around my commitments. The interviewers explained the questions well. Overall, it was a great experience, 5/5.

Confirmed questions1 question
  • Technical questions are based on basic Algorithm/Data Structures concepts.

Educative (WA) Software Engineer Interview Questions

Quoted word for word from Educative (WA) interview reports.

Write a Function to print first non repeated (unique) character in a string e.g: "aBnnN$$a" --> returns 'B'

Read reports

Find all possible combinations of a given sum. eg. 4 = 1,1,1,1 1,1,2 1,3 2,2

Read reports

Find second maximum in a BST. Restrictions: Cannot use any DS. Should be less than O(n) average. Do it recursively.

Read reports

Write a function to see if brackets are balanced or not. Restrictions: Cannot use any Datastruct. Should not be greater than O(n). Examples: "{}" => true, "{{}}{}" => true, "{{}}" => true, "{}{}}" => false, "{}}}{{}}" => false

Read report

Is there a way to check if two string arrays are flippable?

Read report

Without using any data structures, how can you verify if a string has balanced brackets?

Read report

How can you determine if a singly linked list reads the same forwards and backwards?

Read report

How do you construct a height-balanced binary search tree from an integer array?

Read report

Formats, difficulty and experience

Across all 56 Educative (WA) interview reports.

Interview formats

Technical 48.9%
Coding 26.3%
Behavioral 22.6%
Other 0.8%
System Design 0.8%

Interview difficulty

Easy 3.6%
Average 50%
Difficult 46.4%

Candidate experience

Neutral 7.1%
Positive 85.7%
Negative 7.1%