Python for Data Structures/ Algorithms/ and Interviews!

About Course

This free Python for Data Structures, Algorithms, and Interviews course from Udemy is designed to help you ace your coding interviews and land your dream tech job. This comprehensive course teaches you the fundamentals of Python, data structures, and algorithms in an easy-to-understand way. You’ll learn everything you need to know about the latest job searching tools, resume building, LinkedIn and GitHub profile optimization, networking for job opportunities, non-technical interview questions and answers, salary negotiation, and reference preparation.

This course covers essential concepts like:

Jupyter Notebooks Overview
Algorithm Analysis and Big-O Notation
Array Sequences
Stacks Queues and Deques
Linked Lists
Recursion
Trees
Searching and Sorting Algorithms
Graph Algorithms
Riddles and Brainteasers
4 Mock Interviews!

Unlock your career potential and become a sought-after software developer with this comprehensive Python course. Start learning for free today!

Course Content

Course Setup

A Message from the Professor
Course Introduction

02:56
Full Course Curriculum Overview

03:53
Course Material Download Link

00:00

Company and Job Types

Resume Preparation

Online Presence

Networking

Job Searching

During the Interview (Non-Technical)

Post Interview

Technical Break Section

Introduction to Jupyter Notebooks

Algorithm Analysis and Big O

Array Sequences

Introduction to Array Based Sequences

02:34
Low Level Arrays

18:24
Dynamic Array

10:11
Dynamic Array Excercise

16:10
Amortization

04:26
Interview Problems – Arrays

01:57
Anagram Check – Interview Problem

01:18
Anagram Check – Interview Problem – SOLUTION

09:14
Array Pair Sum – Interview Problem

01:03
Array Pair Sum – Interview Problem – SOLUTION

08:01
Find the Missing Element – Interview Problem

01:03
Find the Missing Element – Interview Problem – SOLUTION

11:58
Largest Continuous Sum – Interview Problem

01:04
Largest Continuous Sum – Interview Problem – SOLUTION

06:15
Sentence Reversal – Interview Problem

00:57
Sentence Reversal – Interview Problem – SOLUTION

07:36
String Compression – Interview Problem

01:02
String Compression – Interview Problem – SOLUTION

06:49
Unique Characters in a String – Interview Problem

00:34
Unique Characters in String – Interview Problem – SOLUTION

03:56

Stacks Queues and Deques

Stacks Queues and Deques Overview

00:53
Stacks Overview

03:31
Implementation of Stack

07:08
Queue Overview

02:50
Implementation of Queue

04:44
Deque Overview

01:52
Implementation of Deque

06:08
Stacks Queues and Deques Interview Problems

01:07
Implement a Stack – Interview Problem

00:59
Implement a Queue

00:43
Implement a Deque – Interview Problem

00:59
Balanced Parentheses Check – Interview Problem

02:00
Balanced Parentheses Check – Interview Problem – SOLUTION

10:39
Implement a Queue using 2 Stacks – Interview Problem –

02:05
Implement a Queue using 2 Stacks – Interview Problem – SOLUTION

05:04
deque overview.mp4

01:52

Linked Lists

Linked Lists Overview

00:31
Singly Linked Lists

08:00
Singly Linked List Implementation

05:20
Doubly Linked Lists

04:32
Doubly Linked List Implementation

03:22
Singly Linked List Cycle Check – Interview Problem

02:02
Singly Linked List Cycle Check – Interview Problem – SOLUTION

06:02
Linked List Reversal – Interview Problem

02:29
Linked List Reversal – Interview Problem – SOLUTION

06:20
Linked List Nth to Last Node – Interview Problem

01:51
Linked List Nth to Last Node – Interview Problem – SOLUTION

07:53
Implement a Linked List – Interview Problem

01:14
Implement a Linked List – Interview Problem – SOLUTION

01:05

Recursion

Introduction to Recursion

08:27
Recursion Homework Example Problems

05:51
Recursion Homework Example Problems – SOLUTIONS

10:01
Memoization

02:48
Recursion Interview Problem – 1

02:20
Recursion Interview Problem – 1 – SOLUTION

06:50
Recursion Interview Problem – 2

02:04
Recursion Interview Problem – 2 – SOLUTION

10:12
Recursion Interview Problem – 3

04:54
Recursion Interview Problem – 3 – SOLUTION

13:50
Recursion Interview Problem – 4

04:10
Recursion Interview Problem – 4 – SOLUTION

19:11

Trees

Introduction to Trees

10:27
Tree Representation Implementation – Part 1

01:26
Tree Representation Implementation – Part 2

09:15
Nodes and References Implementation

11:12
Tree Traversals

07:08
Priority Queues with Binary Heaps

01:56
Binary Heap Implementation

18:54
Binary Search Trees

01:23
Implementation of Binary Search Trees – Part 1

13:56
Implementation of Binary Search Trees – Part 2

12:43
Binary Search Tree Check – Interview Problem

02:48
Binary Search Tree Check- Interview Problem – SOLUTION

05:31
Tree Level Order Print – Interview Problem

01:32
Tree Level Order Print – Interview Problem – SOLUTION

10:19
Trim a Binary Search Tree – Interview Problem

01:57
Trim a Binary Search Tree – Interview Problem – SOLUTION

07:38

Searching and Sorting

Search Overview

01:27
Sequential Search

03:06
Implementation of Sequential Search

05:54
Binary Search

03:25
Implementation of Binary Search

09:02
Hashing

12:42
Implementation of a Hash Table

