🍎
Leetcode
  • README
  • Templates
    • interview_checklist
    • 🥰beauty of python
    • online IDE templates
    • time complexity analysis
  • Data structures
    • bit_operation
    • deque
    • hashtable
    • linked_list
    • priority_queue
      • Arrangement
      • Sort+PQ
    • stack
    • string
    • intervals
    • trie
    • graph
    • tree
  • Algorithm
    • bfs
    • binary_search
    • dfs
    • topological sort
    • dynamic_programming
    • greedy
    • union_find
    • recursion
    • two_pointers
    • Offline processing
  • Other
    • design
    • everything
    • math
  • Company
    • Tree
    • BinarySearch
Powered by GitBook
On this page
  • 1847.Closest-Room (M+)
  • 1707.Maximum-XOR-With-an-Element-From-Array (H-)
  • 1697.Checking-Existence-of-Edge-Length-Limited-Paths (H-)
  1. Algorithm

Offline processing

1847.Closest-Room (M+)

  • https://expl.ai/QFPMRRQ

    • Initially had a thought, but if processing solution in an online fashion, time complexity too much.

    • After taking offline processing into consideration, things become a bit hard in Python because need TreeMap for querying the closest one.

1707.Maximum-XOR-With-an-Element-From-Array (H-)

1697.Checking-Existence-of-Edge-Length-Limited-Paths (H-)

Previoustwo_pointersNextdesign

Last updated 3 years ago