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: Write a program to compute the AUC-ROC score using the confusion matrix.
Problem: Implement a function to remove the last node from a circular singly linked list.
Problem: Write a function to find the total number of unique words in a given text using hashing.
Problem: Write a program to print all the elements in the second diagonal in reverse order.
Problem: Find the minimum number of swaps needed to sort an array using the greedy approach.
Problem: Write a function to rearrange nodes in a doubly linked list such that all even-positioned nodes come before odd-positioned nodes.
Problem: Write a program to perform time series forecasting using Holt-Winters method with matrices.
Problem: Implement an algorithm to check if a bipartite graph is 2-colorable.
Problem: Create a function to find the maximum width of a binary search tree at any level using properties.
Problem: Check if two arrays are permutations of each other using two pointers.