일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- LeetCode
- prompt engineering
- 기계학습
- Linear Model
- gradient descent
- 부스트캠프
- 알고리즘
- ChatGPT
- dl
- BFS
- 프로그래머스
- GPT
- NLP
- Programmers
- LLM
- rnn
- transformer
- 프롬프트
- machinelearning
- 코테
- attention
- 코딩테스트
- Linear Regression
- 일기
- 머신러닝
- Django
- Deeplearning
- 파이썬
- deque
- Python
- Today
- Total
목록LeetCode (2)
크크루쿠쿠
https://leetcode.com/problems/group-anagrams/ Group Anagrams - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Anagram을 판별하는 가장 간단한..
Given an array of integers nums and an integer target, return 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 1: Input: nums = [2,7,11,15], target = 9 Output: [0,1] Output: Because nums[0] + nums[1] == 9, we return [0, 1]. Example..