Htc

3 questions · 2 experiences · LeetCode (5)

Read our Htc interview guide

5 entries

#787 Cheapest Flights Within K Stops

LeetCode SWE

Question

#787 Cheapest Flights Within K Stops

#509 Fibonacci Number

LeetCode SWE

Question

#509 Fibonacci Number

#118 Pascal's Triangle

LeetCode SWE

Question

#118 Pascal's Triangle

#605 Can Place Flowers

LeetCode SWE

Experience

#605 Can Place Flowers

#1512 Number of Good Pairs

LeetCode SWE

Experience

#1512 Number of Good Pairs

LeetCode Question

#787 Cheapest Flights Within K Stops

SWE coding Medium

Sign in to bookmark Original →

Question Details

LeetCode #787: Cheapest Flights Within K Stops. Difficulty: Medium. Topics: Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path. Asked at HTC in the last 6 months.

Free preview. Unlock all questions →

Topics

Dynamic Programming Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue) Shortest Path

More from Htc

LeetCode #509 Fibonacci Number LeetCode #605 Can Place Flowers LeetCode #118 Pascal's Triangle LeetCode #1512 Number of Good Pairs

View full page →