0% found this document useful (0 votes)
14 views5 pages

LeetCode Python Algorithms Guide

The document outlines various algorithmic techniques and data structures relevant for coding challenges on LeetCode. Key topics include sorting algorithms like Quick Sort and Merge Sort, search algorithms such as BFS and DFS, and advanced techniques like Two Pointers and Sliding Window. It also mentions the Disjoint Set Union (Union-Find) as a crucial concept.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views5 pages

LeetCode Python Algorithms Guide

The document outlines various algorithmic techniques and data structures relevant for coding challenges on LeetCode. Key topics include sorting algorithms like Quick Sort and Merge Sort, search algorithms such as BFS and DFS, and advanced techniques like Two Pointers and Sliding Window. It also mentions the Disjoint Set Union (Union-Find) as a crucial concept.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

■■■■■■■■■ ■ ■■■■■■■■■ ■■■■■■ ■■■ LeetCode ■■

Python

1. ■■■■■■■■ ■■■■■

2. ■■■■■■■ ■■■■■■■■■■ (Quick Sort)

3. ■■■■■■■■■■ ■■■■■■■■ (Merge Sort)


4. ■■■■■ ■■■■■: BFS ■ DFS
5. ■■■■■■■■ ■■■■■■■■
6. ■■■ ■■■■■■■■■ (Two Pointers) — ■■■■■■ Two Sum II

7. ■■■■■■■■■■ ■■■■ (Sliding Window) — ■■■■■■ Max Subarray Sum


8. ■■■■■■■■■■■■ ■■■■■■■■■■■■■■■■ — Climbing Stairs

9. Disjoint Set Union (Union-Find)

You might also like