The Data Structures, Algorithms And Time Complexity Guide

The Definitive Coding Interview Guide: Crack Whiteboard Questions in C# & Recognize Patterns in the Most Popular Topics

What you'll learn
Land a high paying role as a software developer/programmer.
Analyze the time complexity of various algorithms
Refresh your C# knowledge in the 10 most popular topics asked at the coding interview
Learn the most commonly asked questions by the likes of Facebook, Google, Amazon and Spotify for beginners.
Learn not only concepts but also be able to articulate your thought process as you plan and execute a solution.
Learn how to recognize patterns for solutions to coding interview questions.
Learn the best way to answer an interview question
Learn through hands-on coding examples and learn to solve problems quickly
Requirements
No IDE necessary. We'll run C# in the browser with Repl.
Experience with object-oriented programming fundamentals. If you need experience, enroll in C# Fundamentals: Learn Coding for Game Development by Mammoth Interactive
Description
Data Structures + Algorithms to Crack the Coding InterviewOnly in The 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 ComplexityLearn through hands-on coding examples and learn to solve problems quickly.Refresh your C# knowledge and solve new problems with the most common beginner interview questions asked by FANG companies.Algorithms & Data Structures - Ultimate Coding Interview PrepLearn the most commonly asked questions by the likes of Facebook, Google, Amazon and Spotify for beginners.Preparing for the C# 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 BREAKDOWNSection 0: Introduction to Interview QuestionsCourse OverviewFizzBuzz: 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 Questions01 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 Questions01 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 Questions01 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. 03 Reverse a Linked List: Reverse a singly linked list.Section 4: Tree Interview Questions01 Inorder Traversal: Perform inorder traversal on a binary tree.02 Preorder Traversal: Perform inorder traversal on a binary tree.03 Postorder Traversal: Perform inorder traversal on a binary tree.04 Binary Tree Maximum Path Sum: Given a binary tree, find the maximum path sum. Section 5: Graph Interview Questions01 Clone an Undirected Graph: Each node in the graph contains a label and a list of its neighbors.Section 6: Sorting and Time Complexity01 Bubble Sort Algorithm: Sort a list with bubble sort.02 Selection Sort Algorithm: Sort a list with selection sort.03 Insertion Sort Algorithm: Sort a list with insertion sort.04 Quick Sort Algorithm: Sort a list with Quick Sort.05 Merge Sort Algorithm: Sort a list with Merge Sort.06 Time Complexity of Different Sorting AlgorithmsSection 7 Dynamic Programming Interview Questions01 Coin Change: You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. 02 Edit Distance: Find the edit distance between two strings.03 Distinct Subsequences: Given a string S and a string T, count the number of distinct subsequences of T in S.04 Maximum Sum Subarray: Find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sumSection 8 Bit Manipulation Interview Questions01 Bitwise and Shift Operators: Manipulate bits and shift bits to change values.02 Single Number: Given an array of integers, every element appears twice except for one. Find that single one.03 Sum of Two Integers: Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.04 Number of 1 Bits: Take an unsigned integer and return the number of ’1' bits it has (also known as the Hamming weight.)05 Reverse Bits: Reverse the bits of a given 32 bit unsigned integer.06 Bitwise AND of a Range: Given two non-negative long integers, a and b and given a <= b, find the bitwise AND of all integers from a and b.Section 9 Combinations and Permutations Interview Questions01 Permutations: Print all permutations of a given string.02 Distinct Permutations of a String: Print all distinct permutations of a string that contains duplicates.03 Letter Combinations of a Phone Number: Given a digit string, return all possible letter combinations that the number could represent on a phone board. 04 Factor Combination: Return all possible combinations of an integer n’s factors.Section 10 Math Interview Questions01 Reverse Integer: Reverse the digits of an integer n.02 Palindrome Number: Determine whether an integer is a palindrome. Do this without extra space. 03 Excel Sheet Column Numbe: Given a column title from an Excel sheet, return its corresponding column number.A SCHOOL YOU CAN TRUSTLifetime access that never expiresProject-based curriculum to superboost your portfolioGraduation certificate for every courseAbsolute beginner-friendlyNew courses every monthEfficient lectures with step by step explanationsRelevant industry topics 8 years of award-winning course delivery800,000 students in 186 countriesLearn with free tools and affordable coursesREVIEWS OF MAMMOTH COURSESCaptivating voice, easy to follow at a rapid pace, get some paper and fasten your seat-belts. I'm enjoying every second of this.— PHILIP MURRAYI have completed many Udemy tutorials. This one is the most outstanding one that I have seen thus far. It is doubtful that it could be topped. This is a superior tutorial. Amazing.— JOSEPH APPLEGARTHCOURSE AUTHORAlexandra Kropova, Software Developer at Mammoth Interactive INC.Alexandra Kropova is a software developer specializing in OOP and JavaScript, with extensive experience in full-stack web development and app development. She has helped produce courses for Mammoth Interactive INC. since 2016, including the Coding Interview series in Java, JavaScript, C++, C#, Python and Swift.

