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: Solve the "Word Break IV" problem where you find all valid sentences from a given dictionary using dynamic programming.
Problem: Implement a function to find the maximum path sum in a binary search tree based on properties.
Problem: Write a program to check if a matrix is a diagonal matrix.
Problem: Implement a divide and conquer approach to find the "Longest Palindromic Substring" in a string.
Problem: You are given a list of jobs with deadlines and durations. Maximize the number of jobs that can be completed before their deadlines.
Problem: Write a program to push the elements of a binary trees preorder traversal into a stack.
Problem: Implement a function to reverse the first n nodes of a doubly linked list while preserving the relative order of the remaining nodes.
Problem: Design a Greedy algorithm to allocate space on a satellite where each experiment has different space and resource requirements. Maximize the number of experiments conducted while minimizing unused space.
Problem: Write a program to implement the k-modes algorithm for categorical data clustering using matrices.
Problem: How do you delete the node at the second position in a circular singly linked list?