Skip to content

Latest commit

 

History

History
 
 

example

README.md

Order

Better order to solve problems

Lists

0.ArraaysHash

  1. Two sum
  2. Two Integer Sum II
  4. Contains Duplicate
  5. Valid Anagram
  6. Group Anagrams
  7. Top K Frequent Elements
  8. Encode Decode
  9. Product of Array Except Self
  10. Valid Sudoku
  11. Longest Consecutive Sequence

1.TwoPointers

  1. Reverse string leetcode
  2. Valid Palendrom
  3. 3sum
  4. Squares of a sorted Array
  5. Container With Most Water
  6. Remove duplicates
  7. Move Zeroes
  8. Ls Subseq
  9. Backspace String compare
  10. Merge sorted Array
  12. Trapping Rain Water

2.SlidingWindow

  1. Maximum Average Subarray
  2. Minimum size Subarray Sum
  3. Max Consecutive One iii
  4. Longest Subarray of 1s After Deleting One Element
  5. Fruit Into Baskets
  7. Best Time to Buy and Sell Stock
  8. Longest Repeating Character Replacement
  9. Permutation in String
    1. Minimum Window Substring
    1. Sliding Window Maximum

3.Linked list

  1. Design Linked List
  2. Middle of the Linked List
  3. Delete the Middle Node of a Linked List
  4. Reverse Linked List
  5. Palindrome Linked List
  6. Remove Duplicates from Sorted List
  7. Remove Nth Node from End of List
  8. Swap Nodes in Pairs
  9. Merge Two sorted Lists
  10. Linked List Cycle
  12. Reorder List
    1. Copy List with Random Pointer
  1. Add Two Numbers
  2. Find the Duplicate Number
    1. Merge k Sorted Lists
    1. Reverse Nodes in k-Group
  2. Add Two Numbers II

4.Binary Search

  1. Binary Search
    1. Search a 2D Matrix
    1. Koko Eating Bananas
    1. Find Minimum in Rotated Sorted Array
    1. Search in Rotated Sorted Array
    1. Time Based Key-Value Store
    1. Median of Two Sorted Arrays

HashMap

  1. Design Hash map

LRU Cache

  1. LRU Cache

Stack, Queue

  1. Valid Parentheses
  2. Remove All Adjacent duplicates in String
  3. Removing Stars From a string
  4. Simplify Path
    1. Number of Recent Calls
    1. Min Stack
    1. Evaluate Reverse Polish Notation
  1. Generate Parentheses
    1. Daily Temperatures
    1. Car Fleet
    1. Largest Rectangle in Histogram

Binare Tree, DFS

  1. Maximum Depth of Binary Tree
  2. Invert Binary Tree
  3. Symmetric Tree
  4. Same Tree
  5. Path sum

Binary Search Tree

  1. Search in a Binary search tree
  2. Insert into a Binary search tree
  3. Validate Binary Search tree (нужно следить за диапозоном хранимых/возможным значений)
  4. Balanced Binary tree

Binary Tree, BFS

  1. Binary Tree Level Order Traversal
  2. Find Largest Value in Each Tree Row
  3. Binary Tree Right Side View
  4. Populating Next Right Pointers in Each Node ii
  5. Delete Leaves With a Given Value
  6. Deepest Leaves Sum
  7. Diameter of Binary Tree (104 task)
  8. Binary Tree Zigzag level Order Traversal
  9. Lowest Common Ancestor of a Binary tree
  11. Subtree of Another Tree
  12. Count Good Nodes in Binary Tree
  13. Kth Smallest Element in a BST
  14. Construct Binary Tree from Preorder and Inorder Traversal
  15. Binary Tree Maximum Path Sum
  16. Serialize and Deserialize Binary Tree

Trie, Autocomplete

  1. Implement trie
  2. Search suggestion system
  4. Design Add and Search Words Data Structure
  5. Word Search II

Heap Pt.1

  1. Kth Largest Element in an Array (минхипа максхипа)
  2. Kth Largest Element in a Stream
  3. Top K Frequent Elements
  4. Sort Characters By Frequency

Heap Pt.2

  1. Last stone Weight
  2. IPO
  3. Find Median from Data Stream
  4. Remove stones to minimize the total
  5. Merge k sorted Lists
  6. Design Search Autocomplete System
  8. K Closest Points to Origin
  9. Task Scheduler
  10. Design Twitter

Intervals

  1. Meeting Rooms (сортировать по дате начала митинга)
  2. Merge Intervals
  3. Insert Intervals
  4. Meeting Rooms ii
  6. Non-overlapping Intervals
  7. Minimum Interval to Include Each Query

Graphs Workshop

  1. Open the lock
  2. Minimum Genetic Mutation
  3. Detonation the Maximum Bombs
  4. Keys and rooms
  5. Find if path Exists in Graph
  6. clone graph
  7. Minimum number of Vertices to Reach All Nodes

