วีดีโอ

while l smaller than r: mid = (l r 1)//2 pos = rabin_karp(mid) if pos != - 1: l = mid start = pos else: r = mid - 1 start = rabin_karp(l) return "" if start -1 else s[start: start l] you guys can use this rather than the weird-ass binary search function im using in the video

Leetcode 1405. Longest Happy String || Priority Queue || Greedy

Leetcode 632. Smallest Range Covering Elements from K Lists || Sliding window

Leetcode 403. Frog Jump || BFS

Leetcode 1301. Number of Paths with Max Score - Dynamic Programming

Leetcode 2454. Next Greater Element IV || Monotonic Stack || Priority Queue

Leetcode 817. Linked List Components|| LinkedList || UnionFind

Leetcode 564. Find the Closest Palindrome || Binary Search - The most difficult daily challenge?

Leetcode 732. My Calendar III || Sweepline Algorithm

Leetcode 2251. Number of Flowers in Full Bloom || Priority Queue

Leetcode 895. Maximum Frequency Stack - Priority Queue

Leetcode 1851. Minimum Interval to Include Each Query || Priority Queue

1368. Minimum Cost to Make at Least One Valid Path in a Grid || Graph || Dijkstra || Shortest path

Solving some hard DSU - Union Find leetcode problem

Leetcode 1298. Maximum Candies You Can Get from Boxes - BFS

Leetcode 1319. Number of Operations to Make Network Connected - Union Find || BFS/DFS

Leetcode 207 - Course Schedule - Topological Sort

Leetcode 1568 Minimum Number of Days to Disconnect Island - BFS|Graph

Leetcode 1383 - Maximum Performance of a Team - Priority queue

Leetcode 1425 Constrained Subsequence Sum - DP Monotonic Queue

Leetcode 2931 Maximum Spending After Buying Items - Priority Queue

Leetcode 515 - Find Largest Value in Each Tree Row - BFS

Leetcode 1793 Maximum Score of a Good Subarray - Monotonic Stack

Leetcode 410 - Split Array Largest Sum - Binary Search

20 tháng 4, 2023