Descriptions

190 Coding Interview Questions, training course on answering job interview questions is published by AlgoExpert Academy. We have prepared a library of practice problems for programming interviews. Coding interview preparation is a numbers game that many candidates miss. We’ve handpicked 190 of the best coding interview questions to prepare you for any interview you face.

What you’ll learn

• Validate Subsequence
• Two Number Sum
• Sorted Squared Array
• Tournament Winner
• Non-Constructible Change
• Find Closest Value In BST
• Branch Sums
• Node Depths
• Evaluate Expression Tree
• Depth-first Search
• Minimum Waiting Time
• Class Photos
• Tandem Bicycle
• Remove Duplicates From Linked List
• Middle Node
• Nth Fibonacci
• Product Sum
• Binary Search

Specificatoin of 190 Coding Interview Questions

• Publisher : AlgoExpert
• Teacher : Clement Mihailescu
• Language : English
• Level : All Levels
• Number of Course : 190
• Duration : 112 hours and 29 minutes

Content of 190 Coding Interview Questions

# array-easy Non-Constructible Change
# array-easy Sorted Squared Array
# array-easy Tournament Winner
# array-easy Two Number Sum
# array-easy Validate Subsequence
# array-hard Four Number Sum
# array-hard Largest Range
# array-hard Min Rewards
# array-hard Subarray Sort
# array-hard Zigzag Traverse
# array-med Array Of Products
# array-med First Duplicate Value
# array-med Longest Peak
# array-med Merge Overlapping Intervals
# array-med Monotonic Arrays
# array-med Move Element To End
# array-med Smallest Difference
# array-med Spiral Traverse
# array-med Three Number Sum
# array-vhard Apartment Hunting
# array-vhard Calendar Matching
# array-vhard Line Through Points
# array-vhard Minimum Area Rectangle
# array-vhard Waterfall Streams
# bstree-easy Find Closest Value In BST
# bstree-hard Same BSTs
# bstree-med BST Construction
# bstree-med BST Traversal
# bstree-med Find Kth Largest Value In BST
# bstree-med Min Height BST
# bstree-med Reconstruct BST
# bstree-med Validate BST
# bstree-vhard Right Smaller Than
# bstree-vhard Validate Three Nodes
# btree-easy Branch Sums
# btree-easy Node Depths
# btree-hard Find Nodes Distance K
# btree-hard Max Path Sum
# btree-med Binary Tree Diameter
# btree-med Find Successor
# btree-med Height Balanced Binary Tree
# btree-med Invert Binary Tree
# btree-vhard All Kinds Of Node Depths
# btree-vhard Compare Leaf Traversal
# btree-vhard Flatten Binary Tree
# btree-vhard Iterative In-order Traversal
# btree-vhard Right Sibling Tree
# dynpr-hard Disk Stacking
# dynpr-hard Knapsack Problem
# dynpr-hard Longest Common Subsequence
# dynpr-hard Max Sum Increasing Subsequence
# dynpr-hard Maximize Expression
# dynpr-hard Maximum Sum Submatrix
# dynpr-hard Min Number Of Jumps
# dynpr-hard Numbers In Pi
# dynpr-hard Water Area
# dynpr-med Levenshtein Distance
# dynpr-med Max Subset Sum No Adjacent
# dynpr-med Min Number Of Coins For Change
# dynpr-med Number Of Ways To Make Change
# dynpr-med Number Of Ways To Traverse Graph
# dynpr-vhard Longest Increasing Subsequence
# dynpr-vhard Longest String Chain
# dynpr-vhard Max Profit With K Transactions
# dynpr-vhard Palindrome Partitioning Min Cuts
# dynpr-vhard Square Of Zeroes
# famous-hard Dijkstras Algorithm
# famous-hard Topological Sort
# famous-med Kadanes Algorithm
# famous-vhard A-star Algorithm
# famous-vhard Knuth-Morris-Pratt
# graphs-easy Depth-first Search
# graphs-hard Boggle Board
# graphs-med Breadth-first Search
# graphs-med Cycle In Graph
# graphs-med Minimum Passes of Matrix
# graphs-med Remove Islands
# graphs-med River Sizes
# graphs-med Single Cycle Check
# graphs-med Youngest Common Ancestor
# graphs-vhard Airport Connections
# graphs-vhard Detect Arbitrage
# graphs-vhard Rectangle Mania
# graphs-vhard Two Edge Connected Graph
# greedy-easy Class Photos
# greedy-easy Minimum Waiting Time
# greedy-easy Tandem Bicycle
# greedy-med Task Assignment
# greedy-med Valid Starting City
# heaps-hard Continuous Median
# heaps-hard Laptop Rentals
# heaps-hard Sort K-Sorted Array
# heaps-med Min Heap Construction
# heaps-vhard Merge Sorted Arrays
# llist-easy Linked List Construction
# llist-easy Remove Duplicates From Linked List
# llist-hard Find Loop
# llist-hard Merge Linked Lists
# llist-hard Reverse Linked List
# llist-hard Shift Linked List
# llist-med Remove Nth Node From End
# llist-med Sum Of Linked Lists
# llist-vhard Linked List Palindrome
# llist-vhard LRU Cache
# llist-vhard Node Swap
# llist-vhard Rearrange Linked List
# llist-vhard Zip Linked List
# recursion-easy Nth Fibonacci
# recursion-easy Product Sum
# recursion-hard Ambiguous Measurements
# recursion-hard Generate Div Tags
# recursion-hard Interweaving Strings
# recursion-hard Lowest Common Manager
# recursion-hard Solve Sudoku
# recursion-med Permutations
# recursion-med Phone Number Mnemonics
# recursion-med Powerset
# recursion-med Staircase Traversal
# recursion-vhard Non-Attacking Queens
# recursion-vhard Number Of Binary Tree Topologies
# search-easy Binary Search
# search-easy Find Three Largest Numbers
# search-hard Index Equals Value
# search-hard Quickselect
# search-hard Search For Range
# search-hard Shifted Binary Search
# search-med Search In Sorted Matrix
# sort-easy Bubble Sort
# sort-easy Insertion Sort
# sort-easy Selection Sort
# sort-hard Heap Sort
# sort-hard Quick Sort
# sort-hard Radix Sort
# sort-med Three Number Sort
# sort-vhard Count Inversions
# sort-vhard Merge Sort
# stacks-hard Largest Rectangle Under Skyline
# stacks-hard Shorten Path
# stacks-med Balanced Brackets
# stacks-med Min Max Stack Construction
# stacks-med Next Greater Element
# stacks-med Sort Stack
# stacks-med Sunset Views
# strings-easy Caesar Cipher Encryptor
# strings-easy First Non-Repeating Character
# strings-easy Generate Document
# strings-easy Palindrome Check
# strings-easy Run-Length Encoding
# strings-hard Longest Substring Without Duplication
# strings-hard Pattern Matcher
# strings-hard Underscorify Substring
# strings-med Group Anagrams
# strings-med Longest Palindromic Substring
# strings-med Minimum Characters for Words
# strings-med Reverse Words In String
# strings-med Valid IP Addresses
# strings-vhard Longest Balanced Substring
# strings-vhard Smallest Substring Containing
# tries-hard Multi String Search
# tries-med Suffix Trie Construction

Pictures

Sample Clip

Installation Guide

Extract the files and watch with your favorite player

Subtitle : Not Available

Quality: 720p

Changes:

Version 2023/6 compared to 2022/4 has increased the number of 32 lessons and the duration of 11 hours and 36 minutes. (It was placed separately for download.)

Download Links

Version 2023/6 (32 lessons Only)

Download Part 1 – 1 GB

Download Part 2 – 285 MB

Version 2022/4

Download Part 1 – 1 GB

Download Part 2 – 1 GB

Download Part 3 – 1 GB

Download Part 4 – 1 GB

Download Part 5 – 1 GB

Download Part 6 – 297 MB

Password file(s): www.downloadly.ir

File size

5.29 + 1.28 GB