일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | |||||
3 | 4 | 5 | 6 | 7 | 8 | 9 |
10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 | 20 | 21 | 22 | 23 |
24 | 25 | 26 | 27 | 28 | 29 | 30 |
31 |
- llama
- 딥러닝
- coursera
- AI
- 인공신경망
- Machine Learning
- prompt
- Andrew Ng
- feature engineering
- 언어모델
- bingai
- Unsupervised Learning
- ML
- Scikitlearn
- GPT
- supervised ml
- Supervised Learning
- ChatGPT
- 프롬프트 엔지니어링
- neural network
- 챗지피티
- feature scaling
- Regression
- LLM
- nlp
- Deep Learning
- 인공지능
- AI 트렌드
- learning algorithms
- 머신러닝
- Today
- Total
목록Coding Problems (2)
My Progress
There are n cars at given miles away from the starting mile 0, traveling to reach the mile target.You are given two integer arrays, position and speed, both of length n, where position[i] is the starting mile of the ith car and speed[i] is the speed of the ith car in miles per hour. A car cannot pass another car, but it can catch up and then travel next to it at the speed of the slower car. A ca..
Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the ith day to get a warmer temperature. If there is no future day for which this is possible, keep answer[i] == 0 instead. A key point of this question was to make the stack in ascending order. Since we are finding the number of days..