EdocGram
Home
(current)
Topics
EdocAI
Code Editor
HTML
Javascript
PHP
Python
Python AI Code Editor
More
Contact
About
Privacy Policy
Terms and Conditions
Log In
Topic
View
More
Topic
Hashing
Linked List
Queue
Stack
Backtracking
Dynamic Programming
Graph Theory
Bit Manipulation
Mathematics
Sliding Window Technique
Divide And Conquer
Matrix Manipulation
Two Pointers
Tree
Topic: language-problem / Level: advanced
2102. Write a program to implement the Ford-Fulkerson method for computing maximum flow in a flow network.
2103. Write a program to check if a given string is a valid parentheses expression using a stack.
2104. Write a program to find the largest sum of any contiguous subarray using dynamic programming.
2105. Write a program to implement the KMP algorithm for substring search with preprocessing.
2106. Write a program to find the shortest path in a maze using the A* search algorithm.
2107. Write a program to implement a basic memory management system with custom allocators.
2108. Write a program to solve the "Minimum Coin Change Problem" using dynamic programming.
2109. Write a program to find the longest repeated substring in a given string.
2110. Write a program to implement a simple version of the game "Minesweeper."
2111. Write a program to check if a binary tree is a valid binary search tree.
2112. Write a program to find the maximum rectangle area in a binary matrix.
2113. Write a program to implement the Merge Sort algorithm.
2114. Write a program to find all strongly connected components in a directed graph using Tarjan’s algorithm.
2115. Write a program to solve the "Traveling Salesman Problem" using brute force.
2116. Write a program to check if two graphs are isomorphic.
2117. Write a program to implement the Prims algorithm for finding the minimum spanning tree.
2118. Write a program to perform a topological sort of a directed acyclic graph (DAG).
2119. Write a program to implement a basic LRU (Least Recently Used) cache mechanism.
2120. Write a program to find the minimum edit distance between two strings using dynamic programming.
2121. Write a program to implement the quickselect algorithm to find the k-th smallest element in an array.
2122. Write a program to solve the "Eight Queens Problem" using backtracking.
2123. Write a program to implement the bubble sort algorithm with an optimization.
2124. Write a program to find the longest palindromic substring using a center expansion technique.
2125. Write a program to implement a simple version of a command-line calculator.
2126. Write a program to check if a number can be expressed as the sum of two prime numbers.
2127. Write a program to find the number of unique paths in a grid from the top-left to the bottom-right corner.
2128. Write a program to implement the Radix Sort algorithm.
2129. Write a program to find the longest consecutive sequence of elements in an unsorted array.
2130. Write a program to implement the binary search algorithm.
2131. Write a program to find the intersection of two arrays and return the result as a new array.
2132. Write a program to implement the recursive backtracking algorithm for solving Sudoku.
2133. Write a program to check if a graph contains a cycle using DFS.
2134. Write a program to solve the "Subset Sum Problem" using dynamic programming.
2135. Write a program to find the minimum spanning tree using Kruskals algorithm.
2136. Write a program to implement a binary tree with in-order, pre-order, and post-order traversals.
2137. Write a program to find the maximum product of three integers in an array.
2138. Write a program to implement a simple online coding platform for coding challenges.
2139. Write a program to check if a number is a perfect number using its factors.
2140. Write a program to find the sum of the first n Fibonacci numbers using an iterative approach.
2141. Write a program to implement a simple online shopping application with user accounts.
2142. Write a program to check if a string is a valid palindrome considering punctuation and spaces.
2143. Write a program to find the longest common prefix among multiple strings using a trie.
2144. Write a program to implement the depth-first search algorithm for a graph.
2145. Write a program to find the largest product of two non-adjacent numbers in an array.
2146. Write a program to implement the Sieve of Eratosthenes for finding all prime numbers up to a given limit.
2147. Write a program to check if a binary tree is balanced using height checking.
2148. Write a program to find the longest subsequence that is also a palindrome.
2149. Write a program to implement a simple event scheduling application with reminders.
2150. Write a program to find the maximum sum of elements in a subarray of size k.
2151. Write a program to implement a simple online game using a graphical interface.
Previous
2
3
4
...
20
Next
More Levels
Beginner
Intermediate
Aniket The Programmer
This website is managed by aniket the programmer :)
Website
Instagram