Hello Everyone ,Welcome To
EdocGram

Hey, I am Aniket Kumar, the founder of EdocGram. I have created a collection of 35K+ coding problems related to DSA and basic concepts. All the problems are absolutely free for everyone. The platform also includes a chat system to connect with your friends. Log in to the website to enjoy its full functionality!.


Search Problem


All Topics

Array

An array is a data structure that holds multiple elements of the same type in sequence, allowing efficient indexing and manipulation.

Beginner Intermediate Advanced
Tree

A binary tree is a tree data structure where each node has at most two children.

Beginner Intermediate Advanced

Language

C is a powerful general-purpose programming language that provides low-level access to memory.

Beginner Intermediate Advanced
Greedy Algorithm

Greedy algorithms make locally optimal choices to solve optimization problems.

Beginner Intermediate Advanced

Hashing

Hashing transforms input data into a fixed-size string, allowing efficient data retrieval.

Beginner Intermediate Advanced
Linked List

A linked list allows efficient insertion and deletion operations compared to arrays.

Beginner Intermediate Advanced

Queue

A queue follows the First In First Out (FIFO) principle.

Beginner Intermediate Advanced
Stack

A stack follows the Last In First Out (LIFO) principle.

Beginner Intermediate Advanced

Backtracking

Backtracking incrementally builds candidates to the solutions and abandons candidates that fail to satisfy the constraints.

Beginner Intermediate Advanced
Dynamic Programming

Dynamic programming breaks problems into simpler subproblems and stores results to avoid redundant computations.

Beginner Intermediate Advanced

Graph Theory

Graph theory studies graphs, which model pairwise relations between objects.

Beginner Intermediate Advanced
Bit Manipulation

Bit manipulation performs operations on binary representations of integers for efficiency.

Beginner Intermediate Advanced

Some Random Problems


Problem: Implement a function that finds the first missing positive integer from an unsorted array.
Problem: Write a program to calculate the covariance of two datasets using matrices.
Problem: Given an array, find all pairs whose product is divisible by a prime number using two pointers.
Problem: Write a program to find the number of spanning trees in a bipartite graph.
Problem: Write a program to implement a queue for managing task assignments.
Problem: Implement a function that counts how many binary strings can be formed with an even number of leading bits.
Problem: Solve the "Minimum Path Cost in a Grid with Obstacles and Varying Penalties" problem using dynamic programming.
Problem: Write a divide and conquer algorithm to find the maximum distance between any two points in a set of points.
Problem: Given an array of integers, find the number of distinct subarrays where the sum of elements is equal to their index product.
Problem: Print all valid configurations for a seating arrangement based on guest preferences and table sizes.