50 Popular Coding Interview Problems

Prepare for your coding interview with these 50 solved and explained popular coding problems

What you'll learn
How to solve coding interview problems
How to use recursion, dynamic programming, memoization, divide and conquer, backtracking…
How to solve problems related to various data structures

Requirements
Basics in algorithms, data structures, and time/space complexity analysis

Description
Preparing for coding interviews? Competitive programming? Then this course will help you for sure: 50 well-chosen problems to increase your problem-solving skills!Many algorithms concepts covered: dynamic programming, divide and conquer, memoization, backtracking…And many data structures used: arrays, hashmaps, sets, trees, stacks…And also, time and space complexity analysis is provided for every problem!Problems covered:1- Find pair that sums up to k2- First repeating character3- Remove duplicates4- Find the duplicate5- Tree depth first search6- Maximum subarray7- Reverse a binary tree8- Longest substring without repeating characters9- Reverse a linked list10- Peak finding11- Palindrome linked list12- Longest possible palindrome13- Get substring index14- Tree breadth first search15- Sort a linked list16- Valid binary search tree17- Minimum cost path in matrix18- Balanced binary tree19- Paths in matrix20- Tree breadth first search II21- Product of array except self22- Jump to last index23- Graph depth first search24- Graph breadth first search25- String subsequences26- Valid brackets27- Flatten a binary tree28- Lowest common ancestor29- Minimum in rotated sorted array30- Add two linked lists31- Ways to climb stairs32- Subsets that sum up to k33- Ways to decode34- Remove node from binary search tree35- Array permutations36- Longest common subsequence37- Longest consecutive sequence38- Edit distance39- Count sorted vowel strings40- Smallest number after removing k digits41- Merge intervals42- Insert interval43- Binary tree max sum44- 0-1 Knapsack45- Shortest palindrome46- Coin change47- Word search48- N-queens49- Word ladder50- Longest increasing subsequence

Who this course is for:
People preparing for coding interviews,Competitive programmers,People who want to increase their problem-solving skills