Cracking the Coding Interview : Data Structure & Algorithms : 2020

Harsh Kajla, SDE-1 at Amazon, Bootcamp Instructor

Play Speed
  • 0.5x
  • 1x (Normal)
  • 1.25x
  • 1.5x
  • 2x
66 Lessons (17h 59m)
    • 1. Introduction

      1:59
    • 2. Length of Last Word

      7:29
    • 3. Reverse String

      11:11
    • 4. 38 spiral order matrix

      18:30
    • 5. Search in Matrix

      14:20
    • 6. ZigZag Conversion

      19:36
    • 7. Single Number

      16:24
    • 8. Two Sum

      20:59
    • 9. Two Sum II

      11:41
    • 10. Excel Sheet Column Number

      9:57
    • 11. Intersection of Linked Lists

      30:10
    • 12. Reverse Linked List

      8:21
    • 13. Add Two Numbers as Lists

      17:57
    • 14. Partition List

      20:25
    • 15. Linked List Cycle

      16:55
    • 16. Linked List Cycle - 2

      21:55
    • 17. Balanced Parentheses

      19:54
    • 18. Evaluate Expression

      23:58
    • 19. Valid Palindrome

      11:49
    • 20. Valid Palindrome - 2

      16:16
    • 21. Remove All Adjacent Duplicates In String

      26:40
    • 22. Remove All Adjacent Duplicates In String - 2

      34:32
    • 23. Fizz Buzz

      8:39
    • 24. Introduction to Recursion

      23:12
    • 25. Recursion and PMI

      16:15
    • 26. Fibonacci Number

      10:24
    • 27. Power

      5:52
    • 28. Print Numbers

      14:43
    • 29. Numbers of Digits

      11:18
    • 30. Sum of Digits

      9:37
    • 31. Multiplication

      9:59
    • 32. Count Zeroes

      9:01
    • 33. Geometric Sum

      8:33
    • 34. Selection Sort Algorithm ( Explain + Code )

      30:49
    • 35. Bubble Sort Algorithm ( Explain + Code )

      21:34
    • 36. Optimized Bubble Sort Algorithm (Explain + Code )

      8:08
    • 37. Inbuilt Sort : Standard Template Library (STL)

      6:31
    • 38. Binary Search Algorithm (Explain)

      16:54
    • 39. Binary Search Algorithm (Code)

      15:13
    • 40. Find First and Last Position of Element in Sorted Array

      24:20
    • 41. Search in Rotated Sorted Array

      20:25
    • 42. Implement SQRT

      17:42
    • 43. Find minimum element in sorted rotated array

      18:16
    • 44. Set Matrix Zeroes

      27:40
    • 45. Inorder Traversal

      10:56
    • 46. PreOrder Traversal

      9:20
    • 47. PostOrder Traversal

      8:16
    • 48. Level Order Traversal

      30:50
    • 49. Reverse Level Order Traversal

      11:03
    • 50. 35 zigzag level order traversal

      27:47
    • 51. Invert Binary Tree

      7:27
    • 52. Symmetric Binary Tree

      12:33
    • 53. Validate Binary Search Tree

      23:04
    • 54. Maximum Depth of a Binary Tree

      11:29
    • 55. Minimum Depth of Binary Tree

      18:07
    • 56. 37 least common ancestor of bst

      18:34
    • 57. Rotate Image

      19:03
    • 58. Find Permutation

      18:29
    • 59. Same Tree

      9:04
    • 60. Majority element

      25:46
    • 61. Fibonaci

      27:25
    • 62. Hint Minimum Steps to 1

      9:18
    • 63. Minimum Steps to 1 Brute force Method

      11:19
    • 64. Minimum steps to 1 Memorization Method

      14:46
    • 65. Minimum steps to 1 Bottom up Method

      13:53
    • 66. Remove kth node from end of ll

      24:09
15 students are watching this class

About This Class

Requirements

  • Basic understanding of C++/Java/Python ,  Data Structure and Algo

I myself have cracked coding interviews of Amazon , Microsoft, Samsung, Flipkart..... and many more.

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!

Data Structures? They're here. Algorithms? Covered. Lots of questions with well-explained solutions? Yep!

Handpicked questions  from Leetcode ,Interviewbit , Hackerrank , GeeksforGeeks .....

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 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 will type code and explain code simultaneously

  • 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.

  • A huge collection of common algorithm questions, including everything from 'reversing a string' to 'determine the width of a BST'

  • Insider tips on answering what interviewers area really looking for

  • Constant support on the Skillshare Q&A forums from me!

  • Every single problem has a complete solution walk through video as well as accompanying solution file.

  • I cover helpful "tips and tricks" to solve common problems, but we also focus on building an approach to ANY problem.

My goal in this course is to help you defeat those interviewers who ask nasty algorithm questions. Sign up today, and be the cutting edge engineer who will be prepared to get a high paying job

Who this course is for:

  • Anyone preparing for an interview that will involve coding challenges