Coding Interview Masterclass - C# and JavaScript

Name: Coding Interview Masterclass - C# and JavaScript
Rating: 3.2 (7 reviews)

Master solving coding questions in C# and JavaScript! Complete Beginner to Expert Coding Interview Masterclass

Created byRobert Gioia

Last updated 10/2022

English

What you'll learn

Features my former professor and good friend, Eric Nersesian, who brings 12 years of industry and 6 years of teaching experience and expertise in software engineering
Be able to answer coding interview questions with confidence and take the guesswork out of programming
Understand how to approach a problem, plan the solution, implement it, refactor it, and test it and how to discuss Big-O notation with the interviewer
Obtain mastery over data structures and algorithms and understand the ideal time to use each different one in a coding interview
Learn techniques to optimize your code, write clean code, and make the code you write more readable
Build a debugging skillset you can use when you stumble in an interview, and understand how to recover with confidence to impress the interviewer
Get comfortable programming with HackerRank, LeetCode, and CoderPad the three main platforms used by companies for coding interviews
Understand the “never give up” mentality and how to tackle coding interview questions that are complex, and how to maximize your chances at landing a job
Understand how to work with Linked Lists, Trees, and Graphs, the three most common advanced data structures asked about on coding interviews and understand how they work and when to use each
Learn how to solve problems with recursion, and understand when to use recursion and when to use iterative coding in an interview
Learn the process for breaking hard questions down into easier sub problems
Be able to implement Depth First Search and Breadth First Search algorithms
Master solving tree questions with generic trees, binary trees, and binary search trees
Learn to think like a computer programmer
Understand how to do pre-order, in-order, and post-order traversal on trees
Get experience solving coding questions with matrices and multi-dimensional arrays

Course content

23 sections • 73 lectures • 23h 52m total length

Introduction3:01
This video will introduce the course goals and learning objectives. By the end of this video you will understand more about the course, why we made it, and how you can benefit from it. After watching this video you will be ready to start learning the course material. Get ready to learn all about HackerRank, LeetCode, and CoderPad.

How Many Words in a String Problem - Part 114:10
In this video Eric and I tackle the count how many words are in a string problem. Given a string, determine how many words the string contains. We plan out an approach and then begin implementing the solution in C# in this video. This example problem is done in HackerRank.
How Many Words in a String Problem - Part 232:27
In this video, Eric and I complete our solution to the count the number of words in a string problem using C# code. This example problem is done in HackerRank.

Understanding the Problem3:04
In this video, Eric and I take a look at the Featured Product problem and break down what exactly the question is asking. By the end of this lecture you will have a clear understanding of the problem and be ready to start coding your solution using C# code. This example problem is done in HackerRank.
Coding the Algorithm, Solution, and Wrap-Up8:08
In this video Eric and I code the algorithm and complete the solution using C# code. By the end of this lecture you will understand how to use C# to code the solution to the Featured Product problem. This example problem is done in HackerRank.

Understanding the Problem18:05
In this video Eric and I break down what the Matrix Problem is asking. By the end of this lecture you will understand what the problem is asking and be ready to begin implementing a solution using C# code. This example problem is done in HackerRank.
Coding the Algorithm41:56
In this video Eric and I code the algorithm for the Matrix problem using C# code. By the end of this video you will have most of the algorithm logic completed using the C# programming language. This example problem is done in HackerRank.
Solution and Wrap-Up21:30
In this video Eric and I complete the solution to the Matrix problem using C# code. By the end of this lecture you will have a working solution to the Matrix problem. This example problem is done in HackerRank.

Understanding the Problem4:17
In this video Eric and I break down the Flood Fill Algorithm Problem to understand exactly what the question is asking. By the end of this lecture you will be ready to start coding the algorithm using C# code. This example problem is done in HackerRank.
Coding the Algorithm - Part 11:16:03
In this video Eric and I begin coding the algorithm for the Flood Fill Algorithm Problem using C# code. This example problem is done in HackerRank.
Coding the Algorithm - Part 249:17
In this video Eric and I continue coding the algorithm for the Flood Fill Algorithm Problem using C# code. This example problem is done in HackerRank.
Solution and Wrap-Up14:15
In this video Eric and I finish coding the algorithm for the Flood Fill Algorithm Problem using C# code. This example problem is done in HackerRank.