19:27
Sorting Overview

01:25
Resources for Visualizing Sorting Algorithms

03:20
Bubble Sort

08:09
Implementation of Bubble Sort

07:06
Selection Sort

06:54
Implementation of Selection Sort

05:26
Insertion Sort

05:50
Implementation of Insertion Sort

06:30
Shell Sort

04:38
Implementation of Shell Sort

08:28
Merge Sort

04:05
Implementation of Merge Sort

13:06
Quick Sort

06:30
Implementation of Quick Sort

12:16
Sorting Interview Problems

01:17
Implement Binary Search Interview Problem

00:23
Implement Bubble Sort Algorithm Interview Problem

00:23
Implement Selection Sort Algorithm Interview Problem

00:22
Implement Insertion Sort Algorithm Interview Problem

00:21
Implement Shell Sort Algorithm Interview Problem

00:21
Implement Merge Sort Algorithm Interview Problem

00:21
Implement Quick Sort Algorithm Interview Problem

00:36

Graph Algorithms

Introduction to Graphs

06:36
Adjacency Matrix and Adjacency List

04:24
Implementation of a Graph (Adjacency List)

18:24
Word Ladder Example Problem

06:35
Breadth First Search

12:41
Knight’s Tour Example Problem

12:11
General Depth First Search

10:11
Implementation of Graph Overview

10:57
Implementation of Depth First Search Overview

05:59
Implementation of Breadth First Search Overview

04:39
Implement a Graph – Interview Problem

00:43
Implement Depth First Search – Interview Problem

00:29
Implement Breadth First Search – Interview Problem

00:32

Riddles

How to Approach Riddles and Brain Teasers

03:23
Bridge Crossing – Interview Problem

01:44
Bridge Crossing – Interview Problem – SOLUTION

01:46
Coins and a Scale – Interview Problem

00:42
Coins and a Scale – Interview Problem – SOLUTION

01:41
Egg Drop – Interview Problem

01:11
Egg Drop – Interview Problem – SOLUTION

02:51
Hallway Lockers – Interview Problem

01:38
Hallway Lockers – Interview Problem – SOLUTION

04:55
Jugs of Water – Interview Problem

00:35
Jugs of Water – Interview Problem – SOLUTION

01:34
Light Switches – Interview Problem

01:13
Light Switches – Interview Problem – SOLUTION

01:23
Ropes Burning – Interview Problem

01:02
Ropes Burning – Interview Problem – SOLUTION

01:11

Introduction to Mock Interview Section

Mock Interview 1 – E-Commerce Company

Mock Interview 2 – Large Search Engine Company

Large Search Engine Company Interview Overview

00:52
Phone Screen

02:46
On Site Question 1

00:58
On Site Question 2

00:48
On Site Question 3

00:36
On Site Question 4

01:29
Phone Screen – SOLUTION

05:24
On Site Question 1 -SOLUTION

01:55
On Site Question 2 -SOLUTION

04:50
On Site Question 3 -SOLUTION

01:27
On Site Question 4 -SOLUTION

09:38

Mock Interview 3 – Ride Share Start-Up Company

Mock Interview 4 – Social Network Company

Add this certificate to your resume to demonstrate your skills & increase your chances of getting noticed.

Student Ratings & Reviews

No Review Yet

About Course

What Will You Learn?

Course Content

Course Setup

A Message from the Professor

Course Introduction

Full Course Curriculum Overview

Course Material Download Link

Company and Job Types

Company Types Overview

Job Type Overview

Resume Preparation

Resume Preparation

Resume Creation Tools

Online Presence

LinkedIn

GitHub

Personal Website and Portfolio

Networking

Building a Network

Networking Events

Job Searching

Organization of Job Search

Job Search Sites

Company Matching Sites

During the Interview (Non-Technical)

Overview of Interview Section

5 Steps of an Interview

Tough Interview Questions

Questions for Students

Special Case Interview Questions

Post Interview

Salary Negotiations

Salary Questions and Answers

Preparing References

Technical Break Section

Technical Overview

Introduction to Jupyter Notebooks

Windows – Course Material Installations

Mac OSX – Course Material Installations

Jupyter Notebooks Overview

Course Notebooks

Interview Notebooks

Algorithm Analysis and Big O

Algorithm Analysis and Big O Section Overview

Introduction to Algorithm Analysis and Big O

Big O Notation

Big O Examples

Big O for Python Data Structures

Array Sequences

Introduction to Array Based Sequences

Low Level Arrays

Dynamic Array

Dynamic Array Excercise

Amortization

Interview Problems – Arrays

Anagram Check – Interview Problem

Anagram Check – Interview Problem – SOLUTION

Array Pair Sum – Interview Problem

Array Pair Sum – Interview Problem – SOLUTION

Find the Missing Element – Interview Problem

Find the Missing Element – Interview Problem – SOLUTION

Largest Continuous Sum – Interview Problem

Largest Continuous Sum – Interview Problem – SOLUTION

Sentence Reversal – Interview Problem

Sentence Reversal – Interview Problem – SOLUTION

String Compression – Interview Problem

String Compression – Interview Problem – SOLUTION

Unique Characters in a String – Interview Problem

Unique Characters in String – Interview Problem – SOLUTION

Stacks Queues and Deques

Stacks Queues and Deques Overview

Stacks Overview

Implementation of Stack

Queue Overview

Implementation of Queue

Deque Overview

Implementation of Deque

Stacks Queues and Deques Interview Problems

Implement a Stack – Interview Problem