Daffodil International University
Judge online · C (gcc / clang)
DIU
ContestHub
C practice · live contests
Problems
Leaderboard
Contests
Log in
Register
Sets
/
Set 3
Set 03
Arrays: Frequency, Min/Max, Search
Seven problems, ramping from Very Easy to Extreme.
Progress · 0/7 solved
Q1
Array Sum
VERY EASY
Q2
Find Maximum
EASY
Q3
Count Occurrences
MEDIUM
Q4
Second Largest (distinct)
MEDIUM-HARD
Q5
Array Has a Pair Summing to K
HARD
Q6
Count Triplets Summing to Zero
VERY HARD
Q7
Longest Subarray with Equal 0s and 1s After K Flips
EXTREME
← Set 2
Set 4 →
Set 3 · Arrays: Frequency, Min/Max, Search · DIU ContestHub