🔄 Revision Dashboard
Spaced repetition system to reinforce your learning
24problems due for revision
📚 How Revision Works
• Day 2 (1 day elapsed): Revise the problem solved yesterday (Daily Review)
• Day 3 (2 days elapsed): Revise the problem solved 2 days ago (Second Daily Review)
• Day 8 (7 days elapsed): Revise all problems from that week (Weekly Review)
• Day 31 (30 days elapsed): Revise all problems from that month (Monthly Review)
⏰Due Today (24)
Day 9⚠️ OVERDUE (5 days)📅 Solved 5 days ago
Compress String (Run-Length Encoding)
Smart Interviews
import sys
def solve_compress_string():
try:stringtwo-pointersencoding
N/A
Day 8⚠️ OVERDUE (6 days)📅 Solved 6 days ago
Vowels and Consonants
Smart Interviews
import sys
def solve_vowels_consonants():
try:stringset-check
N/A
Day 8⚠️ OVERDUE (6 days)📅 Solved 6 days ago
Letter Coverage (Pangram Check)
Smart Interviews
import sys
def solve_letter_coverage():
try:stringhashingboolean-array
N/A
Day 8⚠️ OVERDUE (6 days)📅 Solved 6 days ago
Digit String Check
Smart Interviews
import sys
def solve_digit_string():
try:stringcharacter-check
N/A
Day 8⚠️ OVERDUE (6 days)📅 Solved 6 days ago
Odd Even Index
Smart Interviews
import java.util.Scanner;
class Solution {
public static void solve_odd_even_index() {...stringindex-logic
N/A
Day 7⚠️ OVERDUE (12 days)📅 Solved this week
Triangle and Pyramid Patterns
Custom
patternsloopssymmetry
O(N²)
Day 7⚠️ OVERDUE (12 days)📅 Solved this week
Half Diamond Pattern
Custom
#include <iostream>
using namespace std;
void solve_half_diamond() {...patternssymmetry
O(N²)
Day 7⚠️ OVERDUE (12 days)📅 Solved this week
Filled and Hollow Rectangle
Custom
patternsloops
O(N*M)
Day 6⚠️ OVERDUE (13 days)📅 Solved this week
Submatrix Sum
Custom/Smart Interviews
import sys
def solve_submatrix_sum():
# Read Nmatrixprefix-sum
O(N²)
Day 6⚠️ OVERDUE (13 days)📅 Solved this week
Lower Triangle Sum
Smart Interviews
import sys
def solve_lower_triangle_sum():
# Read N...matrixindex-logic
N/A
Day 6⚠️ OVERDUE (13 days)📅 Solved this week
Matrix Row and Column Sums
Smart Interviews
import sys
def solve_matrix_sums():
# Set up fast input reading...matrixarraystreaming
O(N*M)
Day 5⚠️ OVERDUE (9 days)📅 Solved this week
Natural Numbers Sum
Smart Interviews
import java.util.Scanner;
class Solution {
public static long sumNaturalNumbers_optimal(long N) {...mathformula
N/A
Day 5⚠️ OVERDUE (9 days)📅 Solved this week
Factorial
Smart Interviews
#include <iostream>
using namespace std;
long long calculateFactorial_iterative(int N) {...mathiterationrecursion
N/A
Day 5⚠️ OVERDUE (9 days)📅 Solved this week
Arithmetic Progression Check
Smart Interviews
import java.util.Scanner;
class Solution {
public static boolean isArithmeticProgression(int[] nums) {...matharraysequence
N/A
Day 5⚠️ OVERDUE (9 days)📅 Solved this week
Arithmetic Operators
Smart Interviews
import java.util.Scanner;
class Solution {
public static void performOperation(int A, int B, char op) {...mathlogicoperator
N/A
Day 5⚠️ OVERDUE (9 days)📅 Solved this week
Triangle Validator
Smart Interviews
import java.util.Scanner;
import java.util.Arrays;
class Solution {...mathgeometrylogic
N/A
Day 4⚠️ OVERDUE (10 days)📅 Solved this week
Number Distribution (Frequency Count)
Smart Interviews
import java.util.Scanner;
import java.util.Map;
import java.util.TreeMap; ...arrayhashingfrequency
N/A
Day 4⚠️ OVERDUE (10 days)📅 Solved this week
Find Duplicate Number in Array
Smart Interviews
import java.util.Scanner;
class Solution {
public static int findDuplicate_optimal(int[] nums) {...arraycycle-detectiontwo-pointers
N/A
Day 3⚠️ OVERDUE (11 days)📅 Solved this week
Odd and Even Sum
Custom
import java.util.Scanner;
class Solution {
public static void calculateOddEvenSum_optimal(int N, Scanner scanner) {...arraytraversalconditional-logic
N/A
Day 3⚠️ OVERDUE (11 days)📅 Solved this week
The Missing Number
Custom
import java.util.Scanner;
class Solution {
public static long findMissingNumber_summation(int[] nums) {...arraymathclever-approach
N/A
Day 3⚠️ OVERDUE (11 days)📅 Solved this week
Max Element in Array
Smart Interviews
import sys
def solve_max_element():
try:arraytraversalsimple-scan
N/A
Day 2⚠️ OVERDUE (12 days)📅 Solved this week
Sparse Arrays
HackerRank
from collections import Counter
from typing import List
# --- Optimized Approach ---...O(N + M)
Day 1⚠️ OVERDUE (13 days)📅 Solved this week
Duplicate Integer
NeetCode 150
from typing import List
class Solution:
# 1. Brute Force Approach: Time O(n^2), Space O(1)...O(n)
Day 1⚠️ OVERDUE (13 days)📅 Solved this week
Two Sum
LeetCode
from typing import List
class Solution:
# 1. Optimized Approach: Time O(n), Space O(n) - Dictionary/Hash Map...O(n)
💡 Revision Tips
- • Try to solve from memory before checking your solution
- • Focus on the approach and pattern, not just memorizing code
- • Write down what you struggled with for next revision
- • If you solved it easily, you've mastered it!