| userSid | conversationSid | role | |
|---|---|---|---|
| 1 | 1 | admin | |
| 1 | 2 | member | |
| 2 | 1 | member | |
| 2 | 2 | admin | |
| 3 | 3 | admin |
| sid | name | description | date_created | |
|---|---|---|---|---|
| 1 | Finance | 2017-06-21T13:03:32Z | ||
| 2 | Drone | 2017-09-21T13:03:32Z | ||
| 3 | Marketing | 2017-12-21T13:03:32Z |
| sid | title | objective | date_created | |
|---|---|---|---|---|
| 1 | Drone 32B | 2017-06-21T13:03:32Z | ||
| 2 | Camera | Find a cool camera | 2017-09-21T13:03:32Z | |
| 3 | Finance 2017 | 2017-12-21T13:03:32Z |
The Challenge
Your challenge is to develop an AWS S3 storage analysis tool. To test your tool, you will have to create a free Amazon account (if you don't already have one).
Specifications
The tool is a mobile app that returns informations over all S3 buckets in an Amazon account.
The app should provide a clean interface and navigation system to display informations. The final app should offer an authentication system for user's to login with their AWS credentials.
Challenge Description
We would like to improve the LinkedIn skills features. Today LinkedIn skills are isolated tags you can assign to profiles. We want to bind these skills together on a flat relationship so we can propose new connections to users based on skills similarities.
Note: every LinkedIn users can bind skills together. Skills have a "binding score" based on the number of time 2 skills are binded together and the number of link a specific skill has.
Your challenge is to imagine a database model to support this feature.
The Challenge
Your challenge is to develop an AWS S3 storage analysis tool. To test your tool, you will have to create a free Amazon account (if you don't already have one).
Specifications
The tool is a shell command line utility (could be either Mac or Linux) that returns informations over all S3 buckets in an Amazon account.
The tool must returns the following informations:
CHALLENGE DESCRIPTION:
You are given two sequences. Write a program to determine the longest common subsequence between the two strings (each string can have a maximum length of 50 characters). NOTE: This subsequence need not be contiguous. The input file may contain empty lines, these need to be ignored.
INPUT SAMPLE:
The first argument will be a path to a filename that contains two strings per line, semicolon delimited. You can assume that there is only one unique subsequence per test case. E.g.
CHALLENGE DESCRIPTION:
The sequence "011212201220200112 ..." is constructed as follows:
first goes 0, and then the following action is repeated: existing part is added to the right, but 0 is replaced with 1, 1 with 2, and 2 with 0.
0 -> 01 -> 0112 -> 01121220 -> ...
CHALLENGE DESCRIPTION:
Write a program that reformats the text into lines of 80 symbols by stretching the text to full line width by adding extra spaces.
Longer series of spaces should go first. For example:
INPUT SAMPLE:
CHALLENGE DESCRIPTION:
Your good friend Tom is admirer of tasting different types of fine wines. What he loves even more is to guess their names. One day, he was sipping very extraordinary wine. Tom was sure he had tasted it before, but what was its name? The taste of this wine was so familiar, so delicious, so pleasant… but what is it exactly? To find the answer, Tom decided to taste the wines we had. He opened wine bottles one by one, tasted different varieties of wines, but still could not find the right one. He was getting crazy, “No, it’s not that!” desperately breaking a bottle of wine and opening another one. Tom went off the deep end not knowing what this wine was. Everything he could say is just several letters of its name. You can no longer look at it and decided to help him.