Review of Singly Linked Lists11:32
In this video, Eric and I review the concept of Singly Linked Lists. By the end of this lecture you will have a solid understanding of singly linked lists and how to create them using C# code. This example problem is done in HackerRank.
Cyclical Linked Lists and Checking for a Cycle12:23
In this video, Eric and I cover Cyclical Linked Lists and how to check if there is a cycle in a linked list. By the end of this video you will understand what cyclical linked lists are, and how to use the "Rabbit and Turtle" double pointer algorithm to check if a data structure contains a cycle using C#. Pay close attention to the contents of this video as many interviewers ask this type of question on their coding interview, especially larger tech companies like Google, Facebook, Twitter, and Amazon. This example problem is done in HackerRank.
Doubly Linked List16:31
In this video, Eric and I cover Doubly Linked Lists. By the end of this lecture you will understand what doubly linked lists are and how to create and work with doubly linked lists using the C# programming language. This example problem is done in HackerRank.
Forwards and Backwards Traversal11:35
In this video, Eric and I go over how to traverse the nodes in a doubly linked lists both forwards and backwards. By the end of this video you will have a solid understanding of forward and backwards traversal, and how to implement each on a doubly linked list. This example problem is done in HackerRank.

Binary Trees4:52
In this video, Eric and I go over an introduction to Binary Trees. By the end of this video you will understand what Binary Trees are in computer programming and be ready to learn more about Binary Trees in the coming videos. Binary Trees are a favorite topic of interviewers for coding interviews, so it is imperative that you have a deep understanding of them. This example problem is done in HackerRank.
The Node Class17:14
In this video, Eric and I build the Node Class for our Binary Trees. By the end of this video we will understand what nodes are and have a node class in the code. Nodes are the building blocks for linked lists, trees and graphs so we are going to need them whenever we want to build these data structures. This example problem is done in HackerRank.
The BinaryTree Class22:21
In this video, Eric and I build the Binary Tree class for our program. By the end of this video you will understand how to create a binary tree in code using the techniques demonstrated in this video. Pay close attention to this video because there is no Tree class in C#, or many other high level languages, it is up to us to implement them ourselves when we want to use them. This is a favorite question among interviewers, so definitely watch closely and post to the course Q&A forum if you have any questions or doubts. This example problem is done in HackerRank.
Depth First Search (DFS)9:59
In this video, Eric and I create a function that will perform a Depth First Search on a Binary Tree using C#. By the end of this lecture you will understand how to use the Stack data structure and code a Depth First Search algorithm that works with binary trees using the C# programming language. This example problem is done in HackerRank.
Breadth First Search (BFS)1:48
In this video, Eric and I create a function that will perform a Breadth First Search on a Binary Tree using C#. By the end of this lecture you will understand how to use the Queue data structure and code a Breadth First Search algorithm that works with binary trees using the C# programming language. This example problem is done in HackerRank.
Getting the Height of a Tree6:28
In this video we will learn what tree height is and code a function in C# that will calculate the height of a Binary Tree. By the end of this lecture you will understand how to calculate the height of a tree using C# code. This example problem is done in HackerRank.

Binary Search Trees10:53
In this video Eric and I go over how to create Binary Search Trees. By the end of this video you will understand how to code a Binary Search Tree class that we will use to solve a coding interview problem in the subsequent videos. This example problem is done in HackerRank.
Find Closest Value (Recursive) - Part 118:50
In this video we begin looking at how to find the closest value to a given value by using a Binary Search Tree and recursion. By the end of this video you will understand more about Binary Search Trees, Recursion, and their application to solving a coding interview question. This example problem is done in HackerRank.
Find Closest Value (Recursive) - Part 214:52
In this video we continue looking at how to find the closest value to a given value by using a Binary Search Tree and recursion. By the end of this video you will understand more about Binary Search Trees, Recursion, and their application to solving a coding interview question. This example problem is done in HackerRank.
Find Closest Value (Recursive) - Part 317:38
In this video we continue looking at how to find the closest value to a given value by using a Binary Search Tree and recursion. By the end of this video you will understand more about Binary Search Trees, Recursion, and their application to solving a coding interview question. This example problem is done in HackerRank.
Structure of a Coding Interview (Binary Search Trees Wrap-Up)6:19
In this video Eric and I discuss the structure of a coding interview and wrap-up our discussion about Binary Search Trees. This example problem is done in HackerRank.

Refactoring the Node Class8:09
In this video, Eric and I refactor the node class to work with Generic Trees. By the end of this video you will understand how to create a node class to work with generic trees. This example problem is done in HackerRank.
Refactoring the Tree Class5:35
In this video, Eric and I refactor the Tree class to work with generic trees. By the end of this video you will understand how to create a generic tree class. This example problem is done in HackerRank.

