Python Data Structures, Algorithms and Time Complexity Guide

Python Data Structures, Algorithms and Time Complexity Guide Udemy | NED

In this course, we will be discussing why we need Data Structures. We will be mainly discussing on Time and Space Complexity of various concepts of Data Structures though we will be mainly dealing with Asymptotic Notations i.e., Big O, Omega and Theta. We will be learning how to create the python development environment and practice coding.

New
by Mammoth Interactive, John Bura

What you'll learn
• Learn the most commonly asked questions by the likes of Facebook, Google, Amazon and Spotify for beginners.
• Refresh your Python knowledge in the 10 most popular topics asked at the coding interview
• Learn not only concepts but also be able to articulate your thought process as you plan and execute a solution.
• Analyze the time complexity of various algorithms
• Learn how to recognize patterns for solutions to coding interview questions.
• Land a high paying role as a software developer/programmer.
• Learn the best way to answer an interview question
• Learn through hands-on coding examples and learn to solve problems quickly

Description

Data Structures + Algorithms to Crack the Coding Interview

Only in Python Data Structures, Algorithms and Time Complexity Guide, learn the best way to answer an interview question, look at the most commonly asked questions, and analyze time complexity of various algorithms.

Interview Question Solutions and Time Complexity

Learn through hands-on coding examples and learn to solve problems quickly.

Refresh your Python knowledge and solve new problems with the most common beginner interview questions asked by FANG companies.

Algorithms & Data Structures - Ultimate Coding Interview Prep

Learn the most commonly asked questions by the likes of Facebook, Google, Amazon and Spotify for beginners.

Preparing for the Python interview is hard. You need to understand not only concepts but also be able to articulate your thought process as you plan and execute a solution.

COURSE BREAKDOWN

Section 0: Introduction to Interview Questions

• Course Overview

• FizzBuzz: Print the numbers from 1 to 100 and for multiples of '3' print "Fizz" instead of the number and for the multiples of '5' print "Buzz".

• Types of Time Complexity: Learn the types of time complexity in Big-O Notation in order of horrible to good.

Section 1: String/Array Interview Questions

• 01 Reverse Words in a String: Given an input string, reverse the string word by word.

• 02 Rotate Array: Rotate an array of n elements to the left by k steps.

• 03 Isomorphic Strings: Given two strings a and b, determine if they are isomorphic.

• 04 Kth Largest Element in an Array: Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Section 2: Matrix Interview Questions

• 01 Set Matrix Zeroes: Given a 2D matrix, if an element is 0, set its entire row and column to 0. Do it in place.

• 02 Spiral Matrix: Given a 2D matrix, return all elements of the matrix in spiral order.

• 03 Number of Islands: Given a 2D grid map of 1s (land) and 0s (water), count the number of islands.

Section 3: Linked List Interview Questions

• 01 Implement a Stack Using an Array: Implement a stack using an array.

• 02 Add Two Numbers: You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.