Skip to content

Prepare For Coder Interview – Denny

  • Basic
  • Medium
  • Hard
  • Architect
  • Life

Tag: #dfs

Leetcode: Lowest Common Ancestor of Deepest Leaves

Posted on August 27, 2019September 23, 2019 by braindenny

Lowest Common Ancestor of Deepest Leaves


Continue reading “Leetcode: Lowest Common Ancestor of Deepest Leaves”

Posted in MediumTagged #binarytree, #dfs, heightoftreeLeave a Comment on Leetcode: Lowest Common Ancestor of Deepest Leaves

Leetcode: Reconstruct Itinerary

Posted on August 21, 2019September 23, 2019 by braindenny

Reconstruct Itinerary


Continue reading “Leetcode: Reconstruct Itinerary”

Posted in MediumTagged #backtracking, #dfs, #graphLeave a Comment on Leetcode: Reconstruct Itinerary

Leetcode: All Paths from Source Lead to Destination

Posted on August 18, 2019October 8, 2019 by braindenny

All Paths from Source Lead to Destination


Continue reading “Leetcode: All Paths from Source Lead to Destination”

Posted in MediumTagged #bfs, #classic, #dfs, #graph, redoLeave a Comment on Leetcode: All Paths from Source Lead to Destination

Leetcode: Maximum Level Sum of a Binary Tree

Posted on August 18, 2019September 23, 2019 by braindenny

Maximum Level Sum of a Binary Tree


Continue reading “Leetcode: Maximum Level Sum of a Binary Tree”

Posted in MediumTagged #bfs, #dfs, #graphLeave a Comment on Leetcode: Maximum Level Sum of a Binary Tree

Review: DFS Problems

Posted on August 12, 2019October 4, 2019 by braindenny

Here we try to compile a list of inspiring DFS problems.


Continue reading “Review: DFS Problems”

Posted in ReviewTagged #dfs, reviewLeave a Comment on Review: DFS Problems

Posts navigation

Older posts

Tags

#array #backtracking #bfs #binarytree #bitmanipulation #classic #codetemplate #combination #dfs #dynamicprogramming #game #graph #greedy #heap #inspiring #interval #linkedlist #manydetails #math #misc #palindrome #recursive #slidingwindow #stack #string #subarray #trie #twopointer #twosum baseconversion binarysearch concurrency editdistance hashmap knapsack monotone oodesign presum redo review rotatelist series sql treetraversal unionfind

Recent Posts

  • Leetcode: Palindrome Partitioning III
  • Leetcode: Biggest Single Number
  • Leetcode: Max Consecutive Ones II
  • Leetcode: Minimum Cost to Connect Sticks
  • Leetcode: Minimum Swaps to Group All 1’s Together

Recent Comments

    Archives

    Categories

    • Amusing
    • Basic
    • Easy
    • Hard
    • Life
    • Medium
    • Resource
    • Review
    • Series
    • Uncategorized
    Proudly powered by WordPress | Theme: petals by Aurorum.