Building the Node Class15:01
In this video, Eric and I discuss graphs in C#. The graph data structure is not built into C#, so it will be up to us to implement it. Pay close attention to this video since graphs are a favorite topic of interviewers on coding interviews. By the end of this video you will understand what graphs are and the role that they play in C# programming. This example problem is done in HackerRank.
Building the Graph Class9:36
In this video, Eric and I build the graph class using C# code. By the end of this video you will understand how to write a graph class using C# for a coding interview question. This example problem is done in HackerRank.
Depth First Search (DFS)10:31
In this video, Eric and I write a Depth First Search algorithm that will perform a Depth First Search on the nodes of our graph using C#. The Depth First Search algorithm is a favorite question on coding interviews. This example problem is done in HackerRank.
Breadth First Search (BFS)1:48
In this video, Eric and I write a Breadth First Search algorithm that will perform a Breadth First Search on the nodes of our graph using C#. The Breadth First Search algorithm is a favorite question on coding interviews. This example problem is done in HackerRank.
Testing our Methods24:01
In this video, Eric and I test the methods that we created in the last few videos using C#. By the end of this video we will have verified that the code we wrote is correct and corrected any mistakes in the logic. This example problem is done in HackerRank.

Requirements

Working knowledge of C#
Desire to learn how to approach coding interview problems and competitive programming challenge questions

Description

This course has one goal: teach you how to ace coding interviews and challenging coding questions confidently and effectively to maximize your chances at landing your dream job. This course focuses on the C# and JavaScript programming languages, two of the most popular programming languages in the world.

What types of questions do you find challenging on interviews? Maybe you dread the infamous binary search tree questions. Or perhaps linked lists are the bane of your existence. Balanced braces, anyone?

You’ll hear two voices in this course, one is mine and the other is that of a good friend, Eric Nersesian. Eric has a PhD in Informatics and specializes in software engineering and 3D graphics. With 12 years industry experience and 6 years as a professor at NJIT, he brings a myriad of knowledge and experience to this course. After doing the exercises demonstrated in this course, Eric aced the coding interview for Snapchat and landed a Level 4 Software Engineering position there.

On Udemy, you will find plenty of courses that teach you how to code. However, finding a course that teaches you how to ace interview problems for programming and teaches you how to approach each question is rare, and that is what this course is. There is no one, two, or three step approach to acing a coding interview. Don’t believe the books and videos that tell you they will land you a dream job in a specific number of steps. Coding is hard, and it takes a lot of practice to get good at it. Moreover, interviews usually put a time limit on a question, so you might have 30 minutes to solve a question that would take most people a few hours at best.

In this course, Eric and I don’t jump right to the keyboard after reading a question. We break down the problem and plan an approach – usually more than one approach – and then talk out our logic step-by-step. Some of these questions we’ve never seen before this, we actually solve them for the first time right before your eyes. This means that we don’t always get the solution on the first try of running our code. This is good, because you see how to push forward and debug, refactor, and keep a level head under pressure by watching how we do it. At the end of the day, we are two industry professionals that love to code.

Have you ever had a coding interview that didn’t go so well? Are you nervous for your next coding test? If you want to approach your next programming interview with confidence, then enroll now!

Who this course is for:

Anyone that wants to improve their knowledge of data structures and algorithms
Anyone that wants to learn how to ace coding tests and interviews
Professional programmers that want to improve their coding interview skills
Students interested in competitive programming or preparing for a coding test
Developers that will be interviewing candidates for their company and want to learn how to ask good coding challenge questions

Coding Interview Masterclass - C# and JavaScript

What you'll learn

Explore related topics

Course content

Introduction1 lecture • 3min

How Many Words in a String Problem (HackerRank)2 lectures • 47min

Featured Product Problem using Hashing (HackerRank)2 lectures • 11min

Matrix Problem (HackerRank)3 lectures • 1hr 22min

Flood Fill Algorithm Problem (HackerRank)4 lectures • 2hr 24min

Linked Lists (HackerRank)4 lectures • 52min

Binary Trees (HackerRank)6 lectures • 1hr 3min

Binary Search Trees (HackerRank)5 lectures • 1hr 9min

Generic Trees (HackerRank)2 lectures • 14min

Graphs (HackerRank)5 lectures • 1hr 1min

Requirements

Description

Who this course is for: