Python-language-question - Advanced Questions

Topic: Python-language-question / Level: Advanced

401. Write a program to implement the A* algorithm for pathfinding on a grid.
402. Write a program to find the maximum sum rectangle in a 2D matrix.
403. Write a program to implement the K-means clustering algorithm.
404. Write a program to find the longest palindromic substring using Manacher's algorithm.
405. Write a program to calculate the number of unique paths in a grid with obstacles using dynamic programming.
406. Write a program to implement the LRU cache using a doubly linked list and a hash map.
407. Write a program to serialize and deserialize a binary tree using a queue.
408. Write a program to find all strongly connected components in a directed graph using Tarjan's algorithm.
409. Write a program to implement a self-balancing binary search tree (AVL tree).
410. Write a program to implement the Fast Fourier Transform (FFT) algorithm.
411. Write a program to calculate the nth Fibonacci number using matrix exponentiation.
412. Write a program to find the minimum spanning tree of a graph using Prim's algorithm.
413. Write a program to implement the KMP string matching algorithm.
414. Write a program to find the maximum flow in a flow network using the Edmonds-Karp algorithm.
415. Write a program to implement a trie data structure and perform insert and search operations.
416. Write a program to solve the N-Queens problem using backtracking.
417. Write a program to find the longest increasing subsequence using binary search.
418. Write a program to implement the Bellman-Ford algorithm for finding shortest paths in a graph.
419. Write a program to find the shortest path in an unweighted graph using BFS.
420. Write a program to implement a bloom filter.
421. Write a program to perform a topological sort on a directed acyclic graph (DAG).
422. Write a program to calculate the edit distance between two strings using dynamic programming.
423. Write a program to implement the Ford-Fulkerson method for computing maximum flow.
424. Write a program to solve the knapsack problem using dynamic programming.
425. Write a program to implement a binary search tree with insert, delete, and search functions.
426. Write a program to find the longest common subsequence between two strings using dynamic programming.
427. Write a program to perform integer factorization using Pollard's rho algorithm.
428. Write a program to implement the sieve of Eratosthenes to generate prime numbers.
429. Write a program to find the next permutation of a sequence of numbers.
430. Write a program to calculate the least common multiple (LCM) of two numbers.

Previous
1
2
3
4
5
6
7
Next

More Levels
Beginner
Intermediate

Most Visited

Write a program to check whether a number is even or odd. Write a program to find the longest sequence of consecutive numbers in a list. Write a program to implement the min-heap and max-heap data structures. Write a program to find the common characters in two strings. Write a program to find the longest path in a binary tree. Write a program to find the longest valid parentheses substring. Write a program to find the largest of three numbers. Write a program to find the longest substring with at most two distinct characters. Write a program to implement a simple file search application. Write a program to calculate the factorial of a number using iteration. Write a program to calculate the factorial of a number using loops. Write a program to perform a depth-first search in a maze represented as a graph. Write a program to calculate the number of unique paths in a grid with obstacles using dynamic programming. Write a program to generate a random password with letters and digits. Write a program to calculate the factorial of a number.