Computing]]> https://steakovercooked.com zh-cn oh@steakovercooked.com Copyright 2006 ~ 2026, SteakOverCooked https://steakovercooked.com 5
初步得出一个答案，6个字：非标的，复杂的。

所谓非标，就是这个产品或者服务，没有标准化答案，不能被数字化打分估算交付结果，比如装修里的贴瓷砖，手艺好坏靠客户主观评价，还有比如理发，好不好看，美的标准不统一。类似于这种，千人千面。
...
View Full Text>>
Category:Computing>>
]]> Sun, 15 Mar 2026 10:46:38 +0000 oh@steakovercooked.com (steakovercooked) 解决了token消耗过慢的问题
解决了AI时代的精神焦虑
解决了技术爱好者发文分享的需求
解决了跟不上AI潮流的焦虑
...
View Full Text>>
Category:Computing>>
]]> Tue, 10 Mar 2026 08:55:00 +0000 oh@steakovercooked.com (steakovercooked)
1. 并不能给小龙虾100u，让它给你赚到1wu

2. 虽然你知道这个很费token，但是没想到那么费token
...
View Full Text>>
Category:Computing>>
]]> Mon, 09 Mar 2026 07:52:43 +0000 oh@steakovercooked.com (steakovercooked)
根据腾讯 QQ 开放平台发布的信息，用户只需通过手机 QQ 扫码登陆即可完成开发者账号注册（没有实名的 QQ 仍需完成实名登记），只需点击一次鼠标即可完成 QQ 机器人的创建，随后只需在 OpenClaw 运行环境中完成简单配置即可绑定，便能在 QQ 上与该机器人进行对话。

登录后，QQ 开放平台会提供一个显眼的“创建机器人”选项，点击一次即可快速生成一个新的机器人账号（IT之家注：每个 QQ 账号最多创建 5 个），比其他所有平台都简单。
...
View Full Text>>
Category:Computing>>
]]> Sun, 08 Mar 2026 11:34:41 +0000 oh@steakovercooked.com (steakovercooked) 这些其实都不是真的。
但奇怪的是，这些假消息却火了整整两个月，还让不少股票群的人慌慌张张地加仓英伟达。

为啥？
...
View Full Text>>
Category:Computing>>
]]> Fri, 31 Oct 2025 08:29:39 +0000 oh@steakovercooked.com (steakovercooked)
如果AI不能继续变聪明了，我们该怎么办 – by Cal Newport

所有和AI相关的兴奋和焦虑，源头都能追溯到2020年的1月。
...
View Full Text>>
Category:Computing>>
]]> Fri, 15 Aug 2025 10:10:31 +0000 oh@steakovercooked.com (steakovercooked)
Apple just proved that its AI “reasoning” models can’t reason at all

它们只是在非常擅长记忆模式。
...
View Full Text>>
Category:Computing>>
]]> Mon, 09 Jun 2025 10:26:55 +0000 oh@steakovercooked.com (steakovercooked)


有多小？像上图那样，放在你的办公桌上，插上标准电源就能用。
...
View Full Text>>
Category:Computing>>
]]> Tue, 07 Jan 2025 15:49:30 +0000 oh@steakovercooked.com (steakovercooked)
在今年的热搜中，最受关注的新闻关键词无疑是“美国大选”，位列第一；其次是极端高温和奥运主题，分别占据第二和第三位。此外，一些天气事件，如飓风米尔顿和珊珊台风也进入了热搜榜，值得一提的是，川普相关的枪击事件则排在第八位。

来自全球范围内对美国大选的浓厚关注反映在热搜人物榜上，川普毫无悬念地夺得冠军，而他的竞争对手贺锦丽则排名第三。退选的拜登位列第五，川普的副手万斯也取得了第七名的好成绩。
...
View Full Text>>
Category:Computing>>
]]> Sat, 14 Dec 2024 09:54:46 +0000 oh@steakovercooked.com (steakovercooked)
Understand problem and define scope.
Clarify functional and non-functional requirements.
State assumptions and decisions explicitly.
...
View Full Text>>
Category:Computing>>
]]> Tue, 12 Nov 2024 08:22:36 +0000 oh@steakovercooked.com (steakovercooked)
– 先说乐观的，OpenAI的下一代模型GPT-Orion虽然只完成了20%的训练，但它的能力已经和GPT-4持平了；

