Skip to content

meetup 26 Binary search Pow... #19

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
May 9, 2021
Merged

meetup 26 Binary search Pow... #19

merged 3 commits into from
May 9, 2021

Conversation

ytyubox
Copy link
Member

@ytyubox ytyubox commented Apr 20, 2021

# LeetCode 讀書會第 26 次聚會 

 1. 項目: 第 26 次聚會
 2. 目的: 線上一起寫題目, 由有想法的人帶領, 先解題, 再看該題有趣的解法
 3. 時間: 5/04 (二) 20:00 ~ 21:00
 4. 地點: google meet 線上 (前 10 分鐘預備鏈接)
 5. 解題項目:  [Binary search](https://leetcode.com/explore/learn/card/binary-search)
 6. 共筆: GitHub https://github.com/programmingbookclub/Leetcode-club/pull/19
 7. 備註: 上次只有聊 658 一個題目,這次會聊  50	 Pow(x, n), 因為 Template analysis 需要付費,但是還是有放在共筆內。

@ytyubox
Copy link
Member Author

ytyubox commented Apr 20, 2021

@SamTienz 上次有提到 MEDIUM 658 - Find K Closest Elements 還可以用 2 次 的 binary search,這禮拜我會研究看看

@ytyubox ytyubox merged commit f147637 into main May 9, 2021
@ytyubox ytyubox deleted the meetup-26 branch May 9, 2021 02:19
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant