Aayan
- mui_abk
India- Student
- National Institute of Technology Silchar Assam, India
- No Active Plan. View Details
IndiaRatings System Update
(2024-10-23 22:00:00)None
None
One Stone or Two Stones
Max count of 1, Chef And Adjacent Sums
Unstable Subarray, Masterchef finals, Online or Offline, Largest and Second Largest
Odd GCD Permutation, Chef Odd, Blobby Volley Scores, Bus Seat Numbering, Parking Charges, Maximum Sum Permutation
Break Free, 7 Rings, Problem
CodeChef Streak, Possible or Not
Remove Multiples
Caesar Cipher, Schrodinger Smiley, No Palindrome, Triplets Min, Best of Two
Airport Management, Ball Distribution
Card Swipe, Exclusion-Inclusion
Minimize Xor Difference, Warrior Chef, Lockpicking Chef
Parity Permutation, Light The Bulb, Bit Play, Array Sum
Unique xor, Divisible By 8, Dice Number
Maximise Sum, GCD and LCM
Take it Easy, Spooky Sequences, Dull Operation, Wishcraft
Playing with OR, Save People, Guess the winner!
Adjacent Flips, Rock Paper Scissor, OR Permutation
Clan Expansion, Palindromic Prime Numbers
Minimum XOR, Best of N Sets, Alter Ego
LCM Mania, Prefixing, Beautiful Strings, Reach Codetown
Cursed Indices, 3 Logicians Walk into a Bar, Max Nutrition
Count Distinct Arrays, Minimise Maximum Subarray Sum, Maximum Score , Sum Neq
Rock-Paper-Scissors, Christmas Candy
Greedy LIS Algorithm, A PLUS B Remastered, Decorating Christmas Tree
Chef Product, ORST , Exact Savings, Access Control
Arya In Grid, Transformation Cost, Man of the Match
Maximise Adjacent Sum, Check Adjacent Sum, Minimum And Maximum I, Minimum And Maximum II
ABC Conjecture, Superincreasing, Anti-Triangle
Binary Substring, XOR And Multiply, MEXimize the Array, Disjoint Non-Decreasing Array
Palindromic Substrings, Ballon d Or, ConstructXor
Lexicographically Maximal Prefix AND, Sum of Modes
A power B mod C , TRIPLE PRIMES, Prefix Suffix Inequality, Breezy Mode Problem, Distinct Substring
Sum of N
Pairs Sum with Length x, Chef loves Pizza Chef loves halfs, Array Removal, Number Hunt
Minimise Inversions, Largest K
Maximise Sum, Chef Loves Beautiful Strings (Easy Version)
Equal Pairs (Hard), Replacing Game
Ball Game, Sequence Search
Another Game, Colorful Tree (Easy Version), Xometry (Easy Version), Xometry (Hard Version)
Tree Cut Xor, Count Winning Subarrays, GCD and XOR, Triangle Count (Easy)
GCD to 1 (Hard), Replace With First, Replace With First Literally, Prefix Suffix Min Max
Balance Difficulties, Partition Score
Small, Smaller, Smallest, Normal is Good, Unmedian
We use cookies to improve your experience and for analytical purposes. Read our Privacy Policy and Terms to know more. You consent to our cookies if you continue to use our website.