leetcode-study

leetcode-study copied to clipboard

[sun]WEEK 2 Solution

1

- [x] Valid Anagram - [x] Counting Bits - [x] Encode and Decode Strings - [x] Construct Binary Tree From Preorder And Inorder Traversal - [ ] Decode Ways

sun912

- [x] Valid Anagram - [x] Counting Bits - [ ] Encode and Decode Strings - [x] Construct Binary Tree From Preorder And Inorder Traversal - [ ] Decode Ways

f-exuan21

[혜준] Week2 문제 풀이

1

1. Valid Anagram 시간 복잡도: O(n) 공간 복잡도: O(n) 2. Counting Bits 시간 복잡도: O(n * log n) 공간 복잡도: O(n)

hyejjun

- [x] #218 - [x] #233 - [ ] #238 - [ ] #253 - [ ] #268

kjb512

## WEEK 02 Problems - [ ] #218 - [ ] #233 - [ ] #238 - [ ] #253 - [ ] #268

naringst

- [x] #218 - [x] #233 - [x] #238 - [x] #253 - [x] #268

TonyKim9401

- [x] #218 - [ ] #233 - [ ] #238 - [ ] #253 - [ ] #268

taekwon-dev

- [x] https://github.com/DaleStudy/leetcode-study/issues/218 - [x] https://github.com/DaleStudy/leetcode-study/issues/233 - [x] https://github.com/DaleStudy/leetcode-study/issues/238 - [ ] https://github.com/DaleStudy/leetcode-study/issues/253 - [ ] https://github.com/DaleStudy/leetcode-study/issues/268

kim-young

- [x] #218 - [ ] #233 - [ ] #238 - [ ] #253 - [ ] #268 ### 1주차 피드백 추가 @DaleSeo @YeonguChoe 두분 피드백 내용 적용했습니다. @DaleSeo님...

Sunjae95

- 문제 - 유료: https://leetcode.com/problems/alien-dictionary/ - 무료: https://www.lintcode.com/problem/892/ - 풀이: https://www.algodale.com/problems/alien-dictionary/ - 위치: https://github.com/DaleStudy/leetcode-study/tree/main/alien-dictionary

DaleSeo