100 days of Python. 100 programming Challanges. One Day at a Time.
Day 1 : Given a List of numbers and a number k, return whether any two numbers from the list add up to k.
Day 2 : Given an array of integers, return a new array such that each element at index i of the new array is the product of all the numbers in the original array except the one at i.
Day 3: Given any two words, check if a word is an anagram of another.
Day 4: Given an array of positive and negative integers, find the first missing positive integer.
Day 5: Given the mapping a = 1, b = 2, ... z = 26, and an encoded message, count the number of ways it can be decoded. You can assume that the messages are decodable. For example, '001' is not allowed.
.....
Day n.