@zpxshl #1
@dif #3
我是喜欢整个解题过程，所以才能一直坚持下去。😅

@monkey110 #30 我现在是让软件自动切换节点，会经常切换节点的，不过没有给我带来很大的困扰，我觉得体验挺好的。

@forgottencoast #35 我跟你的想法一样，我更希望软件能够提供一个用户友好的方式进行设置，或许这不是一个常见的用户需求吧。🤕

@vcbal #2 爬楼梯是什么题？可以给一下 LeetCode 链接吗？这个 https://leetcode.com/problems/climbing-stairs/ ？

你这个问题就有问题，你说“ 将这 N 个数字分为 N 组”，这个明显不对。然后怎么才算一组，是不是组的总和要尽量大？组的数量是不是要尽量少。

BTW ，要先理解问题，才能解决问题。

@SmiteChow #16 What are you talking about? 😴

@poorcai #11 你可以在 Chrome 浏览器安装“Bing Chat for All Browsers” extension ，我不喜欢 Edge ，不够简洁。

@hsir #8 颜色跟 mode 有关，我选择的是 creative mode 。

这种问题问 ChatGPT 最好了。

In Java, the protected keyword is a visibility modifier that can be applied to class members (fields, methods, and nested classes) to restrict their access to the class itself, its subclasses, and other classes in the same package.

More specifically, when a class member is declared as protected, it can be accessed by:

The class itself
Any subclass of the class, even if the subclass is in a different package
Any other class in the same package as the class

可以发一下来源链接吗？

@grahamsa0503 #38 LeetCode 地址 - https://leetcode.com/problems/reverse-words-in-a-string/description/

https://i.imgur.com/ha5YQ27.png

@JasonLaw #28 https://leetcode.com/problems/permutations/submissions/935632864/

https://i.imgur.com/ZmYC2bA.png

```python
class Solution:
def permute(self, nums: List[int]) -> List[List[int]]:
def gen_permutations(nums) -> List[List[int]]:
if len(nums) == 1:
return [nums]
permutations = []
for i in range(len(nums)):
for p in gen_permutations(nums[0:i] + nums[i + 1:]):
permutations.append([nums[i]] + p)
return permutations

res = gen_permutations(nums)
return res
```

@featureoverload #3 谢谢，不过可以优化成`all(c in 'aeiou' for c in (x, y))`

@NessajCN #1 对，下面的 for loop 可以替换为 lost comprehension

加油

其实很多 discord server 里面就有 mock interview channel ，比如这个 https://discord.com/channels/788914859235606558/976949178984964167