Some coding challenges either practicing or requested by
Having the days of the week in the form of "Mon", "Tue", "Wed", "Thu", "Fri", "Sat", "Sun" given a string s indicating a day of the week and a number k return what day of the week will be k days example s="Sat" k = 9 should return "Mon" example s="Mon" k = 3 should return "Thu" see solution
Given a table in the form of headers and data lines separated by \n and values are separated by , return the max value given a column name.
Example:
given S = "id,name,age,act.,room,dep.\n1,Jack,68,T,13,8\n17,Betty,28,F,15,7"
C = "age"
it should return 68
To help ilustrate the example above here is a formatted version of the data
| id | name | age | room | dep |
|---|---|---|---|---|
| 1 | Jack | 68 | T | 8 |
| 17 | Betty | 28 | F | 7 |
as you can see, the maximum value in the column age is 68
see solution
Given a list of integers return the minimum postive integer missing from the list
Example:
| list | missing vlaue |
|---|---|
| [1, 2, 3] | 4 |
| [-1, -2, -3] | 1 |
| [1, 1, 1] | 2 |
| [0, 0, 0] | 1 |
| [-2,-1,1,2,3,4, 9, 10, 19] | 5 |
see solution
Given a string where each line resprest a day of work and each day is represented by an interval of working hours calculate the total number of hours in the timesheet. The intervals can be in 24 hours format or not example: one day (like shown in the example below) can be
10-14, 17:30-21:30
and other day can be represented in 12 hours format like:
11-1, 2:30-4
see solution
Given an array of integers nums and an integer target, return the indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order.
Example:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]
see solution