Python Data Structures & Algorithms + LEETCODE Exercises - DSA for Cracking the Coding Interview. Animated Examples for Faster Learning and Deeper Understanding.
Preview this Course
Sure, I can provide you with a brief overview of Python data structures and algorithms, and then suggest some LeetCode exercises.
**Python Data Structures:**
1. **List**: A list in Python is a collection of items which can be of different types. It is an ordered sequence of items.
2. **Tuple**: A tuple is similar to a list but it is immutable, which means we cannot change the elements of a tuple once it is assigned.
3. **Dictionary**: A dictionary in Python is an unordered collection of items. Each item of a dictionary has a key/value pair.
4. **Set**: A set is an unordered collection of items where every item is unique.
1. **Sorting Algorithms**: Bubble Sort, Merge Sort, Insertion Sort, Quick Sort, etc.
2. **Searching Algorithms**: Linear Search, Binary Search.
3. **Tree Traversal Algorithms**: Pre-order, In-order, Post-order.
4. **Graph Algorithms**: Depth First Search, Breadth First Search, Dijkstra's Algorithm, etc.
1. **Two Sum**: Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
2. **Add Two Numbers**: You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.
3. **Longest Substring Without Repeating Characters**: Given a string s, find the length of the longest substring without repeating characters.
4. **Median of Two Sorted Arrays**: Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
5. **Longest Palindromic Substring**: Given a string s, return the longest palindromic substring in s.
Remember, the key to mastering data structures and algorithms is practice. Try to solve as many problems as you can.