Overview

Section 1: Introduction: FizzBuzz and Time Complexity

Lecture 1 Introduction

Lecture 2 FizzBuzz

Lecture 3 Types of Time Complexity

Lecture 4 Source Code

Lecture 5 Interview Questions Categories PDF Resource

Section 2: String and Array Interview Questions

Lecture 6 Reverse Words in a String

Lecture 7 Rotate Array

Lecture 8 Isomorphic Strings

Lecture 9 Kth Largest Element in an Array

Lecture 10 Source Code

Section 3: Matrix Interview Questions

Lecture 11 Set Matrix Zeros

Lecture 12 Spiral Matrix

Lecture 13 Number of Islands

Lecture 14 Source Code

Section 4: Linked List Interview Questions

Lecture 15 Implement a Stack Using an Array

Lecture 16 Add Two Numbers as Reversed Linked Lists

Lecture 17 Reverse a Linked List

Lecture 18 Source Code

Section 5: Binary Tree Interview Questions

Lecture 19 Inorder Traversal

Lecture 20 Preorder Traversal

Lecture 21 Postorder Traversal

Lecture 22 Binary Tree Maximum Path Sum

Lecture 23 Source Code

Section 6: Graph Interview Questions

Lecture 24 Largest Connected Component

Lecture 25 Source Code

Section 7: Sorting Interview Questions

Lecture 26 Bubble Sort Algorithm

Lecture 27 Selection Sort Algorithm

Lecture 28 Insertion Sort Algorithm

Lecture 29 QuickSort Algorithm

Lecture 30 Merge Sort Algorithm

Lecture 31 Time Complexity Of Different Sorting Algorithms

Lecture 32 Source Code

Lecture 33 Time Complexity of Different Sorting Algorithms Slides

Section 8: Dynamic Programming Interview Questions

Lecture 34 Coin Change

Lecture 35 Edit Distance

Lecture 36 Distinct Subsequences

Lecture 37 Maximum Sum Subarray

Lecture 38 Source Code

Section 9: Bit Manipulation Interview Questions

Lecture 39 Bitwise And Shift Operators

Lecture 40 Single Number

Lecture 41 Number Of 1 Bits

Lecture 42 Sum Of Two Integers

Lecture 43 Reverse Bits

Lecture 44 Bitwise AND Of A Range

Lecture 45 Source Code

Lecture 46 Bitwise and Shift Operators Slides

Section 10: Permutations and Combinations

Lecture 47 Permutations

Lecture 48 Distinct Permutations Of A String

Lecture 49 Letter Combinations Of A Phone Number

Lecture 50 Factor Combinations

Lecture 51 Source Code

Section 11: Math Interview Questions

Lecture 52 Reverse Integer

Lecture 53 Palindrome Number

Lecture 54 Excel Sheet Column Number

Lecture 55 Source Code

You have a C# interview coming up and need to learn how to answer questions properly,You need to learn the most popular questions that you might be asked,You need to learn the top 10 most common topics asked about and sample questions for each,Anyone learning C#,You haven't used C# in a while and want to refresh your knowledge