0   reviews on Udemy

100 Leetcode Algorithm Questions for Technical Interview

Learn Data Structures and Algorithms to Crash the Interview
Course from Udemy
 18 students enrolled
Computer Science
Data Structure
Technical Interview
Coding Interveiw

This course is for all those people who want to learn the basics of data structure and algorithms from the absolute beginner to the Intermediate level. We will use many examples to makes the lectures very easy to understand and digest.

You don't really need to have prior knowledge of Data Structure or Algorithm, but a basic prior knowledge of any programming language will be helpful!

After going through these 100 Leetcode questions, you will get your foot wet and start trying some "Medium" question soon. The purpose of this course is to learn fast and give you the confidence to start working on Leetcode questions.

Most of these LC questions are EASY level or MEDIUM level with a quick solution. You can get the most out of it by following along. Because Medium question is like few Easy questions combined together. A Hard question is a combination of a few Medium questions. In the future, I will try to make a Medium level of Leetcode for all of you!

If you have any question, please feel free to comment it below. I will get back to you as soon as possible.

If you have any suggestions on me improving the videos and contents, please also let me know, so that I can make better videos in the future. I hope you have a wonderful learning experience here!

100 Leetcode Algorithm Questions for Technical Interview
$ 84.99
per course
Also check at

FAQs About "100 Leetcode Algorithm Questions for Technical Interview"


Elektev is on a mission to organize educational content on the Internet and make it easily accessible. Elektev provides users with online course details, reviews and prices on courses aggregated from multiple online education providers.
DISCLOSURE: This page may contain affiliate links, meaning when you click the links and make a purchase, we receive a commission.