Data Structure and Problem Solving-الشامل في هياكل البيانات
- Description
- Curriculum
- FAQ
- Reviews
Data Structures? They’re here. Algorithms? Covered. Lots of questions with well-explained solutions?
If you’re nervous about your first coding interview, or anxious about applying to your next job, this is the course for you. I got tired of interviewers asking tricky questions that can only be answered if you’ve seen the problem before, so I made this course! This video course will teach you the most common interview questions that you’ll see in a coding interview, giving you the tools you need to ace your next whiteboard interview.
Coding interviews are notoriously intimidating, but there is one method to become a better interviewer – and that is practice! Practicing dozens of interview questions is what makes the difference between a job offer for a $120k USD and another rejection email. This course is going to not only give you dozens of questions to practice on, but it will also make sure you understand the tricks behind solving each question, so you’ll be able to perform in a real interview.
In this course, you’ll get:
- Clear, well-diagramed explanations for every single problem to make sure you understand the solution
- An overview of the most important data structures to know about. These are presented for people without a CS degree.
- A huge collection of common algorithm questions, including everything from ‘reversing a string’ to ‘determine the width of a BST’
- Sensible strategies for tackling systems design problems
- Insider tips on answering what interviewers area really looking for
My goal in this course is to help you defeat those interviewers who ask nasty algorithm questions. Sign up today, and be the cutting edge engineer who will be prepared to get a high paying job
-
3What is Complexity Analysis?Video lesson
-
4Complexity Analysis Key TermsText lesson
-
5Memory 1Video lesson
-
6Memory 2Video lesson
-
7Memory 3Video lesson
-
8Big O NotationVideo lesson
-
9Big O Part 2Video lesson
-
10Big O Part 3Video lesson
-
11Big O more video contentsText lesson
-
12Big O Key TermText lesson
-
13LogarithmVideo lesson
-
14Logarithm 2Video lesson
-
15Code Example ( Guess and Check )Video lesson
-
16Code Example ProplemVideo lesson
-
17Code Example 2 (Approximate Solution)Video lesson
-
18Log n time ExampleVideo lesson
-
19Code Example 3 (Bisection Search)Video lesson
-
29Linked List deep explainVideo lesson
-
30Node implementationVideo lesson
-
31List TraversalVideo lesson
-
32List SizeVideo lesson
-
33Linked List ImplementationVideo lesson
-
34Insert LastVideo lesson
-
35Remove FirstVideo lesson
-
36Remove LastVideo lesson
-
37getAtVideo lesson
-
38Remove AtVideo lesson
-
39Insert AtVideo lesson
-
40Doubly Linked ListVideo lesson
-
41DLL InsertVideo lesson
-
42DLL RemoveVideo lesson
-
43Exercise - List ReverseVideo lesson
-
44Linked List Summary (very important)Text lesson
-
45what is HashTable?Video lesson
-
46how hashtable worksVideo lesson
-
47HashTable FunctionVideo lesson
-
48using hashtable in C#Video lesson
-
49Using Dictionary in C# (optional)Video lesson
-
50hashtable implementation 1Video lesson
-
51hashtable implementation 2Video lesson
-
52hashtable implementation 3Video lesson
-
63tree introVideo lesson
-
64Binary TreeVideo lesson
-
65Binary Search treeVideo lesson
-
66Tree Node implementationVideo lesson
-
67BST InsertVideo lesson
-
68BST Remove (Advanced and optional)Video lesson
-
69RecursionVideo lesson
-
70BST Traversal (Advanced)Video lesson
-
71BST LookUpVideo lesson
-
72Log n binary treeVideo lesson

External Links May Contain Affiliate Links read more