Topic: language-problem / Level: advanced

• 2002. Write a program to implement a binary search tree with insertion, deletion, and traversal operations.
• 2003. Write a program to find the shortest path in a weighted graph using the A* algorithm.
• 2004. Write a program to implement the Dijkstra algorithm for finding the shortest paths from a source node to all other nodes in a graph.
• 2005. Write a program to detect a cycle in a directed graph using depth-first search (DFS).
• 2006. Write a program to implement the QuickSort algorithm with median-of-three pivot selection.
• 2007. Write a program to find the longest increasing subsequence using dynamic programming.
• 2008. Write a program to solve the "N-Queens Problem" using backtracking.
• 2009. Write a program to implement a hash table with separate chaining for collision resolution.
• 2010. Write a program to find the maximum flow in a flow network using the Ford-Fulkerson method.
• 2011. Write a program to implement the Bellman-Ford algorithm for finding shortest paths in a graph with negative weights.
• 2012. Write a program to solve the "Knapsack Problem" using dynamic programming.
• 2013. Write a program to implement the Prims algorithm for finding the minimum spanning tree of a graph.
• 2014. Write a program to perform matrix multiplication using Strassens algorithm.
• 2015. Write a program to find the longest palindromic substring using dynamic programming.
• 2016. Write a program to implement a binary heap and perform insertion and deletion operations.
• 2017. Write a program to perform topological sorting on a directed acyclic graph (DAG).
• 2018. Write a program to implement the KMP algorithm for substring searching.
• 2019. Write a program to solve the "Sudoku Problem" using backtracking.
• 2020. Write a program to implement a trie (prefix tree) for storing strings.
• 2021. Write a program to find the maximum subarray sum using a divide-and-conquer approach.
• 2022. Write a program to implement the Fibonacci heap data structure.
• 2023. Write a program to solve the "0/1 Knapsack Problem" using memoization.
• 2024. Write a program to implement a graph data structure using an adjacency list.
• 2025. Write a program to find the longest common subsequence of two sequences using dynamic programming.
• 2026. Write a program to implement a red-black tree with insertion and deletion operations.
• 2027. Write a program to find the number of connected components in a graph using DFS.
• 2028. Write a program to implement the Aho-Corasick algorithm for multi-pattern string matching.
• 2029. Write a program to solve the "Traveling Salesman Problem" using dynamic programming.
• 2030. Write a program to implement the B-tree data structure for database indexing.
• 2031. Write a program to find the shortest path between two nodes in a maze using BFS.
• 2032. Write a program to implement a basic spell checker using a trie.
• 2033. Write a program to find the minimum spanning tree of a graph using Kruskals algorithm.
• 2034. Write a program to perform a depth-first search on a graph iteratively using a stack.
• 2035. Write a program to implement a basic file system structure using linked lists.
• 2036. Write a program to solve the "Eight Queens Problem" using backtracking.
• 2037. Write a program to implement a simple language interpreter using a parser.
• 2038. Write a program to find the smallest string rotation that is lexicographically smallest.
• 2039. Write a program to implement a simple AI for a game using the minimax algorithm.
• 2040. Write a program to find all strongly connected components in a directed graph using Kosarajus algorithm.
• 2041. Write a program to implement a simple compiler for a basic programming language.
• 2042. Write a program to perform union-find operations on a set of elements.
• 2043. Write a program to implement a basic text-based search engine.
• 2044. Write a program to solve the "Partition Problem" using dynamic programming.
• 2045. Write a program to implement the Floyd-Warshall algorithm for finding shortest paths in a weighted graph.
• 2046. Write a program to find the longest substring with at most k distinct characters using a sliding window approach.
• 2047. Write a program to implement a simple physics simulation using particle systems.
• 2048. Write a program to check if a given string can be formed by concatenating words from a given dictionary.
• 2049. Write a program to implement the Rabin-Karp algorithm for substring searching.
• 2050. Write a program to solve the "Subset Sum Problem" using dynamic programming.
• 2051. Write a program to find the maximum product subarray in an array.

• More Levels

• Beginner
• Intermediate