English | MP4 | AVC 1280×720 | AAC 48KHz 2ch | 2 Hours | 309 MB
Learn 3 handy problem solving techniques. Get 11 hand-picked problems. Get ready for your next coding interview!
In this course:
- First, I’m going to give you a few problem solving techniques you’ll be able to use right away in your next coding interview.
- Then, I’m going to walk you through the 11 essential coding interview questions and their answers.
- I’ve picked these particular questions because they are the types of questions that are asked most often in programming interviews.
- I’m going to cover problems that use concepts such as arrays, strings, two-dimensional arrays, linked lists and trees.
- You’ll get a coding exercise in Python and Java for each problem, so you can get feedback on your solution right away.
- If you want to use any other language to follow this course, that’s fine too! Just remember to run your solution on your computer to make sure it works.
- This course is intended for intermediate to advanced learners who are preparing for their software engineer programming interviews.
Table of Contents
Introduction and Problem Solving Tips
1 Introduction
2 What Is a Typical Coding Interview Like_
3 Problem Solving Technique #1 for Coding Interviews
4 Problem Solving Technique #2 for Coding Interviews
5 Problem Solving Technique #3 for Coding Interviews
Arrays
6 Most Frequently Occurring Item in an Array (Difficulty = _)
7 MF.java
7 Most Frequently Occurring Item in an Array (Solution)
8 Common Elements in Two Sorted Arrays (Difficulty = __)
9 CE.java
9 Common Elements in Two Sorted Arrays (Solution)
10 Is One Array a Rotation of Another_ (Difficulty = __)
11 ir.py
11 Is One Array a Rotation of Another_ (Solution)
Strings
12 Non-Repeating Character (Difficulty = __)
13 Non-Repeating Character (Solution)
13 NR.java
14 One Away Strings (Difficulty = ___)
15 One Away Strings (Solution)
16 OA.java
16 One Away Strings (Solution in Pseudocode)
Two-Dimensional Arrays
17 Assign Numbers in Minesweeper (Difficulty = __)
18 Assign Numbers in Minesweeper (Solution)
18 MS.java
19 Find Where to Expand in Minesweeper (Difficulty = ___)
20 Find Where to Expand in Minesweeper (Solution)
21 Find Where to Expand in Minesweeper (Solution in Pseudocode)
21 MS2.java
22 Rotating 2D Array (Difficulty = ___)
23 R2.java
23 Rotating 2D Array (Out-of-Place Solution)
24 Rotating 2D Array (In-Place Solution)
25 R2InPlace.java
25 Rotating 2D Array (In-Place Solution in Pseudocode)
Linked Lists and Trees
26 N-th Element of a Linked List (Difficulty = __)
27 N-th Element of a Linked List (Solution)
27 Nth.java
28 Is This a Binary Search Tree_ (Difficulty = __)
29 Is This a Binary Search Tree_ (Solution)
30 BST.java
30 Is This a Binary Search Tree_ (Solution in Pseudocode)
31 Lowest Common Ancestor (Difficulty = ___)
32 Lowest Common Ancestor (Solution)
33 LCA.java
33 Lowest Common Ancestor (Solution in Pseudocode)
Conclusion
34 Conclusion
Resolve the captcha to access the links!