– 但是——没错，但是来了——和GPT-3到GPT-4之间的飞跃进步相比，GPT-Orion的提升要小很多，所以它配不上GPT-5这个命名；
...
View Full Text>>
Category:Computing>>
]]> Mon, 11 Nov 2024 19:34:57 +0000 oh@steakovercooked.com (steakovercooked)
这家公司主要负责给硅谷各大公司提供数据服务，包括数据标注，清洗，挖掘，运营等等

而且营收非常可观，用了大量第三世界国家的人力来降低成本。
...
View Full Text>>
Category:Computing>>
]]> Mon, 04 Nov 2024 22:51:18 +0000 oh@steakovercooked.com (steakovercooked)
　　此事引起密码学界和量子密码界的广泛关注。上海交通大学网络空间安全学院院长谷大武教授3月4日表示，昨天看到这个消息感到很吃惊。“如果属实，这个结果是很重要的，会对部分应用产生安全影响。我们在分析这篇文章，目前还没结论。”

　　RSA是1977年由罗纳德·李维斯特（Ron Rivest）、阿迪·萨莫尔（Adi Shamir）和伦纳德·阿德曼（Leonard Adleman）一起提出的加密算法。这一算法利用大素数分解困难的特性，由于大素数之积难被分解，因此该密码就难被破解。如果想要破解密码，就需要花费很长时间进行大量运算。
...
View Full Text>>
Category:Computing>>
]]> Fri, 05 Mar 2021 16:01:51 +0000 oh@steakovercooked.com (steakovercooked)
Kaprekar's Constant is the number 6174. This number is special because it has the property where for any 4-digit number that has 2 or more unique digits, if you repeatedly apply a certain function it always reaches the number 6174.

This certain function is as follows:
...
View Full Text>>
Category:Computing>>
]]> Mon, 03 Feb 2020 19:23:39 +0000 oh@steakovercooked.com (steakovercooked)
Given a sorted list, create a height balanced binary search tree, meaning the height differences of each node can only differ by at most 1.

Here's some code to start with:
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 21:02:42 +0000 oh@steakovercooked.com (steakovercooked)
A chess board is an 8x8 grid. Given a knight at any position (x, y) and a number of moves k, we want to figure out after k random moves by a knight, the probability that the knight will still be on the chessboard. Once the knight leaves the board it cannot move again and will be considered off the board.

Here's some starter code:
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 21:01:59 +0000 oh@steakovercooked.com (steakovercooked)
We have a list of tasks to perform, with a cooldown period. We can do multiple of these at the same time, but we cannot run the same task simultaneously.

Given a list of tasks, find how long it will take to complete the tasks in the order they are input.
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 21:01:30 +0000 oh@steakovercooked.com (steakovercooked)
You are given a list of n numbers, where every number is at most k indexes away from its properly sorted index. Write a sorting algorithm (that will be given the number k) for this list that can solve this in O(n log k)

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 21:01:10 +0000 oh@steakovercooked.com (steakovercooked)
Given a binary tree, find the most frequent subtree sum.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 21:00:46 +0000 oh@steakovercooked.com (steakovercooked)
Given a string with only ( and ), find the minimum number of characters to add or subtract to fix the string such that the brackets are balanced.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 21:00:04 +0000 oh@steakovercooked.com (steakovercooked)
Given an integer, check if that integer is a palindrome. For this problem do not convert the integer to a string to check if it is a palindrome.

import math
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:59:37 +0000 oh@steakovercooked.com (steakovercooked)
You are given a tree, and your job is to print it level-by-level with linebreaks.

a
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:59:06 +0000 oh@steakovercooked.com (steakovercooked)
In many spreadsheet applications, the columns are marked with letters. From the 1st to the 26th column the letters are A to Z. Then starting from the 27th column it uses AA, AB, ..., ZZ, AAA, etc.

Given a number n, find the n-th column name.
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:58:32 +0000 oh@steakovercooked.com (steakovercooked)
An IP Address is in the format of A.B.C.D, where A, B, C, D are all integers between 0 to 255.

