HOT
blank

Cracking the Coding Interview

Development

Rating3.7
Enroll Now

Cracking the Coding Interview, available at $64.99, has an average rating of 3.65, with 208 lectures, based on 36 reviews, and has 365 subscribers.

You will learn about Coding Interview Questions. ability to formulate real-world problems. skill to analyze a problem, design the algorithm and convert the algorithm to a tested Program. analytical ability to determine the computational complexity of an algorithm. Algorithmic Problem Solving This course is ideal for individuals who are Engineers who are going to be interviewed for Software development positions at various BIG Tech Companies It is particularly useful for Engineers who are going to be interviewed for Software development positions at various BIG Tech Companies.

Enroll now: Cracking the Coding Interview

Summary

Title: Cracking the Coding Interview

Price: $64.99

Average Rating: 3.65

Number of Lectures: 208

Number of Published Lectures: 208

Number of Curriculum Items: 208

Number of Published Curriculum Objects: 208

Original Price: $24.99

Quality Status: approved

Status: Live

What You Will Learn

  • Coding Interview Questions.
  • ability to formulate real-world problems.
  • skill to analyze a problem, design the algorithm and convert the algorithm to a tested Program.
  • analytical ability to determine the computational complexity of an algorithm.
  • Algorithmic Problem Solving

Who Should Attend

  • Engineers who are going to be interviewed for Software development positions at various BIG Tech Companies

Target Audiences

  • Engineers who are going to be interviewed for Software development positions at various BIG Tech Companies

The purpose of this Course is to help the Engineers who are going to be interviewed for Software development positions at various BIG Tech Companies, to crack the coding interview.

Enclosed in this Course is a Collection of Problems/Questions asked at various Coding Interviews.

Note that the numbers of questions enclosed in this Course is open ended.

We update this Course regularly with a number of potential problems collected based on our conversations with interviewers and candidates.

 

Hence, by purchasing this course, you are obtaining something which helps you through out your Software Development Journey.

By the end of this Course,

You will have the ability to formulate real-world problems.

You will have the skill to analyze a problem, design the algorithm and convert the algorithm to a tested Program.

You will have the analytical ability to determine the computational complexity of an algorithm.

Coming to the prerequisite of this Course, You should have strong basics on Data Structures and Algorithms.

Note that this Course does not teach you data structures and algorithms.

It teaches you how to apply data structures and algorithms to solve various problems.

And finally, this course comes with a 30-days Money back guarantee.

Hence, there is really nothing you loose.

I am super excited to see you enrolled in this Course.

Thank You!

Course Curriculum

Chapter 1: Introduction

Lecture 1: About this Course

Chapter 2: [Strings] Check whether the given String is a permutation of a palindrome

Lecture 1: Problem Statement

Lecture 2: Figuring out the approach

Lecture 3: Analysing the Time and Space Complexity

Lecture 4: Coding the Optimal Solution

Chapter 3: [Linked Lists] Return Kth to last element in LinkedList.

Lecture 1: Problem Statement

Lecture 2: Brute-Force Solution

Lecture 3: Optimizing further

Lecture 4: Coding the Optimal Solution

Chapter 4: [Stacks and Queues] Stack with min Operation.

Lecture 1: Problem Statement

Lecture 2: Figuring out the approach

Lecture 3: Coding the optimal solution

Chapter 5: [Linked Lists] Reverse a Single LinkedList.

Lecture 1: Problem Statement

Lecture 2: Exercise-1

Lecture 3: Figuring out the approach

Lecture 4: Coding the optimal solution

Chapter 6: [Searching] Search a Sorted Array for first occurrence of k.

Lecture 1: The Problem Statement

Lecture 2: Exercise-1

Lecture 3: Figuring out the Test Cases

Lecture 4: Exercise-2

Lecture 5: Brute-Force Solution

Lecture 6: Optimizing further

Lecture 7: Exercise-3

Lecture 8: Coding the optimal solution

Chapter 7: [Dynamic Programming] Count ways to climb.

Lecture 1: Problem Statement

Lecture 2: Understanding the problem statement

Lecture 3: Recursive approach

Lecture 4: Optimising using Memoization

Chapter 8: [Math] Trailing Zeros in n factorial.

Lecture 1: Problem Statement

Lecture 2: Figuring out the approach

Lecture 3: Coding the solution

Chapter 9: [Searching] Search a Sorted Array for Entry equal to its Index.

Lecture 1: The Problem Statement

Lecture 2: Exercise-1

Lecture 3: Bruteforce Solution

Lecture 4: Optimizing further

Lecture 5: Writing TestCases

Lecture 6: Validating the approach with Test Cases

Lecture 7: Coding the Optimal Solution

Chapter 10: [Strings] Reverse the order of words in a Sentence.

Lecture 1: Problem Statement

Lecture 2: Figuring out the approach

Lecture 3: Coding the Solution

Chapter 11: [Strings] URLify a String.

Lecture 1: Problem Statement

Lecture 2: Figuring out the approach

Lecture 3: Coding the solution

Chapter 12: [Arrays] Is last index reachable?

Lecture 1: Problem Statement

Lecture 2: Figuring out the approach

Lecture 3: Coding the Solution

Chapter 13: [Linked Lists] Implement List Pivoting.

Lecture 1: Problem Statement

Lecture 2: Figuring out the approach

Lecture 3: Coding the optimal Solution

Chapter 14: [Binary Search Trees] Construct a minimal height tree from a sorted array.

Lecture 1: Problem Statement

Lecture 2: Figuring out the approach

Lecture 3: Coding the solution

Chapter 15: [Stacks and Queues] Implement a Queue using Stacks

Lecture 1: Problem Statement

Lecture 2: Understanding the Problem Statement

Lecture 3: Exercise-1

Lecture 4: Figuring out the Solution

Lecture 5: Coding the Optimal Solution

Chapter 16: [Primitive Types] Check if a Decimal Integer is a Palindrome

Lecture 1: Problem Statement

Lecture 2: Exercise-1

Lecture 3: Figuring out the Solution

Lecture 4: Coding the Optimal Solution

Chapter 17: [Sorting] Compute the Intersection of two sorted arrays

Lecture 1: Problem Statement

Lecture 2: Exercise-1

Lecture 3: Brute-Force Solution

Lecture 4: Optimizing further – 1

Lecture 5: Optimizing further – 2

Lecture 6: Writing TestCases

Lecture 7: Validating the approach with Testcases.

Lecture 8: Coding the Optimal Solution

Chapter 18: [Arrays] The Dutch National Flag Problem

Lecture 1: Problem Statement

Lecture 2: Brute-Force Solution

Lecture 3: Optimizing further

Lecture 4: Writing TestCases

Lecture 5: Exercise-1

Lecture 6: Coding the optimal solution

Chapter 19: [Greedy] The Interval Covering Problem

Lecture 1: Problem Statement

Lecture 2: Understanding the Problem Statement

Lecture 3: Exercise-1

Lecture 4: Figuring out the approach

Lecture 5: Exercise-2

Instructors

Rating Distribution

  • 1 stars: 2 votes
  • 2 stars: 1 votes
  • 3 stars: 5 votes
  • 4 stars: 9 votes
  • 5 stars: 19 votes

Frequently Asked Questions


How long do I have access to the course materials?


You can view and review the lecture materials indefinitely, like an on-demand channel.


Can I take my courses with me wherever I go?


Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

You may also like

Top 10 Ethical AI Courses to Learn in November 2024

Top 10 Game Development Courses to Learn in November 2024

Top 10 Software Testing Courses to Learn in November 2024