Skip to content

Prepare For Coder Interview – Denny

  • Basic
  • Medium
  • Hard
  • Architect
  • Life

Review: Segment Tree Problems

Posted on January 24, 2018September 19, 2019 by braindenny

Review Segment Tree code problems



Scenarios

Name Summary
Segment tree: solves range query problems quickly find min, max, sum, gcd, lcd in array with O(log(n)) time complexity
  • CheatSheet: Leetcode For Code Interview

See all segmenttree problems: segmenttree

  • Review: Segment Tree Problems
  • Leetcode: Range Sum Query – Mutable

See more blog_posts.

linkedin
github
slack

Post Views: 8
Posted in ReviewTagged review, segmenttree

Post navigation

Leetcode: Flood Fill
Leetcode: Integer to English Words

Leave a Reply Cancel reply

Your email address will not be published.

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 editdistance hashmap knapsack monotone oodesign presum redo review rotatelist series sql topologicalsort 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.