Prime Dates
In this challenge, the task is to debug the existing code to successfully execute all provided test files. Given two dates each in the format dd-mm-yyyy, you have to find the number of lucky dates between them (inclusive). To see if a date is lucky, Firstly, sequentially concatinate the date, month and year, into a new integer erasing the leading zeroes. Now if x is divisible by either 4 or 7, then we call the date a lucky date. For example, let's take the date "02-08-2024". After con
View Solution →Minimum Operations
In this challenge, the task is to debug the existing code to successfully execute all provided test files. There are n boxes in front of you. For each i, box i contains r[i] red balls, g[i] green balls, and b[i] blue balls. You want to separate the balls by their color. In each operation, you can pick a single ball from some box and put it into another box. The balls are separated if no box contains balls of more than one color. Debug the given function min_operations and compute the m
View Solution →XOR Strings
In this challenge, the task is to debug the existing code to successfully execute all provided test files. Given two strings consisting of digits 0 and 1 only, find the XOR of the two strings. To know more about XOR Click Here Debug the given function strings_xor to find the XOR of the two given strings appropriately. Note: You can modify at most three lines in the given code and you cannot add or remove lines to the code. To restore the original code, click on the icon to the rig
View Solution →Zig Zag Sequence
In this challenge, the task is to debug the existing code to successfully execute all provided test files. Given an array of n distinct integers, transform the array into a zig zag sequence by permuting the array elements. A sequence will be called a zig zag sequence if the first k elements in the sequence are in increasing order and the last k elements are in decreasing order, where k = ( n+1) /2 . You need to find the lexicographically smallest zig zag sequence of the given array. Note
View Solution →Smart Number
In this challenge, the task is to debug the existing code to successfully execute all provided test files. A number is called a smart number if it has an odd number of factors. Given some numbers, find whether they are smart numbers or not. Debug the given function is_smart_number to correctly check if a given number is a smart number. Note: You can modify only one line in the given code and you cannot add or remove any new lines. To restore the original code, click on the icon to th
View Solution →