Know Thyself
  • Blogs
  • Outlines
    Algorithms Projects Coding Reading Essays
  • About Me
  • Search

Understanding


This is where I write down drafts for learning

994. Rotting Oranges

Easy

Posted on October 2, 2019

In a given grid, each cell can have one of three values: [Read More]
Tags: Coding LeetCode BFS

暗时间

刘未鹏

Posted on September 26, 2019

点评: ★★★★★ [Read More]
Tags: Thinking

993. Cousins in Binary Tree

Posted on September 24, 2019

In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1. [Read More]
Tags: Coding LeetCode

785. Is Graph Bipartite?

Posted on September 23, 2019

Given an undirected graph, return true if and only if it is bipartite. [Read More]
Tags: Coding LeetCode DFS BFS

559. Maximum Depth of N-ary Tree

Posted on September 23, 2019

Given a n-ary tree, find its maximum depth. [Read More]
Tags: Coding LeetCode DFS BFS

429. N-ary Tree Level Order Traversal

Posted on September 23, 2019

Given an n-ary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). [Read More]
Tags: Coding LeetCode DFS BFS
  • ← Newer Posts
  • Older Posts →
  • RSS
  • Email me
  • Facebook
  • GitHub
  • Twitter

gitlinux  •  2022

Total views.