Learning Javascript

Topics

1. Basics
   • Variables
   • Type Coersion and Conversion
   • Loops
   • Conditional Statements
   • Functions
   • Arrays
   • Objects
   • This Keyword
   • Sets
   • Maps
   • Operations
   • Error Handling
   • Closures
   • Currying
   • Prototype
   • Prototypal Inheritance
   • Classes
   • Class Inheritance
   • Promises
   • Modules
2. Recursion
   • Factorial
   • Exponents
   • Fibonacci
   • Power of Four
   • Reverse String
3. Searching
   • Linear Search
   • Binary Search
   • Binary Search Recursive
4. Sorting
   • Array Sort Method
   • Selection Sort
   • Insertion Sort
   • Bubble Sort
   • Merge Sort
   • Quick Sort
5. Stacks and Queues
   • Stacks
     • Push
     • Pop
     • Peek
     • Print
   • Queues Using Array
     • Enqueue
     • Dequeue
     • Peek
     • Print
   • Queues Using Object
   • Queues Using Two Stacks
   • Circular Queue
     • Enqueue
     • Dequeue
     • Peek
     • Find Available Spots
     • Print
6. Linked Lists and Tables
   • Linked List
     • Insert Node
     • Remove Node
     • Find Node
     • Find Middle Node
     • Reverse List
     • Print List
   • Doubly Linked List
   • Hash Table
     • Set Key/Value
     • Get Key/Value
     • Remove Key/Value
     • Print Table
7. Trees and Graphs
   • BST: Binary Search Tree
     • Insert Node
     • Has Node
     • Minimum Value in Tree
     • Maximum Value in Tree
     • Minimum Tree Depth
     • Maximum Tree Depth
     • Path from Root to Every Leaf
     • Value Sum from Root to Leaf
     • All Path Sums
     • Print Tree by Level
     • Delete Node
   • DFS: Depth First Search
     • Pre-Order Traversal
     • In-Order Traversal
     • Post-Order Traversal
   • BFS: Breadth First Search
     • Breadth First Traversal
   • Trie
     • Add
     • Search
     • Suggest
     • List All
   • Min Heap
     • Add
     • Remove
     • Peek
   • Max Heap
     • Add
     • Remove
     • Peek
   • Graph Representation
     • Adjacency Matrix
     • Adjacency List
   • Undirected Graph
     • Add Vertex
     • Add Edge
     • Remove Vertex
     • Remove Edge
     • Has Edge
     • Print
8. Exercises
   • Is Palindrome
   • Is Prime
   • Is Power of Two
   • Is Power of Four
   • Is Anagram
   • Is Array Monotonic
   • Is Pangram
   • Factorial
   • Fibonacci
   • Valid Subsequence
   • Last Word Length
   • Increment Number as Array
   • Binary Gap
   • Valid Paranthesis
   • Robot Back to Origin
   • Robot Automation
   • Simplify Path
   • Roman Decimal Conversion
   • Generate Paranthesis
   • Is String Subset
   • Can Be Palindrome
   • First Non Repeating Character
   • Climbing Staircase
   • Smallest Missing Number
   • Get N Missing Numbers
   • Non Overlapping Intervals
   • Insert Interval
   • Merge Intervals
   • Merge Sorted Arrays
   • Merge Three Sorted Arrays
   • Merge Sorted Linked Lists
   • Merge Intersecting Linked Lists
   • Median of Sorted Arrays
   • Remove Duplicates
   • Group Anagrams
   • Two Sum
   • Four Sum
   • Rotate Array
   • Rotate Linked List
   • Permutations of Elements in Array
   • Cartesian Product
   • Common Prefix
   • Maximize Vacation
   • Robot Path
   • Matrix Spiral
   • Rotate Matrix
   • Tower of Hanoi
   • Flatten Nested Array
   • Longest Common Substring
   • Contiguous Subarrays
   • Rotational Cipher
   • Pair Sums
   • Most Frequent K Elements
   • Train Platforms
   • Detect Loop in Linked List
   • Linked List Intersection
   • Reorder Linked List
   • Add Numbers as Linked List
   • Count Palindromic Substrings
   • Longest Palindromic Substring
   • Revenue Milestones
   • Cafeteria Seats
   • Planting Flowers
   • Rotary Locks
   • First and Last Position
   • Search in Sorted Rotated Array
   • Kth Largest Element in Array
   • Kth Largest Element without Sorting
   • Buy Low Sell High
   • Is Valid BST
   • Lowest Common Ancestor in BST
   • Lowest Common Ancestor in Binary Tree
   • Binary Tree Symmetry
   • Identical Trees
   • Are Binary Trees Isomorphic
   • Is Binary Tree Balanced
   • Balance a Binary Search Tree
   • Sorted Array to BST
   • Sorted Linked List to BST
   • BST to Sorted Linked List
   • BST to Sorted Doubly Linked List
   • BST to Circular Linked List
   • Binary Tree to Linked List
   • Circular Gas Station
   • Course Prerequisites
   • Kth Permutation
   • Shortest Substring
   • Contiguous Subarray Averages
   • Trapping Rain Water
   • Custom Data Structure
   • Coin Change
   • Grid Traveler
   • Can Sum
   • How Sum
   • Sentence Using Dictionary
   • Knapsack Problem
   • Number of Islands
   • River Sizes
   • LRU MRU Cache using Object and Linked List
   • LRU MRU Cache using Map
9. Components
   • Progress Bar
   • Scroll Indicator