Scribd
Upload
3 views

DSA_Problem_Tracker

The document lists a total of 36 programming problems categorized by difficulty: Easy (6), Medium (12), and Hard (18), all of which are currently marked as INCOMPLETE. It highlights that no problems have been completed yet, resulting in a 0% completion rate. The document serves as a progress tracker for problem-solving tasks.

Uploaded by

dhanushmahadevswamy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
3 views

DSA_Problem_Tracker

The document lists a total of 36 programming problems categorized by difficulty: Easy (6), Medium (12), and Hard (18), all of which are currently marked as INCOMPLETE. It highlights that no problems have been completed yet, resulting in a 0% completion rate. The document serves as a progress tracker for problem-solving tasks.

Uploaded by

dhanushmahadevswamy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Week Problem Difficulty Status

1 Find maximum element in an array Easy INCOMPLETE


1 Find minimum element in an array Easy INCOMPLETE
1 Reverse an array Easy INCOMPLETE
2 Reverse a string Easy INCOMPLETE
2 Remove duplicates from sorted array Easy INCOMPLETE
2 Find first non-repeating character in a string Easy INCOMPLETE
3 Search in rotated sorted array Medium INCOMPLETE
3 Bubble Sort Medium INCOMPLETE
3 Selection Sort Medium INCOMPLETE
4 Find middle element of linked list Medium INCOMPLETE
4 Merge two sorted arrays Medium INCOMPLETE
4 Find kth largest element in an array Medium INCOMPLETE
5 Longest substring without repeating characters Medium INCOMPLETE
5 Find anagram indices in a string Medium INCOMPLETE
5 Find longest palindrome substring Medium INCOMPLETE
6 Find the number of platforms required for a railway station Medium INCOMPLETE
6 Find subarrays with given sum Medium INCOMPLETE
6 Minimum window substring Medium INCOMPLETE
7 Implement stack using queues Hard INCOMPLETE
7 Level Order Traversal of a Binary Tree Hard INCOMPLETE
7 Kth smallest element in BST Hard INCOMPLETE
8 Find diameter of a binary tree Hard INCOMPLETE
8 Implement heap from scratch Hard INCOMPLETE
8 Sort a binary heap Hard INCOMPLETE
9 Solve N-Queens problem Hard INCOMPLETE
9 0/1 Knapsack problem Hard INCOMPLETE
9 Longest increasing subsequence Hard INCOMPLETE
10 Detect cycle in a graph using DFS Hard INCOMPLETE
10 Find connected components in a graph Hard INCOMPLETE
10 Topological sort of a graph Hard INCOMPLETE
11 Find all permutations of a string Hard INCOMPLETE
11 Sudoku solver Hard INCOMPLETE
11 Word ladder problem Hard INCOMPLETE
12 Longest common subsequence Hard INCOMPLETE
12 Find all subsets of a set Hard INCOMPLETE
12 Find shortest path in an unweighted graph Hard INCOMPLETE
Total Problem completed 0 Total completi
Total Number of Problems 36
Percentage of Completion 0%

Total Number of easy Questions 6


solved 0

Total Number of Medium Questions 12


solved 0
100%
Total Number of hard Questions 18
solved 0

Medium Easy

Total Number of
Medium Questions
solved

100% 100%
Total completion

Total Problem
completed
Total Number of Prob-
lems

100%

Easy

Total Number of easy


Questions
solved

100%

You might also like