Given a string of numbers, return the possible IP addresses you can make with that string by splitting into 4 parts of A, B, C, D.
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:58:04 +0000 oh@steakovercooked.com (steakovercooked)
Return the longest run of 1s for a given integer n's binary representation.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:57:33 +0000 oh@steakovercooked.com (steakovercooked)
MS Excel column titles have the following pattern: A, B, C, ..., Z, AA, AB, ..., AZ, BA, BB, ..., ZZ, AAA, AAB, ... etc. In other words, column 1 is named "A", column 2 is "B", column 26 is "Z", column 27 is "AA" and so forth. Given a positive integer, find its corresponding column name.
Examples:
Input: 26
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:57:00 +0000 oh@steakovercooked.com (steakovercooked)
Version numbers are strings that are used to identify unique states of software products. A version number is in the format a.b.c.d. and so on where a, b, etc. are numeric strings separated by dots. These generally represent a hierarchy from major to minor changes. Given two version numbers version1 and version2, conclude which is the latest version number. Your code should do the following:
If version1 > version2 return 1.
If version1 < version2 return -1.
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:56:26 +0000 oh@steakovercooked.com (steakovercooked)
Given a directed graph, reverse the directed graph so all directed edges are reversed.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:55:43 +0000 oh@steakovercooked.com (steakovercooked)
Given a file path with folder names, '..' (Parent directory), and '.' (Current directory), return the shortest possible file path (Eliminate all the '..' and '.').

Example
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:55:09 +0000 oh@steakovercooked.com (steakovercooked)
Design a Tic-Tac-Toe game played between two players on an n x n grid. A move is guaranteed to be valid, and a valid move is one placed on an empty block in the grid. A player who succeeds in placing n of their marks in a horizontal, diagonal, or vertical row wins the game. Once a winning condition is reached, the game ends and no more moves are allowed. Below is an example game which ends in a winning condition:

Given n = 3, assume that player 1 is "X" and player 2 is "O"
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:54:33 +0000 oh@steakovercooked.com (steakovercooked)
Given a non-empty list of words, return the k most frequent words. The output should be sorted from highest to lowest frequency, and if two words have the same frequency, the word with lower alphabetical order comes first. Input will contain only lower-case letters.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:53:43 +0000 oh@steakovercooked.com (steakovercooked)
Given a linked list, determine if the linked list has a cycle in it. For notation purposes, we use an integer pos which represents the zero-indexed position where the tail connects to.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:53:03 +0000 oh@steakovercooked.com (steakovercooked)
Given a non-empty array where each element represents a digit of a non-negative integer, add one to the integer. The most significant digit is at the front of the array and each element in the array contains only one digit. Furthermore, the integer does not have leading zeros, except in the case of the number '0'.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:52:23 +0000 oh@steakovercooked.com (steakovercooked)
Given an array of integers of size n, where all elements are between 1 and n inclusive, find all of the elements of [1, n] that do not appear in the array. Some numbers may appear more than once.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:51:43 +0000 oh@steakovercooked.com (steakovercooked)
You are given the root of a binary tree. Find the level for the binary tree with the minimum sum, and return that value.

For instance, in the example below, the sums of the trees are 10, 2 + 8 = 10, and 4 + 1 + 2 = 7. So, the answer here should be 7.
...
View Full Text>>
Category:Computing>>
]]> Sun, 02 Feb 2020 20:50:57 +0000 oh@steakovercooked.com (steakovercooked)
You are given the root of a binary tree, along with two nodes, A and B. Find and return the lowest common ancestor of A and B. For this problem, you can assume that each node also has a pointer to its parent, along with its left and right child.


...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 20:06:55 +0000 oh@steakovercooked.com (steakovercooked)
You are given two strings, A and B. Return whether A can be shifted some number of times to get B.

Eg. A = abcde, B = cdeab should return true because A can be shifted 3 times to the right to get B. A = abc and B= acb should return false.
...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 20:06:20 +0000 oh@steakovercooked.com (steakovercooked)
Given the root of a binary tree, print its level-order traversal. For example:


...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 20:05:43 +0000 oh@steakovercooked.com (steakovercooked)
You are given a doubly linked list. Determine if it is a palindrome.

Can you do this for a singly linked list?
...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 20:05:04 +0000 oh@steakovercooked.com (steakovercooked)
You are given an array of integers, and an integer K. Return the subarray which sums to K. You can assume that a solution will always exist.


