Scribd
Upload
8 views2 pages

DSA Python Practice Problems

The document outlines a series of practice problems in Python, categorized into Basic, Intermediate, and Advanced Data Structures and Algorithms (DSA). Each category includes various tasks such as implementing search algorithms, sorting methods, and data structures like linked lists and trees. The problems aim to enhance programming skills and understanding of algorithms and data structures using Python.

Uploaded by

sagarsahil2303
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
8 views2 pages

DSA Python Practice Problems

The document outlines a series of practice problems in Python, categorized into Basic, Intermediate, and Advanced Data Structures and Algorithms (DSA). Each category includes various tasks such as implementing search algorithms, sorting methods, and data structures like linked lists and trees. The problems aim to enhance programming skills and understanding of algorithms and data structures using Python.

Uploaded by

sagarsahil2303
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

NumPy Practice Problems: Basic to Advanced

Basic DSA Problems (Python)

- Implement linear search in a list

- Implement binary search in a sorted list

- Reverse a string without using built-in functions

- Check if a string is a palindrome

- Find the maximum and minimum in a list

- Count the frequency of elements in a list

- Sort a list using bubble sort

- Sort a list using selection sort

- Merge two sorted lists into one sorted list

- Find the factorial of a number using recursion

Intermediate DSA Problems (Python)

- Implement insertion sort

- Implement merge sort

- Implement quicksort

- Find the kth largest element in a list

- Check if two strings are anagrams

- Find the first non-repeating character in a string

- Use a stack to reverse a string

- Implement a queue using two stacks

- Implement a linked list with basic operations

- Detect a cycle in a linked list

Advanced DSA Problems (Python)

- Implement binary search tree (BST) with insert, search, delete

- Find the lowest common ancestor in a BST

- Implement depth-first search (DFS) on a graph

- Implement breadth-first search (BFS) on a graph


NumPy Practice Problems: Basic to Advanced

- Detect cycle in a directed graph using DFS

- Find shortest path using Dijkstra's algorithm

- Solve the knapsack problem using dynamic programming

- Solve longest increasing subsequence problem

- Solve edit distance problem using DP

- Implement LRU Cache using OrderedDict or custom class

- Find all subsets of a set using backtracking

- Solve N-Queens problem using backtracking

- Find articulation points in a graph

- Implement Trie and perform prefix search

- Solve sliding window maximum problem

You might also like