I will try to code for 100 days, after that I hope I can stay consistent and push work everyday
coding with c++ because i need to practice more. And these challenges are from my class programming paradigms in c++ which will help me prepare for the class
Challenges that I do for fun on my free time
Julius Caesar protected his confidential information by encrypting it using a cipher. Caesar's cipher shifts each letter by a number of letters. If the shift takes you past the end of the alphabet, just rotate back to the front of the alphabet. In the case of a rotation by 3, w, x, y and z would map to z, a, b and c.
Given a time in -hour AM/PM format, convert it to military (24-hour) time.
Note: - 12:00:00AM on a 12-hour clock is 00:00:00 on a 24-hour clock.
- 12:00:00PM on a 12-hour clock is 12:00:00 on a 24-hour clock.
Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string
Given a 2D array boxTypes, where boxTypes[i] = [numberOfBoxes i, numberOfUnitsPerBox i]:
numberOfBoxesi is the number of boxes of type i. numberOfUnitsPerBoxi is the number of units in each box of the type i. You are also given an integer truckSize, which is the maximum number of boxes that can be put on the truck. You can choose any boxes to put on the truck as long as the number of boxes does not exceed truckSize.
Return the maximum total number of units that can be put on the truck.
added missing number, alright bois the strat for this problem is to sort it first and then go thought if it doesnt equal our counter then its gonna returnt he missing number otherwise return the size of the vector because the missing number is the last number.
reading from left to right changing roman numbers, when reading a smaller number before a big number add it to the sum but ass negative, and the next big number add it as positive because that's how roman numbers work "¯_(ツ)_/¯" oh well, and if the next number is bigger, we add positive, do it until there is no more characters left.