Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Skillshare

Cracking the Coding Interview : Data Structure & Algorithms : 2020

via Skillshare

This course may be unavailable.

Overview

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

Syllabus

  • Introduction
  • Length of Last Word
  • Reverse String
  • 38 spiral order matrix
  • Search in Matrix
  • ZigZag Conversion
  • Single Number
  • Two Sum
  • Two Sum II
  • Excel Sheet Column Number
  • Intersection of Linked Lists
  • Reverse Linked List
  • Add Two Numbers as Lists
  • Partition List
  • Linked List Cycle
  • Linked List Cycle - 2
  • Balanced Parentheses
  • Evaluate Expression
  • Valid Palindrome
  • Valid Palindrome - 2
  • Remove All Adjacent Duplicates In String
  • Remove All Adjacent Duplicates In String - 2
  • Fizz Buzz
  • Introduction to Recursion
  • Recursion and PMI
  • Fibonacci Number
  • Power
  • Print Numbers
  • Numbers of Digits
  • Sum of Digits
  • Multiplication
  • Count Zeroes
  • Geometric Sum
  • Selection Sort Algorithm ( Explain + Code )
  • Bubble Sort Algorithm ( Explain + Code )
  • Optimized Bubble Sort Algorithm (Explain + Code )
  • Inbuilt Sort : Standard Template Library (STL)
  • Binary Search Algorithm (Explain)
  • Binary Search Algorithm (Code)
  • Find First and Last Position of Element in Sorted Array
  • Search in Rotated Sorted Array
  • Implement SQRT
  • Find minimum element in sorted rotated array
  • Set Matrix Zeroes
  • Inorder Traversal
  • PreOrder Traversal
  • PostOrder Traversal
  • Level Order Traversal
  • Reverse Level Order Traversal
  • 35 zigzag level order traversal
  • Invert Binary Tree
  • Symmetric Binary Tree
  • Validate Binary Search Tree
  • Maximum Depth of a Binary Tree
  • Minimum Depth of Binary Tree
  • 37 least common ancestor of bst
  • Rotate Image
  • Find Permutation
  • Same Tree
  • Majority element
  • Fibonaci
  • Hint Minimum Steps to 1
  • Minimum Steps to 1 Brute force Method
  • Minimum steps to 1 Memorization Method
  • Minimum steps to 1 Bottom up Method
  • Remove kth node from end of ll

Taught by

Harsh Kajla

Reviews

Start your review of Cracking the Coding Interview : Data Structure & Algorithms : 2020

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.