...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 20:04:22 +0000 oh@steakovercooked.com (steakovercooked)
You are given an array of integers. Return the length of the longest consecutive elements sequence in the array.

For example, the input array [100, 4, 200, 1, 3, 2] has the longest consecutive sequence 1, 2, 3, 4, and thus, you should return its length, 4.
...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 20:03:50 +0000 oh@steakovercooked.com (steakovercooked)
You are given an array of integers. Return all the permutations of this array.


...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 20:03:21 +0000 oh@steakovercooked.com (steakovercooked)
You are given the root of a binary tree. Find the path between 2 nodes that maximizes the sum of all the nodes in the path, and return the sum. The path does not necessarily need to go through the root.


...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 20:02:51 +0000 oh@steakovercooked.com (steakovercooked)
Given a sorted list of positive numbers, find the smallest positive number that cannot be a sum of any subset in the list.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 20:02:13 +0000 oh@steakovercooked.com (steakovercooked)
Given a number of integers, combine them so it would create the largest number.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 20:01:16 +0000 oh@steakovercooked.com (steakovercooked)
Given a string, rearrange the string so that no character next to each other are the same. If no such arrangement is possible, then return None.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 19:58:47 +0000 oh@steakovercooked.com (steakovercooked)
Given an array of characters with repeats, compress it in place. The length after compression should be less than or equal to the original array.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 19:58:12 +0000 oh@steakovercooked.com (steakovercooked)
Given a Roman numeral, find the corresponding decimal value. Inputs will be between 1 and 3999.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 19:56:17 +0000 oh@steakovercooked.com (steakovercooked)
Given an array of integers, arr, where all numbers occur twice except one number which occurs once, find the number. Your solution should ideally be O(n) time and use constant extra space.
Example:
Input: arr = [7, 3, 5, 5, 4, 3, 4, 8, 8]
...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 19:55:15 +0000 oh@steakovercooked.com (steakovercooked)
The Fibonacci sequence is the integer sequence defined by the recurrence relation: F(n) = F(n-1) + F(n-2), where F(0) = 0 and F(1) = 1. In other words, the nth Fibonacci number is the sum of the prior two Fibonacci numbers. Below are the first few values of the sequence:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144...
...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 19:53:58 +0000 oh@steakovercooked.com (steakovercooked)
Given a list of numbers of size n, where n is greater than 3, find the maximum and minimum of the list using less than 2 * (n - 1) comparisons.

Here's a start:
...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 19:53:17 +0000 oh@steakovercooked.com (steakovercooked)
A k-ary tree is a tree with k-children, and a tree is symmetrical if the data of the left side of the tree is the same as the right side of the tree.

Here's an example of a symmetrical k-ary tree.
...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 19:52:41 +0000 oh@steakovercooked.com (steakovercooked)
The h-index is a metric that attempts to measure the productivity and citation impact of the publication of a scholar. The definition of the h-index is if a scholar has at least h of their papers cited h times.

Given a list of publications of the number of citations a scholar has, find their h-index.
...
View Full Text>>
Category:Computing>>
]]> Sun, 12 Jan 2020 19:51:36 +0000 oh@steakovercooked.com (steakovercooked)
　　为什么Python在IEEE Spectrum的调查里面这么受欢迎呢？

　　一个原因就是Python现在已经逐渐受到嵌入式的支持。放在以前，受到嵌入式硬件的限制，一般只能支持一些编译语言。但是现在随着嵌入式硬件变得越来越强大，他的硬件能力足以支撑起Python的运行。而Python对于一些特定的嵌入式应用场景可以非常简单、方便、快速的搭建起可运行系统。因此，Python现在在嵌入式圈子里逐渐得到应用并且火了起来。
...
View Full Text>>
Category:Computing>>
]]> Thu, 26 Dec 2019 10:33:54 +0000 oh@steakovercooked.com (steakovercooked)
Starting at index 0, for an element n at index i, you are allowed to jump at most n indexes ahead. Given a list of numbers, find the minimum number of jumps to reach the end of the list.

Example:
...
View Full Text>>
Category:Computing>>
]]> Tue, 24 Dec 2019 21:37:15 +0000 oh@steakovercooked.com (steakovercooked)
Two words can be 'chained' if the last character of the first word is the same as the first character of the second word.

