Coding Interview Masterclass C# and JavaScript

Coding Interview Masterclass – C# and JavaScript, available at $44.99, has an average rating of 3.21, with 73 lectures, based on 7 reviews, and has 194 subscribers.

You will learn about 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 This course is ideal for individuals who are Anyone that wants to improve their knowledge of data structures and algorithms or Anyone that wants to learn how to ace coding tests and interviews or Professional programmers that want to improve their coding interview skills or Students interested in competitive programming or preparing for a coding test or Developers that will be interviewing candidates for their company and want to learn how to ask good coding challenge questions It is particularly useful for Anyone that wants to improve their knowledge of data structures and algorithms or Anyone that wants to learn how to ace coding tests and interviews or Professional programmers that want to improve their coding interview skills or Students interested in competitive programming or preparing for a coding test or Developers that will be interviewing candidates for their company and want to learn how to ask good coding challenge questions.

Enroll now: Coding Interview Masterclass – C# and JavaScript

Summary

Title: Coding Interview Masterclass – C# and JavaScript

Price: $44.99

Average Rating: 3.21

Number of Lectures: 73

Number of Published Lectures: 73

Number of Curriculum Items: 73

Number of Published Curriculum Objects: 73

Original Price: $89.99

Quality Status: approved

Status: Live

What You Will 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

Who Should Attend

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

Target Audiences

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

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!

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction

Chapter 2: How Many Words in a String Problem (HackerRank)

Lecture 1: How Many Words in a String Problem – Part 1

Lecture 2: How Many Words in a String Problem – Part 2

Chapter 3: Featured Product Problem using Hashing (HackerRank)

Lecture 1: Understanding the Problem

Lecture 2: Coding the Algorithm, Solution, and Wrap-Up

Chapter 4: Matrix Problem (HackerRank)

Lecture 1: Understanding the Problem

Lecture 2: Coding the Algorithm

Lecture 3: Solution and Wrap-Up

Chapter 5: Flood Fill Algorithm Problem (HackerRank)

Lecture 1: Understanding the Problem

Lecture 2: Coding the Algorithm – Part 1

Lecture 3: Coding the Algorithm – Part 2

Lecture 4: Solution and Wrap-Up

Chapter 6: Linked Lists (HackerRank)

Lecture 1: Review of Singly Linked Lists

Lecture 2: Cyclical Linked Lists and Checking for a Cycle

Lecture 3: Doubly Linked List

Lecture 4: Forwards and Backwards Traversal

Chapter 7: Binary Trees (HackerRank)

Lecture 1: Binary Trees

Lecture 2: The Node Class

Lecture 3: The BinaryTree Class

Lecture 4: Depth First Search (DFS)

Lecture 5: Breadth First Search (BFS)

Lecture 6: Getting the Height of a Tree

Chapter 8: Binary Search Trees (HackerRank)

Lecture 1: Binary Search Trees

Lecture 2: Find Closest Value (Recursive) – Part 1

Lecture 3: Find Closest Value (Recursive) – Part 2

Lecture 4: Find Closest Value (Recursive) – Part 3

Lecture 5: Structure of a Coding Interview (Binary Search Trees Wrap-Up)

Chapter 9: Generic Trees (HackerRank)

Lecture 1: Refactoring the Node Class

Lecture 2: Refactoring the Tree Class

Chapter 10: Graphs (HackerRank)

Lecture 1: Building the Node Class

Lecture 2: Building the Graph Class

Lecture 3: Depth First Search (DFS)

Lecture 4: Breadth First Search (BFS)

Lecture 5: Testing our Methods

Chapter 11: Balanced Braces (HackerRank)

Lecture 1: Planning the Solution

Lecture 2: Coding the Algorithm

Lecture 3: Testing the Code

Lecture 4: Refactoring the Code

Chapter 12: Sports Scores Challenge Problem (HackerRank)

Lecture 1: Understanding the Problem

Lecture 2: Planning the Solution

Lecture 3: Coding the Algorithm

Lecture 4: Improving Efficiency and Refactoring the Code

Chapter 13: Sum to Target (LeetCode)

Lecture 1: Understanding the Problem

Lecture 2: Coding the Solution

Chapter 14: Binary Search (LeetCode)

Lecture 1: Understanding the Problem

Lecture 2: Coding the Solution

Chapter 15: Combining Linked Lists (LeetCode)

Lecture 1: Understanding the Problem

Lecture 2: Coding the Solution

Chapter 16: Least Recently Used (LRU) Cache (LeetCode)

Lecture 1: Least Recently Used (LRU) Cache

Chapter 17: Checking if Binary Tree is Height Balanced (LeetCode)

Lecture 1: Understanding the Problem

Lecture 2: Coding the Solution

Chapter 18: Sum of Numbers with Trees (LeetCode)

Lecture 1: Sum of Numbers with Trees – Part 1

Lecture 2: Sum of Numbers with Trees – Part 2

Chapter 19: H-Index Problem (LeetCode)

Lecture 1: H-Index Problem

Chapter 20: Count the Number of Nodes in a Tree (LeetCode)

Lecture 1: Count the Number of Nodes in a Tree (LeetCode)

Chapter 21: Largest Area (CoderPad)

Lecture 1: Intro to CoderPad (Exploring the Program)

Lecture 2: Understanding the Problem

Lecture 3: Coding the Solution

Chapter 22: JavaScript Coding Interview Videos

Lecture 1: Add Linked List Numbers

Lecture 2: Tree to Circular Linked List

Lecture 3: Basic Calculator

Lecture 4: Distance Coordinate Plane

Lecture 5: Rotate Array

Lecture 6: BFS Right Side Of Tree

Lecture 7: Insert Into Circular Linked List

Lecture 8: Search A 2D Matrix

Lecture 9: Vertical Tree

Lecture 10: Deep Copy Linked List

Lecture 11: Matrix Diagonal

Lecture 12: Substring Permutation

Chapter 23: Course Summary and Wrap-Up

Lecture 1: Course Summary and Wrap-Up

Lecture 2: Source Code

Lecture 3: Bonus Lecture

Instructors

Robert Gioia
Senior Solutions Architect | Android | iOS | Game Dev | C#

Rating Distribution

1 stars: 3 votes

2 stars: 0 votes

3 stars: 0 votes

4 stars: 1 votes

5 stars: 3 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!