Floyd-Warshall Algorithm, Travelling Salesman Problem 🎭 PsuendoCode Greedy Pattern 💰 ⏰: O(nlogn) 🪐: O(1) Arrays.sort(intervals, (a, b) -> Integer.compare(a[0], b[0])); count = 0, end = Integer.MIN_VALUE;