Given a list of words, determine if there is a way to 'chain' all the words in a circle.
...
View Full Text>>
Category:Computing>>
]]> Tue, 24 Dec 2019 21:36:26 +0000 oh@steakovercooked.com (steakovercooked)
Given a string with a certain rule: k[string] should be expanded to string k times. So for example, 3[abc] should be expanded to abcabcabc. Nested expansions can happen, so 2[a2[b]c] should be expanded to abbcabbc.

Your starting point:
...
View Full Text>>
Category:Computing>>
]]> Tue, 24 Dec 2019 21:35:38 +0000 oh@steakovercooked.com (steakovercooked)
Given a binary tree, remove the nodes in which there is only 1 child, so that the binary tree is a full binary tree.

So leaf nodes with no children should be kept, and nodes with 2 children should be kept as well.
...
View Full Text>>
Category:Computing>>
]]> Tue, 24 Dec 2019 21:35:02 +0000 oh@steakovercooked.com (steakovercooked)
Design a simple stack that supports push, pop, top, and retrieving the minimum element in constant time.

push(x) -- Push element x onto stack.
...
View Full Text>>
Category:Computing>>
]]> Tue, 24 Dec 2019 21:34:12 +0000 oh@steakovercooked.com (steakovercooked)
Write a function that reverses the digits a 32-bit signed integer, x. Assume that the environment can only store integers within the 32-bit signed integer range, [-2^31, 2^31 - 1]. The function returns 0 when the reversed integer overflows.

Example:
...
View Full Text>>
Category:Computing>>
]]> Tue, 24 Dec 2019 21:33:27 +0000 oh@steakovercooked.com (steakovercooked)
Given a list of integers, return the bounds of the minimum range that must be sorted so that the whole list would be sorted.

Example:
...
View Full Text>>
Category:Computing>>
]]> Tue, 24 Dec 2019 21:32:47 +0000 oh@steakovercooked.com (steakovercooked)
You are the manager of a number of employees who all sit in a row. The CEO would like to give bonuses to all of your employees, but since the company did not perform so well this year the CEO would like to keep the bonuses to a minimum.

The rules of giving bonuses is that:
...
View Full Text>>
Category:Computing>>
]]> Tue, 24 Dec 2019 21:32:07 +0000 oh@steakovercooked.com (steakovercooked)
You are given the root of a binary tree. You need to implement 2 functions:

1. serialize(root) which serializes the tree into a string representation
...
View Full Text>>
Category:Computing>>
]]> Tue, 24 Dec 2019 21:31:25 +0000 oh@steakovercooked.com (steakovercooked)
You are given a binary tree representation of an arithmetic expression. In this tree, each leaf is an integer value,, and a non-leaf node is one of the four operations: '+', '-', '*', or '/'.

Write a function that takes this tree and evaluates the expression.
...
View Full Text>>
Category:Computing>>
]]> Tue, 24 Dec 2019 21:30:28 +0000 oh@steakovercooked.com (steakovercooked)
Given a time in the format of hour and minute, calculate the angle of the hour and minute hand on a clock.


...
View Full Text>>
Category:Computing>>
]]> Sun, 15 Dec 2019 10:39:43 +0000 oh@steakovercooked.com (steakovercooked)
You are given an array of integers. Return the length of the longest increasing subsequence (not necessarily contiguous) in the array.

Example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 15 Dec 2019 10:36:40 +0000 oh@steakovercooked.com (steakovercooked)
Given two arrays, write a function to compute their intersection - the intersection means the numbers that are in both arrays.

Example 1:
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:31:02 +0000 oh@steakovercooked.com (steakovercooked)
You are given an array of integers. Return an array of the same size where the element at each index is the product of all the elements in the original array except for the element at that index.

For example, an input of [1, 2, 3, 4, 5] should return [120, 60, 40, 30, 24].
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:30:34 +0000 oh@steakovercooked.com (steakovercooked)
Given a sorted list of numbers, return a list of strings that represent all of the consecutive numbers.

Example:
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:30:06 +0000 oh@steakovercooked.com (steakovercooked)
Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.

Example 1:
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:28:57 +0000 oh@steakovercooked.com (steakovercooked)
You are given an array of tuples (start, end) representing time intervals for lectures. The intervals may be overlapping. Return the number of rooms that are required.

