# Utkarsh Sinha | ~2.5 yrs

- Java
- Dynamodb, Mysql
- AWS - Serverless (API, Lamda, dynamodb)
- Good with Ds/Algo Problem
- Ok with Db design
- Overall - 7/10

# Question 1:

[1, 2, 3, 1, 2, 4, 3, 4, 2, 1]
[1,1,1,2,2,2,3,3,4,4]

1,4, 2
1,4, 2
331

23/5 4.6

5,6,7,8,
4
1,1,1,2
2,3
2,3

4
4
maxSum = 7
minimum no of array

# Question 2: Find the max sum in an array.
- ith element, cannot pick i-1th & i+1th element.

[1, 2, 3, 4, 5] - (1, 3, 5)9
[1, 2,-3, 4, 5] - (2, 5) 7
[10, 20, 15] - 25

int solution(vector<int> num){
    int curr_sum[num.size()] = {0},n = nums.size();
    if(n==0) return 0;
    if(n==1) return num[0];
    curr_sum[0] = num[0];
    curr_sum[1] = max(num[0],num[1]);
    int i;
    for(i=2;i<n;i++){
                      curr_sum[i] = max(curr_sum[i-1],max(num[i]+curr_sum[i-2],curr_sum[i-2]));
                      }
                      return curr_sum[n-1];
    }
}

# Question 3:

user service

Task service

- create a task,(subtask) files, descriptions.
- assign the task to users (many to many)
- track the status of assigned task/subtask(ENUMs- )

taskName
columnNames

SubTask
====
SubTaskId
Files
Description
Status

UserTask
========
UserId
TaskId

Task
=======
TaskId
SubtaskId