Download appDownload App

Algorithms in JavaScript - Cracking Coding Interviews

Algorithms are the building blocks of computers and play an extremely important role when it comes to writing any new programs. In order for computers to perform any task, there needs to be a set of i...

  • All levels
  • English

Course Description

Algorithms are the building blocks of computers and play an extremely important role when it comes to writing any new programs. In order for computers to perform any task, there needs to be a set of instructions that let the program know what it’s meant to be doing, which is exactly what these coding algorithms do. Starting at the very beginning, we’ll get into exactly what algorithms are in as...

Algorithms are the building blocks of computers and play an extremely important role when it comes to writing any new programs. In order for computers to perform any task, there needs to be a set of instructions that let the program know what it’s meant to be doing, which is exactly what these coding algorithms do. Starting at the very beginning, we’ll get into exactly what algorithms are in as well as why they are important and from there we’ll dive into more the different algorithms such as Sorting Algorithms, Search Algorithms, Advance Algorithms (Dynamic Programming, Knapsack Problem, etc.), String Manipulation, Tress and so on.

What you’ll learn
  • An overview of Algorithms
  • Acing a technical interview
  • Different sorting algorithms such as Quick sort, Merge Sort, Shell Sort, Heap Sort, etc.
  • Search Algorithms
  • Illustration of the Palindrome, Armstrong and Fibonnaci Algorithms
  • Advanced Algorithms
  • String Manipulation, Trees & Graphs
  • And so much more!

Covering Topics

1
Section 1 : Understanding Course
2
Section 2 : Sorting Algorithms
3
Section 3 : Search Algorithms
4
Section 4 : Illustrations of Algorithms
5
Section 5 : Advanced Algorithms
6
Section 6 : String Manipulation
7
Section 7 : Trees
8
Section 8 : Graphs

Curriculum

      Section 1 : Understanding Course
1
Introduction Preview
2
Overview of Course
3
Understanding Technical Interview
4
At the Technical Interview
5
Approaches of Algorithm
      Section 2 : Sorting Algorithms
6
Quick Sort Algorithm Preview
7
Understanding Quick Sort
8
Implementation of Quick Sort with JS
9
Merge Sort Algorithm Preview
10
Understanding Merge Sort Final
11
Implementation of Merge Sort in JS
12
Shell Sort Algorithm
13
Algorithm Analysis Shell Sort
14
Understanding Shell Sort Algorithm Final
15
Implementation of Shell Sort with JS
16
Heap Sort
17
Implementation of Heap Sort with JS
18
Understanding heap Sort Final
      Section 3 : Search Algorithms
19
Understanding Linear Search Algorithm Preview
20
Linear Search algorithm example- Final
21
Implementation of Linear Search with Example
22
Finding Minimum And Maximum Value in an array
23
Binary search Algorithm Preview
24
Binary Search Algorithm Example
25
Implementation of Binary Search with example
26
Counting Occurences
      Section 4 : Illustrations of Algorithms
27
Understanding Palindrome Number Preview
28
Palindrome Number is JS
29
Understanding Armstrong Number
30
Armstrong Numbger is Js Preview
31
Understanding Double Armstrong Number
32
Double Armstrong Number in Js
33
Anagrams
34
Anagrms in Js
35
What are Fibonnaci Series
36
Implementation of Fibonnaci Series
      Section 5 : Advanced Algorithms
37
Dynamic Programming Preview
38
Finding longest common string of two strings-Final
39
Greedy Algorithms
40
First Greedy Algorithm Coin Chnaging Problem
41
Knapsack Problem
42
Greedy Algorithm solution to the knapsack problem
43
Resulation Combination Using Knapsack
      Section 6 : String Manipulation
44
Three Ways to reverse a string
45
Finding Vowels in JS
46
Dtring Function Implementation
      Section 7 : Trees
47
Building a Binary Search Tree
48
Binary Search Tree Implementation
49
Searching for Minimum and maximum value
50
Searching For A Specific Value
      Section 8 : Graphs
51
Graph Data Structure Preview
52
Building a Graph in JS
53
Depth First Traversal
54
A-Implementation of Depth First Traversal-new Preview
55
B-Analysing Output
56
Breadth First Tranversal
57
Implementation of Breadth First Traversal in JS

Frequently Asked Questions

It is an online tutorial that covers a specific part of a topic in several sections. An Expert teaches the students with theoretical knowledge as well as with practical examples which makes it easy for students to understand.

A Course helps the user understand a specific part of a concept. While a path and E-Degrees are broader aspects and help the user understand more than just a small area of the concept.

A Course will help you understand any particular topic. For instance, if you are a beginner and want to learn about the basics of any topic in a fluent manner within a short period of time, a Course would be best for you to choose.

We have an inbuilt question-answer system to help you with your queries. Our support staff will be answering all your questions regarding the content of the Course.