For example. [(30, 75), (0, 50), (60, 150)] should return 2.Category:Computing>>
]]> Thu, 12 Dec 2019 20:28:05 +0000 oh@steakovercooked.com (steakovercooked)
You are given a stream of numbers. Compute the median for each new element .

Eg. Given [2, 1, 4, 7, 2, 0, 5], the algorithm should output [2, 1.5, 2, 3.0, 2, 2, 2]
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:27:28 +0000 oh@steakovercooked.com (steakovercooked)
Given a list of words, group the words that are anagrams of each other. (An anagram are words made up of the same letters).

Example:
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:26:57 +0000 oh@steakovercooked.com (steakovercooked)
You are given a string of parenthesis. Return the minimum number of parenthesis that would need to be removed in order to make the string valid. "Valid" means that each open parenthesis has a matching closed parenthesis.

Example:
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:26:26 +0000 oh@steakovercooked.com (steakovercooked)
Given a 2-dimensional grid consisting of 1's (land blocks) and 0's (water blocks), count the number of islands present in the grid. The definition of an island is as follows:
1.) Must be surrounded by water blocks.
2.) Consists of land blocks (1's) connected to adjacent land blocks (either vertically or horizontally).
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:25:34 +0000 oh@steakovercooked.com (steakovercooked)
You are given the root of a binary tree. Find and return the largest subtree of that tree, which is a valid binary search tree.

Here's a starting point:
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:24:54 +0000 oh@steakovercooked.com (steakovercooked)
Given an array, nums, of n integers, find all unique triplets (three numbers, a, b, & c) in nums such that a + b + c = 0. Note that there may not be any triplets that sum to zero in nums, and that the triplets must not be duplicates.

Example:
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:24:24 +0000 oh@steakovercooked.com (steakovercooked)
Given a list of words, and an arbitrary alphabetical order, verify that the words are in order of the alphabetical order.

Example:
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:23:50 +0000 oh@steakovercooked.com (steakovercooked)
Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.

Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:22:38 +0000 oh@steakovercooked.com (steakovercooked)
You are given the preorder and inorder traversals of a binary tree in the form of arrays. Write a function that reconstructs the tree represented by these traversals.

Example:
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:22:04 +0000 oh@steakovercooked.com (steakovercooked)
A unival tree is a tree where all the nodes have the same value. Given a binary tree, return the number of unival subtrees in the tree.

For example, the following tree should return 5:
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:20:32 +0000 oh@steakovercooked.com (steakovercooked)
You are given a string s, and an integer k. Return the length of the longest substring in s that contains at most k distinct characters.

For instance, given the string:
...
View Full Text>>
Category:Computing>>
]]> Thu, 12 Dec 2019 20:19:00 +0000 oh@steakovercooked.com (steakovercooked)
为了解答这个困扰良久的未解之谜，12月4日，腾讯微信团队官微在微博科普了拉黑与删除的区别。

问：还可以收发信息吗?
...
View Full Text>>
Category:Computing>>
]]> Wed, 04 Dec 2019 13:32:00 +0000 oh@steakovercooked.com (steakovercooked)
Given a binary tree, return all values given a certain height h.

Here's a starting point:
...
View Full Text>>
Category:Computing>>
]]> Tue, 26 Nov 2019 20:44:00 +0000 oh@steakovercooked.com (steakovercooked)
You are given the root of a binary search tree. Return true if it is a valid binary search tree, and false otherwise. Recall that a binary search tree has the property that all values in the left subtree are less than or equal to the root, and all values in the right subtree are greater than or equal to the root.

Here's a starting point:
...
View Full Text>>
Category:Computing>>
]]> Mon, 25 Nov 2019 18:44:52 +0000 oh@steakovercooked.com (steakovercooked)
You are given an array of integers. Return the smallest positive integer that is not present in the array. The array may contain duplicate entries.

For example, the input [3, 4, -1, 1] should return 2 because it is the smallest positive integer that doesn't exist in the array.
...
View Full Text>>
Category:Computing>>
]]> Mon, 25 Nov 2019 18:42:24 +0000 oh@steakovercooked.com (steakovercooked)
A look-and-say sequence is defined as the integer sequence beginning with a single digit in which the next term is obtained by describing the previous term. An example is easier to understand:

Each consecutive value describes the prior value.
...
View Full Text>>
Category:Computing>>
]]> Mon, 25 Nov 2019 18:41:44 +0000 oh@steakovercooked.com (steakovercooked)
You are given the root of a binary tree. Return the deepest node (the furthest node from the root).

Example:
...
View Full Text>>
Category:Computing>>
]]> Mon, 25 Nov 2019 18:40:57 +0000 oh@steakovercooked.com (steakovercooked)
Given two strings A and B of lowercase letters, return true if and only if we can swap two letters in A so that the result equals B.

Example 1:
...
View Full Text>>
Category:Computing>>
]]> Mon, 25 Nov 2019 18:40:16 +0000 oh@steakovercooked.com (steakovercooked)
You have a landscape, in which puddles can form. You are given an array of non-negative integers representing the elevation at each location. Return the amount of water that would accumulate if it rains.

For example: [0,1,0,2,1,0,1,3,2,1,2,1] should return 6 because 6 units of water can get trapped here.
...
View Full Text>>
Category:Computing>>
]]> Mon, 25 Nov 2019 18:39:22 +0000 oh@steakovercooked.com (steakovercooked)
Given a sorted list of numbers, change it into a balanced binary search tree. You can assume there will be no duplicate numbers in the list.

Here's a starting point:
...
View Full Text>>
Category:Computing>>
]]> Mon, 25 Nov 2019 18:38:37 +0000 oh@steakovercooked.com (steakovercooked)
You are given an array of k sorted singly linked lists. Merge the linked lists into a single sorted linked list and return it.

Here's your starting point:
...
View Full Text>>
Category:Computing>>
]]> Mon, 25 Nov 2019 18:37:57 +0000 oh@steakovercooked.com (steakovercooked)
You are given an array of integers. Find the maximum sum of all possible contiguous subarrays of the array.

Example:
...
View Full Text>>
Category:Computing>>
]]> Mon, 25 Nov 2019 18:37:10 +0000 oh@steakovercooked.com (steakovercooked)
Implement a queue class using two stacks. A queue is a data structure that supports the FIFO protocol (First in = first out). Your class should support the enqueue and dequeue methods like a standard queue.

Here's a starting point:
...
View Full Text>>
Category:Computing>>
]]> Sun, 17 Nov 2019 10:43:52 +0000 oh@steakovercooked.com (steakovercooked)
You are given an array. Each element represents the price of a stock on that particular day. Calculate and return the maximum profit you can make from buying and selling that stock only once.

For example: [9, 11, 8, 5, 7, 10]
...
View Full Text>>
Category:Computing>>
]]> Sun, 17 Nov 2019 10:43:04 +0000 oh@steakovercooked.com (steakovercooked)
You are given an array of intervals - that is, an array of tuples (start, end). The array may not be sorted, and could contain overlapping intervals. Return another array where the overlapping intervals are merged.

For example:
...
View Full Text>>
Category:Computing>>
]]> Sun, 17 Nov 2019 10:42:16 +0000 oh@steakovercooked.com (steakovercooked)
By the way, check out our NEW project AlgoPro (http://algopro.com) for over 60+ video coding sessions with ex-Google/ex-Facebook engineers.

You are given an array of integers. Return the largest product that can be made by multiplying any 3 integers in the array.
...
View Full Text>>
Category:Computing>>
]]> Sun, 17 Nov 2019 10:41:31 +0000 oh@steakovercooked.com (steakovercooked)
By the way, check out our NEW project AlgoPro (http://algopro.com) for over 60+ video coding sessions with ex-Google/ex-Facebook engineers.

You are given a 2D array of integers. Print out the clockwise spiral traversal of the matrix.
...
View Full Text>>
Category:Computing>>
]]> Sun, 17 Nov 2019 10:40:46 +0000 oh@steakovercooked.com (steakovercooked)
By the way, check out our NEW project AlgoPro (http://algopro.com) for over 60+ video coding sessions with ex-Google/ex-Facebook engineers.

Given a list, find the k-th largest element in the list.
...
View Full Text>>
Category:Computing>>
]]> Sun, 17 Nov 2019 10:39:45 +0000 oh@steakovercooked.com (steakovercooked)