일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- Regression
- llama
- nlp
- ChatGPT
- neural network
- bingai
- 딥러닝
- Deep Learning
- 언어모델
- AI 트렌드
- feature scaling
- ML
- 머신러닝
- prompt
- learning algorithms
- supervised ml
- LLM
- AI
- 인공신경망
- Scikitlearn
- 챗지피티
- GPT
- Machine Learning
- feature engineering
- 프롬프트 엔지니어링
- Andrew Ng
- 인공지능
- Unsupervised Learning
- Supervised Learning
- coursera
- 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..