Graphs Workshop 2

  1. Number of Connected components in an Undirected Graph (547. none premium)
  2. Number of Islands
  3. Reorder Routes to Make All Paths Lead to the City Zero
  4. Max Area of island
  5. Reachable Nodes with restrictions
  6. 01 Matrix
  7. Rotting oranges
  8. Shortest Path with Alternating Colors
  9. Nearest Exit from Entrance in Maze
  10. Shortest path in Binary Matrix
  11. Minimum Genetic mutation (752.)

Dijkstra

  1. Network delay time
  2. Path with maximum Probability
  3. Cheapest Flights Within K Stops

Topological sort Pt.1

  1. Find all possible Recipes from given Supplies

Topological sort Pt.2

  1. Course Schedule
  2. Course Schedule ii
  3. Parallel Courses

Backtracking Pt.1

  1. Permutations
  2. Combinations
  3. Subsets
  4. Generate Paretheses

Backtracking Pt.2

  1. Combination Sum iii
  2. letter combinations of a phone number
  3. N-Queens
  4. Robot room cleaner

Dynamic Programming Pt.1

  1. Fibonacci Number
  2. Climbing Stairs
  3. Min Cost Climbing Stairs
  4. Coin Change
  5. House Robber

Dynamic Programming Pt.2

  1. Decode ways
  2. Unique paths
  3. Minimum path sum
  4. Edit Distance

Greedy

Advanced Graphs

Bit Manipulation

Math & Geometry

Blind 75 by BFE

  1. Find All Duplicates in an Array
  2. End of Array Reachable
  3. Maximum Sum in Contiguous Array

Programming skills

0.Basic

  1. Merge Strings Alternately
  2. Find the Difference
  3. Find the Index of the First Occurrence in a String
  4. Repeated Substring Pattern
  5. Plus One

0.Basic

  1. Length of Last Word
  2. Robot Bounded In Circle
  3. Matrix Diagonal Sum

30 Days of JavaScript

  1. Create Hello World Function

  2. Counter

  3. To Be Or Not To Be

  4. Counter II

  5. Apply Transform Over Each Element in Array

  6. Filter Elements from Array

  7. Array Reduce Transformation

  8. Function Composition

  9. Allow One Function Call

  10. Memoize

  11. Chunk Array

  12. Group By

  13. Sort By

  14. Join Two Arrays by ID

  15. Flatten Deeply Nested Array

  16. Compact Object

