Skip to content

Latest commit

 

History

History
88 lines (54 loc) · 4 KB

assignments.md

File metadata and controls

88 lines (54 loc) · 4 KB

All problems within a week are ordered from the easiest to hardest

Week 6

Kick Start

  1. Easy Retype
  2. Medium Trash Bins
  3. Hard+ Festival

Week 5

Kick Start (Medium)

  1. (Mandatory - Look into it at least for two hours) Transform the String

Easy

  1. #Array, #BinarySearch Binary Search
  2. #Array, #HashTable, #BinarySearch, #Sorting Fair Candy Swap
  3. #Array, #BinarySearch, #Greedy, #PrefixSum Longest Subsequence With Limited Sum

Medium

  1. #Array, #HashTable, #Sorting Group Anagrams
  2. #TwoPointers, #Greedy, #Sorting Pancake Sorting

Week 4

Easy

  1. #Array, #DFS, #BFS, #Matrix Flood Fill
  2. #TwoPointers, #String, #Greedy Valid Palindrome

Medium

  1. #DFS, #BFS, #Union Find, #Matrix Max Area of Island
  2. #Array, #Math, #Matrix Rotate image

Medium but bit more difficult

  1. #Array, #String, #Trie Search Suggestions System

Week 3

Easy

  1. #Array, #DP Pascal's Triagle
  2. #DP, #Memoization, #Array Clibming stairs
  3. #DP, #Array, Best time to buy and sell stock

Medium

  1. #Array, #HashTable, #Greedy, #Sorting, #Heap Reduce array size to the half
  2. #Array, #HashTable, #String Evaluate the bracket pairs of a string
  3. #DFS, #BFS, #Graph, Keys and Rooms
  4. #Array, #HashTable, #String Vowel Spellchecker

Week 2

Easier

  1. #Tree, #BFS, #BinaryTree Invert Binary Tree
  2. #Array, #Hash Table, #Sorting Sort the people
  3. #DFS, #BST Range of Sum BST
  4. #DP N-th Tribonacci Number

Easy

  1. #HashTable, #String, #GreedyAlgorithm Longest palindrome

Medium

  1. #Tree, #BFS, #DFS Time needed to Inform all employees
  2. #HashTable, #Greedy, #Sorting, #Heap #Counting Task Scheduler

Week 1

Easy

  1. #String Reverse words in String III
  2. #Array, #Sorting Third Maximum Number
  3. #Bit manipuation, #Sorting, #HashTable Set Mismatch

Medium

  1. #Linked List, #Simulation Merge node in between zeros
  2. #Tree, #DP Unique binary search trees