Devanshu Takkar
- d_takkar
India- Student
- Indian Institute Of Technology, Roorkee
- No Active Plan. View Details
IndiaRatings System Update
(2024-10-09 22:00:00)Ratings System Update
(2022-12-20 00:00:00)None
None
Interior Design, The Last Levels, Easy Pronunciation, Yet Another Palindrome Making Problem, True and False Paper
Buy Lamps, Fill The Grid, Passes for Fair, Fill Candies, Make Palindrome 2
Maximize Difference, Concat Sort, Chef in his Office, To Divide or Not To Divide, Sum of Product 1, Hungry Chef
Break the elements, Remove Bad elements
Distinct Numbers, Red Green Grids, Yet Another Palindrome Problem, Paper Cutting, Palindrome Flipping, Card Removal
Minimise LCS, Weird Subarrays, Subarray Removal
Joint XOR, Sorted Substrings, Make Multiple, Final Sum, Pythagorean Pair
Boring String, XOR Product, Expense List, Make Money
Akash and Dinner, Distinct Sequence
Pet Store, Flip the Prefix
Divisible by A_i, Gcd of Subarrays, Maximise XOR
N Triplets, No sequence
Find an integer, Consecutive Xor, Append for OR
Lcm hates Gcd, Minimal Inversions, Odd Even Binary String
Concat Palindrome, K Increment Palindrome, Three Numbers
Make Them Alike, Make A-B Same, Difference Matrix, MIN To MAX
Crazy Bishops on Chessboard, Efficient PAN Linking, Inside The Stadium, GCD Queries, TripTastic
Crushed Apples and a Balance Scale, Sum of Goodness, Printing Binary Array, Anti Palindrome
Swap the numbers, Mex Array, Remove Multiples
Minimize Xor Difference, Warrior Chef
Spooky Sequences, Dull Operation, Wishcraft
Maximal Expression, Adjacent Flips, OR Permutation
Minimum XOR, Chef Lost an Array, Alter Ego, Chroma Swap, Rigged Game
Marbles, Am I Lucky!, Monsters, Tetris
LCM Mania, Prime Range Game, Beautiful Strings
Chef Product, ORST , Exact Savings
Equality Etiquette, Not Prime Permutation
Subset GCD, Count Substrings, Join States, Is it uniquely decodable, Xorry 2, Xorry 1
K Odd Sum, Unalike Gcd & Lcm
Find Permutation , Construct Permutation, Count Subarrays, Count Arrays
Minimum And Maximum I, Yet Another Alice Bob Game, Trial of the Conqueror, Minimum And Maximum II
Palindromic Substrings
Sum of Modes
Double Trouble
A power B mod C , TRIPLE PRIMES, Prefix Suffix Inequality, Breezy Mode Problem, Distinct Substring
Minimise Inversions, Largest K
Beautiful Array, Make Bob Win , Square String
Bouncing Ball, Permutation Construction
Double Trouble, Beautiful Flip, The Undisappearance
Maximise Sum, Chef Loves Beautiful Strings (Hard Version), Chef Loves Beautiful Strings (Easy Version)
Completion (Hard), Maximize Hamming Distance, Completion (Easy), Anti-Palindrome Queries
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, Array Concatanation
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.