Strong List

  1. Depth-First Search (DFS)

  2. 79 - Word Search

  3. 200 - Number of Islands

  4. 695 - Max Area of Island

  5. 463 - Island Perimeter

  6. 733 - Flood Fill

  7. 130 - Surrounded Regions

  8. 417 - Pacific Atlantic Water Flow

  9. 261 - Graph Valid Tree

  10. 329 - Longest Increasing Path in a Matrix

  11. 688 - Knight Probability in Chessboard

  12. 332 - Reconstruct Itinerary

  13. 1306 - Jump Game III

  14. Breadth-First Search (BFS)

  15. 286 - Walls and Gates

  16. 542 - 01 Matrix

  17. 994 - Rotting Oranges

  18. 752 - Open the Lock

  19. 127 - Word Ladder

  20. 934 - Shortest Bridge

  21. 1466 - Reorder Routes to Make All Paths Lead to the City Zero

  22. 1162 - As Far from Land as Possible

  23. 815 - Bus Routes

  24. 1197 - Minimum Knight Moves

  25. 1091 - Shortest Path in Binary Matrix

  26. 1293 - Shortest Path in a Grid with Obstacles Elimination

  27. Topological Sort

  28. 207 (Course Schedule)

  29. 210 (Course Schedule II)

  30. 1136 (Parallel Courses)

  31. 310 (Minimum Height Trees)

  32. 444 (Sequence Reconstruction)

  33. 269 (Alien Dictionary)

  34. 802 Find Eventual Safe States

  35. 1203 Sort Items by Groups Respecting Dependencies

  36. 1192 Critical Connections in a Network (Tarjan's Algorithm)

  37. Dijkstra's Algorithm

  38. 743 - Network Delay Time

  39. 1334 - Find the City With the Smallest Number of Neighbors at a Threshold Distance

  40. 1514 - Path with Maximum Probability

  41. 1631 - Path With Minimum Effort

  42. 778 - Swim in Rising Water

  43. 1786 - Number of Restricted Paths From First to Last Node

  44. 787 - Cheapest Flights Within K Stops 8 882 - Reachable Nodes In Subdivided Graph

  45. 1368 - Minimum Cost to Make at Least One Valid Path in a Grid

  46. 1791 - Minimum Number of Refueling Stops

  47. Union-Find (Disjoint Set Union)

  48. 547 - Number of Provinces

  49. 684 - Redundant Connection

  50. 721 - Accounts Merge

  51. 1584 - Min Cost to Connect All Points

  52. 990 - Satisfiability of Equality Equations

  53. 1319 - Number of Operations to Make Network Connected

  54. 1202 - Smallest String With Swaps

  55. 1632 - Rank Transform of a Matrix

  56. Floyd-Warshall / All-Pairs Shortest Path

  57. 1462 - Course Schedule IV

  58. 785 (Is Graph Bipartite?)

  59. 886 (Possible Bipartition)

  60. 1617 (Count Subtrees With Max Distance Between Cities)

  61. 1125 (Smallest Sufficient Team)

Ru companies

Anagramms, Math, Simple nums
  1. Valid Anagram
  2. Group Angagrams
  3. Count Primes
  4. Reverse Integer
  5. Single Number
  6. Single Number ii
ArraaysHash (Prefix sum)

Uni

Jandex

Oz

ArraaysHash
  1. Sum
  2. Valid Sudoku
  3. Isomorphic Strings
  4. Line reflection
  5. Lru Cache
  6. Find the Prefix Common
TwoPointers
  1. Squares of a sorted Array
  2. Move Zeroes
  3. Valid Palendrom
  4. Two Integer Sum II
  5. One Edit Distance
SlidingWindow
  1. Summary Ranges
  2. Max Consecutive Ones
  3. Longest...
  4. Maximize Distance to closest person
  5. String Compression
Linked list

Сбебс

  1. Remove Nth Node from End of List
  2. Reorder List
  3. Merge k Sorted Lists

Jandex

  1. Reverse Linked List
  2. Palindrome Linked List

Uni

  1. Middle of the Linked List
  2. Reorder List
Binary Search
  1. Binary Search
  2. Peak Index in a Mountain Array
  3. Search in Rotated Sorted Array
  4. Find First and Last Position of Element in Sorted Array
  5. Search a 2D Matrix
  6. Sqrt(x)
  7. Find K Closesest Elements
Stack, Queue
  1. Valid Parentheses
  2. Minimum Remove to Make Valid Parentheses
  3. Daily Temperatures
  4. Sort an Array
Binare Tree

Uni

  2. Binary Tree Right Side View

Jandex

  1. Binary Tree Level Order Traversal
    1. Symmetric Tree
  1. Same Tree
  2. Path sum
Heap
  1. Kth Largest Element in an Array
  2. Top K Frequent Elements (не отсортирован)
  3. Sort an Array
Intervals

Uni

  1. Merge Intervals
  2. Meeting Rooms
  3. Car pooling
  4. Minimum Number of Arrows to Burst Balloons
  5. Top K Frequent Elements (не отсортирован)

Avi

  1. Add Two Numbers
Graphs
  1. Unique paths
  2. Unique paths ii
  3. Minimum Path Sum
  4. Number of Islands
  5. Course Schedule
  6. Course Schedule ii
  7. Surronded Regions
  8. Max Area of Island
  9. Shortest path in Binary Matrix
Backtracking
  1. letter combinations of a phone number
  2. Permatations
  3. N-Queens
  4. Generate Parentheses

classic

Array
  1. Remove Duplicates from Sorted Array
  2. Best Time to Buy and Sell Stock II
  3. Rotate Array
  4. Contains Duplicate
  5. Single Number
  6. Intersection of Two Arrays II
  7. Plus One
  8. Move Zeroes
  9. Two Sum
  10. Valid Sudoku
  11. Rotate Image
String
  1. Reverse String
  2. Reverse Integer
  3. First Unique Character in a String
  4. Valid Anagram
  5. Valid Palindrome
  6. String to Integer (atoi)
  7. Implement strStr()
  8. Longest Common Prefix
Linked list
  1. Delete Node in a Linked List
  2. Remove Nth Node From End of List
  3. Reverse Linked List
  4. Merge Two Sorted Lists
  5. Palindrome Linked List
  6. Linked List Cycle
Trees
  1. Maximum Depth of Binary Tree
  2. Validate Binary Search Tree
  3. Symmetric Tree
  4. Binary Tree Level Order Traversal
  5. Convert Sorted Array to Binary Search Tree
Sorting and Searching
  1. Merge Sorted Array
  2. First Bad Version
Dynamic Programming
  1. Climbing Stairs
  2. Best Time to Buy and Sell Stock
  3. Maximum Subarray
  4. House Robber
Design
  1. Shuffle an Array
  2. Min Stack
Math
  1. Fizz Buzz
  2. Count Primes
  3. Power of Three
  4. Roman to Integer
Other
  1. Number of 1 Bits
  2. Hamming Distance
  3. Reverse Bits
  4. Pascal's Triangle
  5. Valid Parentheses
  6. Missing Number