πŸ“
notes
  • Initial page
  • 02_ds_algo
    • ds
      • Union Find
      • Binary Indexed Tree
      • Stack
      • String
      • Linked List
      • Segment Tree
      • Union Find
      • Union Find
      • Array
      • Tree
      • Hash Table
      • queue
    • algo
      • Backtracking
      • Sort
      • Binary Search
      • Depth First Search
      • Bit Manipulation
      • Dynamic Programming
      • Breadth First Search
      • Two Pointers
      • Math
      • Sliding Window
    • leetcode
      • List
      • 1. Two Sum
      • READEME
      • 2. Add Two Numbers
  • README
    • README
      • pointer
      • effective-cpp
      • roadmap
      • pimpl
      • smartptr
  • 03_cheatsheet
    • README
      • git
      • gdb
    • README
      • bash
      • Python ι€ŸζŸ₯θ‘¨δΈ­ζ–‡η‰ˆ
    • README
      • vim
Powered by GitBook
On this page

Was this helpful?

  1. 02_ds_algo
  2. algo

Breadth First Search

No.

Title

Solution

Difficulty

TimeComplexity

SpaceComplexity

Favorite

Acceptance

0101

Symmetric Tree

Easy

O(n)

O(1)

47.9%

0102

Binary Tree Level Order Traversal

Medium

O(n)

O(1)

56.3%

0103

Binary Tree Zigzag Level Order Traversal

Medium

O(n)

O(n)

49.8%

0107

Binary Tree Level Order Traversal II

Easy

O(n)

O(1)

54.9%

0111

Minimum Depth of Binary Tree

Easy

O(n)

O(1)

39.3%

0126

Word Ladder II

Hard

O(n)

O(n^2)

❀️

23.5%

0127

Word Ladder

Hard

O(n)

O(n)

31.5%

0130

Surrounded Regions

Medium

29.2%

0199

Binary Tree Right Side View

Medium

O(n)

O(1)

55.8%

0200

Number of Islands

Medium

O(n^2)

O(n^2)

48.7%

0207

Course Schedule

Medium

O(n^2)

O(n^2)

44.3%

0210

Course Schedule II

Medium

O(n^2)

O(n^2)

42.3%

0513

Find Bottom Left Tree Value

Medium

62.4%

0515

Find Largest Value in Each Tree Row

Medium

O(n)

O(n)

62.1%

0529

Minesweeper

Medium

60.8%

0542

01 Matrix

Medium

O(n)

O(1)

40.7%

0785

Is Graph Bipartite?

Medium

48.2%

0815

Bus Routes

Hard

43.3%

0863

All Nodes Distance K in Binary Tree

Medium

57.6%

0864

Shortest Path to Get All Keys

Hard

41.6%

0993

Cousins in Binary Tree

Easy

O(n)

O(1)

52.3%

1306

Jump Game III

Medium

62.6%

1319

Number of Operations to Make Network Connected

Medium

55.1%

1654

Minimum Jumps to Reach Home

Medium

26.2%

------------

-------------------------------------------------------

-------

----------------

---------------

-------------

-------------

-------------

PreviousDynamic ProgrammingNextTwo Pointers

Last updated 4 years ago

Was this helpful?