
This course includes our updated coding exercises so you can practice your skills as you learn.
See a demo
Explore what a typical coding interview looks like, from whiteboard problems to phone interviews. Learn to clarify requirements, choose a suitable language, and apply time-efficient problem-solving techniques.
Think on paper to frame problems conceptually before coding, then translate solutions into data structures like a hash table to find pairs that multiply to 20.
Master communicating your thinking in coding interviews, thinking conceptually first, and asking clarifying questions, as you tackle essential topics like arrays, strings, 2d arrays, linked lists, and trees.
Track the most frequent item in an array using a dictionary to count occurrences, update the max item, and return the result.
Find the intersection of two sorted arrays in ascending order and return their common elements, such as 1, 4, and 9, using an efficient O(max(n, m)) approach.
Learn a linear time solution to the non-repeating character problem by counting characters with a hash map and returning the first with count one, or null if none.
Use a two-pointer approach to find the nth node from the end of a linked list, with left and right pointers and null-head edge-case checks.
As you prepare for your next coding interview, have you ever thought:
If so, this course is for you!
In this course:
This course is intended for intermediate to advanced learners who are preparing for their software engineer programming interviews.
So, I’m going to assume that you’re already familiar with concepts such as:
If you think you’re ready for this course, watch the preview videos and see if you can solve those problems!