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 find the maximum frequency of elements in a queue after multiple operations.
Problem: Implement a function to find the longest substring that contains exactly k distinct characters using hashing.
Problem: Solve the "Longest Increasing Subsequence with Dynamic Time Constraints on Moves and Penalties" using dynamic programming.
Problem: Implement a function that counts how many binary numbers can be formed with a specific number of leading 1s.
Problem: Design a Greedy algorithm to allocate limited bandwidth across multiple telecommunications networks where each network has varying user demands and data traffic. Maximize network efficiency while minimizing bandwidth congestion.
Problem: Write a function to check if the binary representation of a number is a valid representation of a base-64 number.
Problem: Solve the "Traveling Salesman Problem" using brute force to find all possible routes.
Problem: Implement a function to count the number of paths in a binary search tree that sum to a specific value based on properties.
Problem: Find the longest subarray where all elements are greater than a given number using two pointers.
Problem: Write a program to calculate the sum of all elements divisible by 2 and 7 in the matrix.