image
The Ultimate Drawing Course Beginner to Advanced...
$179
$79
image
User Experience Design Essentials - Adobe XD UI UX...
$179
$79
Total:
$659

Description

As you prepare for your next coding interview, have you ever thought:


"I wish someone could just walk me through these problems and explain what’s going on.
"
"I wish there was a preselected set of the most important coding interview problems so I can practice them easily."


If so, this course is for you!




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.


So, I’m going to assume that you’re already familiar with concepts such as:


Two dimensional arrays (which are simply arrays of arrays)
Breadth first search and depth first search
Linked lists and trees


If you think you’re ready for this course,
watch the preview videos
and see if you can solve those problems!
Who this course is for:
Anyone who is currently preparing for coding interviews / programming interviews
Anyone who wants to improve their problem solving / coding skills in general (coding interviews are a good way to practice these skills)

What you'll learn

Learn what a coding interview is like

Learn 3 problem solving techniques you'll be able to use in your next coding interview!

Go through 11 of the most essential coding interview questions, coding exercises and answers!

Overall, feel more confident and be ready for your next coding interview

Requirements

  • You will need a copy of Adobe XD 2019 or above. A free trial can be downloaded from Adobe.
  • No previous design experience is needed.
  • No previous Adobe XD skills are needed.

Course Content

27 sections • 95 lectures
Expand All Sections
1-Introduction and Problem Solving Tips
5
1.1-Introduction
1.2-What Is a Typical Coding Interview Like?
1.3-Problem Solving Technique #1 for Coding Interviews
1.4-Problem Solving Technique #2 for Coding Interviews
1.5-Problem Solving Technique #3 for Coding Interviews
2-Arrays
12
2.1-Most Frequently Occurring Item in an Array (Difficulty = *)
2.2-Most Frequently Occurring Item in an Array (Python)
2.3-Most Frequently Occurring Item in an Array (Java)
2.4-Most Frequently Occurring Item in an Array (Solution)
2.5-Common Elements in Two Sorted Arrays (Difficulty = **)
2.6-Common Elements in Two Sorted Arrays (Python)
2.7-Common Elements in Two Sorted Arrays (Java)
2.8-Common Elements in Two Sorted Arrays (Solution)
2.9-Is One Array a Rotation of Another? (Difficulty = **)
2.10-Is One Array a Rotation of Another? (Python)
2.11-Is One Array a Rotation of Another? (Java)
2.12-Is One Array a Rotation of Another? (Solution)
3-Strings
9
3.1-Non-Repeating Character (Difficulty = **)
3.2-Non-Repeating Character (Python)
3.3-Non-Repeating Character (Java)
3.4-Non-Repeating Character (Solution)
3.5-One Away Strings (Difficulty = ***)
3.6-One Away Strings (Python)
3.7-One Away Strings (Java)
3.8-One Away Strings (Solution)
3.9-One Away Strings (Solution in Pseudocode)
4-Two-Dimensional Arrays
15
4.1-Assign Numbers in Minesweeper (Difficulty = **)
4.2-Assign Numbers in Minesweeper (Python)
4.3-Assign Numbers in Minesweeper (Java)
4.4-Assign Numbers in Minesweeper (Solution)
4.5-Find Where to Expand in Minesweeper (Difficulty = ***)
4.6-Find Where to Expand in Minesweeper (Python)
4.7-Find Where to Expand in Minesweeper (Java)
4.8-Find Where to Expand in Minesweeper (Solution)
4.9-Find Where to Expand in Minesweeper (Solution in Pseudocode)
4.10-Rotating 2D Array (Difficulty = ***)
4.11-Rotating a 2D Array by 90 Degrees (Python)
4.12-Rotating a 2D Array by 90 Degrees (Java)
4.13-Rotating 2D Array (Out-of-Place Solution)
4.14-Rotating 2D Array (In-Place Solution)
4.15-Rotating 2D Array (In-Place Solution in Pseudocode)
5-Linked Lists and Trees
14
5.1-N-th Element of a Linked List (Difficulty = **)
5.2-N-th Element of a Linked List (Python)
5.3-N-th Element of a Linked List (Java)
5.4-N-th Element of a Linked List (Solution)
5.5-Is This a Binary Search Tree? (Difficulty = **)
5.6-Is This a Binary Search Tree? (Python)
5.7-Is This a Binary Search Tree? (Java)
5.8-Is This a Binary Search Tree? (Solution)
5.9-Is This a Binary Search Tree? (Solution in Pseudocode)
5.10-Lowest Common Ancestor (Difficulty = ***)
5.11-Lowest Common Ancestor (Python)
5.12-Lowest Common Ancestor (Java)
5.13-Lowest Common Ancestor (Solution)
5.14-Lowest Common Ancestor (Solution in Pseudocode)
6-Conclusion
2
6.1-Conclusion
6.2-Have any extra problems I should solve?