Data Structures | Algorithms:CODING INTERVIEW 25Days of Code

Free Courses : Data Structures | Algorithms:CODING INTERVIEW 25Days of Code

Welcome to the Coding Interview Bootcamp!

Once you get an interview from a top tech company, the only thing that matters for you to get your dream Software Engineering role is your performance in the coding Interviews.

The only way to ace the coding interview is to take one problem at a time and really understand how to solve it and then do this for a lot of problems to get sufficient tools and techniques in your arsenal to face and conquer any coding interview. This is what my aim is for you with this course.

This course is structured as DAILY CODING CHALLENGES to give you a clear target for every day. By not missing a single day and by staying consistent you will have solved a variety of questions by the end of this course, getting you prepared for coding interviews and more practice on your own from Leetcode.

We start right from the basics and discuss Big O analysis and then move on to cover the common data structures and then discuss real life problems asked in Big Tech companies such as Google, Meta, Amazon, Netflix, Apple, Microsoft etc.

For Each Question we discuss :

   1. The Logic or the method by which we can approach this question in an optimal manner

   2. The Time and Space complexity of the Solution

   3. Code the Solution in Javascript ( You can follow along in any coding language of your choice)

This course also includes multiple downloadable resources, trackers to keep you motivated, and cheat sheets to make your coding interview prep smooth.

COURSE OUTLINE

• DAY 1: Arrays

  Data Structures Introduction

  Big O

  DS: Arrays Crash Course

  Question 1: Sorted Squared Array

  Question 2: Monotonic Array

• DAY 2: Arrays

  Question 1: Rotate Array

  Question 2:Container with most Water

• DAY 3: Hash Table

  DS: Hash Tables Crash Course

  Question 1: Two Sum

  Question 2:Isomorphic Strings

• DAY 4: Recursion

  Question 1: Fibonacci

  Question 2:Power Sum

• DAY 5: Recursion

  Question 1: Permutations

  Question 2:Power Set

• DAY 6: String

  DS: Strings Crash Course

  Question 1: Non repeating character

  Question 2: Palindrome

• DAY 7: String

  Question 1: Longest Unique char Substring

  Question 2: Group Anagrams

• DAY 8: Searching

  Question 1: Binary Search

  Question 2: Search in Rotated Sorted array

• DAY 9: Searching

  Question 1: Find First and Last Position of Element in Sorted Array

  Question 2: Search in 2D Array

• DAY 10: Sorting

  Question 1: Bubble Sort

  Question 2: Insertion Sort

• DAY 11: Sorting

  Question 1: Selection Sort

  Question 2: Merge Sort

• DAY 12: Sorting

  Question 1: Quick Sort

  Question 2: Radix Sort

• DAY 13: Singly Linked List

  DS: Linked List Crash Course

  Question 1:  Construct SLL

  Question 2: delete duplicates

• Day 14: Singly Linked List

  Question 1:  Reverse SLL

  Question 2: Cycle Detection

• DAY 15: Singly Linked List

  Question 1: find duplicate number

  Question 2: Add 2 numbers

• DAY 16: Doubly Linked List

  Question 1: DLL remove insert

  Question 2: DLL remove all, insert at position

• DAY 17: Stacks

  DS: Stacks Crash Course

  Question 1:  Construct Stack

  Question 2: Reverse Polish Notation

• DAY 18: Queues

  DS: Queues Crash Course

  Question 1: Construct Queue

  Question 2: Implement Queue with Stack

• DAY 19: Binary Tree and Binary Search Tree

  DS: Binary Tree, Binary Search Tree Crash Course

  Question 1: Construct BST

  Question 2: Traverse BST (Breadth first and Depth first - Inorder, Preorder,Post order)

• DAY 20: Binary Tree and Binary Search Tree

  Question 1: Level Order traversal

  Question 2: Left/Right View of binary tree

• DAY 21: Binary Tree and Binary Search Tree

  Question 1: Invert Binary Tree

  Question 2: Diameter of binary tree

• DAY 22: Binary Tree and Binary Search Tree

  Question 1: Convert Sorted Array to Binary Search Tree

  Question 2: Validate BST

• DAY 23: Heaps and Priority Queue

  DS: Heaps Crash Course

  Question 1: Max Heap Construction

  Question 2: min Priority Queue Construction

• DAY 24: Graphs

  DS: Graphs Crash Course

  Question 1:  BFS - Adj List and Adj Matrix

  Question 2: DFS - Iterative and Recursive

• DAY 25: Graphs

  Question 1: Number of connected components

  Question 2: Course Scheduler / Topological sort

I'm sure you'll love this course and so we're offering a full money-back guarantee for 30 days in case you are not sure at the moment!

Enroll today and see you inside the course !

Let's make your dreams come true

- Jackson

1. Membuat website statis dengan Hugo
2. Tips dan Trik CSS
3. Sistem authentikasi laravel
4. Membuat Notifikasi realtime PHP
5. JSON Web Token pada NodeJS