Join us for a live mock software engineering interview focused on algorithms and data structures, featuring Erons Aigbiluese in the candidate seat. You will see how an interviewer frames the problem, how a strong candidate clarifies requirements, selects the right data structures, reasons about complexity, and iterates from a brute force idea to an optimal solution. After the interview, we will break down the good, the bad, and what to improve, including communication style, tradeoff analysis, test coverage, and edge cases.

What you will learn:

• How to structure your approach under time pressure

• When to choose arrays, hash maps, trees, heaps, or graphs

• How to reason about time and space complexity in plain language

• How to handle follow-ups, hints, and corner cases without losing composure

Who should attend: internship to mid-level engineers preparing for real interviews, senior engineers mentoring others, and hiring managers who want a sharper rubric. Bring a notebook. There will be a short Q&A at the end.