<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
<atom:link href="https://steakovercooked.com/rss/en/blog/" rel="self" type="application/rss+xml" />
<title><![CDATA[I Read and I Share!]]></title>
<description><![CDATA[SteakOverCooked [I Read and I Share!] -> All]]></description>
<link>https://steakovercooked.com</link>
<language>zh-cn</language>
<webMaster>oh@steakovercooked.com</webMaster>
<copyright>Copyright 2006 ~ 2023, SteakOverCooked</copyright>
<generator>https://steakovercooked.com</generator>
<ttl>5</ttl>
<item>
<title><![CDATA[How to Remove Hidden Watermarks?]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/09/how-to-remove-hidden-watermarks.txt]]></link>
<description><![CDATA[　　据媒体报道，因涉及讨论内部事务要求匿名的知情人士透露，阿里巴巴上周对内宣布，针对周姓员工在内网发帖控诉遭前公司经理侵犯的文章被对外公开之事，公司已将泄露这篇文章的员工开除。之前，阿里巴巴一名女员工的自述文字前晚在社交网络流传。该员工称，7月27日，她被上司逼着在台风天到济南出差，期间在与商家的饭局上，被恶意灌酒并遭到客户猥亵。<BR /><BR />　　知情人士表示，这些员工将周某内网控诉文章的截图除去带有个人ID的水印后对外公开发布，此等行为违反了公司政策。据悉阿里巴巴的内网是面向25万员工，不对外开放。而此次阿里在结束内部调查后做出了解雇这10名员工的决定，并没有向公众宣布调查的最终结果。<BR /><BR />　　肉眼看不到的水印，就数字图像处理来说是叫做数字水印，不可见则被称为“盲水印”。盲水印的实现一般和傅立叶相关，傅立叶变换可以把数据从时域转换到频域。盲水印隐蔽性强，给水印数据进行编码过后不易被破解出来。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/09/how-to-remove-hidden-watermarks.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=1">Category:Others&gt;&gt;</a><BR />]]></description>
<pubDate>Mon, 06 Sep 2021 18:44:24 +0000</pubDate>
<category><![CDATA[Others]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/09/how-to-remove-hidden-watermarks.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/09/how-to-remove-hidden-watermarks.txt]]></guid>
</item>
<item>
<title><![CDATA[微信拟推出聊天记录付费云存储服务]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/09/wechat-icloud-chat-history.txt]]></link>
<description><![CDATA[据中国日报网消息，腾讯拟推出个人微信云存储付费服务，意味着微信聊天记录可以实现云端备份和恢复。目前，微信仅支持迁移聊天记录到另一台设备以及备份聊天记录到电脑，如果设备丢失，未及时备份的数据将无法恢复。<BR /><BR />　　据悉，该业务可能采用按年付费的模式，苹果用户或在180元/年左右，安卓用户或在130元/年左右。但该费用具体可以存储多大容量的数据尚未得到确定。<BR /><BR />　　知情人士表示，当前该项目仍在最后推动中，具体细节未最终敲定。目前腾讯未给出明确回应。腾讯2021年第二季度财报显示，截至6月底，微信及WECHAT月活跃帐户已达12.5亿。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/09/wechat-icloud-chat-history.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 05 Sep 2021 14:20:44 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/09/wechat-icloud-chat-history.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/09/wechat-icloud-chat-history.txt]]></guid>
</item>
<item>
<title><![CDATA[微软将不再支持IE浏览器]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/05/microsoft-ie.txt]]></link>
<description><![CDATA[5月20日，微软在官方技术论坛中发布消息，微软决定在2022年6月15日停止对IE浏览器的支持，之后不再提供支持。Internet Explorer首次发布时是作为1995年发布的Windows 95附加软件包Plus的一部分进入公众视野的。<BR /><BR />　　Internet Explorer原来使用过的名称有：Microsoft Internet Explorer、Windows Internet Explorer，后简称IE或MSIE。这是微软公司推出的一款网页浏览器，曾也是使用最广泛的网页浏览器之一。<BR /><BR />　　自从1995年开始，它被内置在各个新版本的Windows作业系统作为默认浏览器，也是微软Windows操作系统组成部分。在IE7以前，中文直译为“网络探路者”，但在IE7以后官方便直接俗称“IE浏览器”。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/05/microsoft-ie.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Fri, 21 May 2021 09:41:54 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/05/microsoft-ie.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/05/microsoft-ie.txt]]></guid>
</item>
<item>
<title><![CDATA[特斯拉暂停使用比特币支付 加密货币纷纷跳水]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/05/testla.txt]]></link>
<description><![CDATA[5月13日，特斯拉CEO埃隆马斯克在社交媒体上表示，出于“对比特币挖矿和交易中使用化石燃料频率迅速增加”的担忧，特斯拉暂停使用比特币来支付购车费用，但不会出售任何比特币。消息传出后，加密货币纷纷跳水。比特币跳水超6700美元，至5万美元左右，跌超11%。<BR /><BR />　　马斯克表示，对比特币对环境造成影响表示担忧，特斯拉正在考虑使用能源消耗更低的加密货币。<BR /><BR />　　马斯克称，“加密货币在很多方面来看是一个好的想法，我们相信其未来具有前景，但这不能以环境为代价。”<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/05/testla.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=16">Category:Cryptocurrency-Blockchain&gt;&gt;</a><BR />]]></description>
<pubDate>Fri, 21 May 2021 09:40:32 +0000</pubDate>
<category><![CDATA[Cryptocurrency-Blockchain]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/05/testla.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/05/testla.txt]]></guid>
</item>
<item>
<title><![CDATA[什么时候是换工作的最佳时机？]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/05/job-changing.txt]]></link>
<description><![CDATA[上一代的人常说，现在的时代对于职场人士而言是最好的时代。因为每一个职场人士都有自由选择工作的权利，在 30 年前每个人的工作还是靠分配的。<BR /><BR />但选择多了也有选择多的烦恼。一个人的职业生涯只有短短 30 年，其中每一步的选择都对后续的发展有非常大的影响。那么当自己想要换工作的时候该如何做出正确的决策呢？这里我给大家一些建议，希望能够带来帮助。<BR /><BR />整篇文章较长，请耐心观看～<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/05/job-changing.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=7">Category:To Share&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 11 May 2021 06:32:37 +0000</pubDate>
<category><![CDATA[To Share]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/05/job-changing.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/05/job-changing.txt]]></guid>
</item>
<item>
<title><![CDATA[PayPal支持比特币等数字货币买卖]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/04/paypal-bitcoin.txt]]></link>
<description><![CDATA[4月20日消息，据报道，PayPal旗下移动支付应用Venmo将允许用户购买、持有和出售比特币和其他数字加密货币。<BR /><BR />　　分析人士称，此举有助于推动数字加密货币迈入主流。Venmo称，从本周二开始， 将允许用户投资四种不同的数字加密货币，最低消费为1美元。<BR /><BR />　　这四种数字加密货币分别为比特币、以太坊、莱特币（litecoin）和比特币现金。此外，用户还可以通过Venmo的社交推送（social feed）与好友分享他们购买的数字加密货币。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/04/paypal-bitcoin.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Wed, 21 Apr 2021 16:26:42 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/04/paypal-bitcoin.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/04/paypal-bitcoin.txt]]></guid>
</item>
<item>
<title><![CDATA[断舍离 你需要扔掉的100样东西]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/04/duan-she-li.txt]]></link>
<description><![CDATA[《断舍离 你需要扔掉的100样东西》想断舍离，先从扔掉收纳工具开始。<BR /><BR />第一步：首先，让我们从衣柜开始<BR />1、只剩一只的袜子、有洞的和没松紧的袜子。<BR />2、干洗店和买衣服时送的廉价衣架。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/04/duan-she-li.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=3">Category:Life&gt;&gt;</a><BR />]]></description>
<pubDate>Wed, 07 Apr 2021 09:33:54 +0000</pubDate>
<category><![CDATA[Life]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/04/duan-she-li.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/04/duan-she-li.txt]]></guid>
</item>
<item>
<title><![CDATA[加密货币资金流入创历史新高]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/03/cryptos.txt.txt]]></link>
<description><![CDATA[近年来，伴随着区块链技术日益成熟和数字货币步入发展快车道，去中心化加密数字货币的市场规模越来越大，目前全球共有319个数字货币交易所，已发行5290种数字货币，总市值高达1814亿美元。<BR /><BR />　　近期的比特币行情又一次在短短几天内大起大落，冲上历史新高后不久便火速暴跌几千美元。比特币市场的火热，也迅速带动了整个加密市场的火爆。<BR /><BR />　　据最新数据显示，今年第一季度流入加密货币基金和产品的资金现已达到42亿美元，突破了去年四季度历史高点39亿美元。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/03/cryptos.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Wed, 17 Mar 2021 16:40:13 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/03/cryptos.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/03/cryptos.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[传RSA加密系统已被密码学大牛破解]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/03/cracking-rsa.txt]]></link>
<description><![CDATA[近日，德国密码学家克劳斯·彼得·施诺尔（Claus Peter Schnorr）在预印本网站上传论文称自己破解了RSA加密系统。<BR /><BR />　　此事引起密码学界和量子密码界的广泛关注。上海交通大学网络空间安全学院院长谷大武教授3月4日表示，昨天看到这个消息感到很吃惊。“如果属实，这个结果是很重要的，会对部分应用产生安全影响。我们在分析这篇文章，目前还没结论。”<BR /><BR />　　RSA是1977年由罗纳德·李维斯特（Ron Rivest）、阿迪·萨莫尔（Adi Shamir）和伦纳德·阿德曼（Leonard Adleman）一起提出的加密算法。这一算法利用大素数分解困难的特性，由于大素数之积难被分解，因此该密码就难被破解。如果想要破解密码，就需要花费很长时间进行大量运算。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/03/cracking-rsa.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Fri, 05 Mar 2021 16:01:51 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/03/cracking-rsa.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/03/cracking-rsa.txt]]></guid>
</item>
<item>
<title><![CDATA[快手于港交所上市]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/02/kuaisou.txt]]></link>
<description><![CDATA[　2021年2月5日，快手正式在港交所风光上市，开盘价338港元，比招股价115港元涨幅193.91%，今日盘中一度上涨至345港元，收盘价300.8港元，涨幅161.74%。截至收盘，快手市值高达1.24万亿港元，总市值超过百度、小米、京东、网易。<BR /><BR />　　受益于此，快手联合创始人兼CEO宿华、联合创始人兼首席产品官程一笑的身家水涨船高，分别高达187亿美元和148亿美元。除此以外，快手科技另两位个人股东银鑫、杨远熙，分别以31亿美元和27亿美元的财富值，踏入福布斯新晋亿万富豪队列。<BR /><BR />　　据了解，此次快手IPO，吸引10家国际大型基石投资者，包括The Capital Group、淡马锡、GIC Pte、贝莱德公司和阿布扎比投资局等全球知名投资机构。上述这些基石投资者同意认购快手约24.5亿美元股票，相当于IPO集资规模至少45%。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/02/kuaisou.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Fri, 05 Feb 2021 18:13:06 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/02/kuaisou.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/02/kuaisou.txt]]></guid>
</item>
<item>
<title><![CDATA[贝索斯宣布辞去亚马逊CEO]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/02/jeff-amazon-ceo-resign.txt]]></link>
<description><![CDATA[美国当地时间2月2日，现年57岁的贝索斯宣布，他将辞去亚马逊首席执行官的职务，于今年秋天转任亚马逊董事会执行主席。<BR /><BR />　　届时，将由现任云计算部门的负责人安迪·贾西担任亚马逊的下一任首席执行官。<BR /><BR />　　那么贝索斯未来的打算是什么？新任CEO安迪·贾西又将面临什么挑战？<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/02/jeff-amazon-ceo-resign.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Thu, 04 Feb 2021 13:49:09 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/02/jeff-amazon-ceo-resign.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/02/jeff-amazon-ceo-resign.txt]]></guid>
</item>
<item>
<title><![CDATA[抖音起诉腾讯垄断要求解封]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/02/douyin-sue-tencent.txt]]></link>
<description><![CDATA[2021年2月2日，抖音向北京知识产权法院正式提交诉状，起诉腾讯垄断。这是自2020年底《关于平台经济领域的反垄断指南（征求意见稿）》 公布以来，国内首例发生在互联网平台之间的反垄断诉讼。<BR /><BR />　　抖音方面主张，腾讯通过微信和QQ限制用户分享来自抖音的内容，构成了《反垄断法》所禁止的“滥用市场支配地位，排除、限制竞争的垄断行为”。抖音要求法院判令腾讯立即停止这一行为，刊登公开声明消除不良影响，并赔偿抖音经济损失及合理费用9000万元。<BR /><BR />　　公开报道显示，2018年4月，微信和QQ开始封禁抖音，用户分享抖音链接到上述平台均无法正常播放，至今已经持续近三年。但腾讯旗下及其他第三方短视频应用，如微视、快手等，均可以在微信正常分享和播放。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/02/douyin-sue-tencent.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 02 Feb 2021 21:30:23 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/02/douyin-sue-tencent.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/02/douyin-sue-tencent.txt]]></guid>
</item>
<item>
<title><![CDATA[印度宣布永久禁止59款中国APP]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/01/indian-ban-chinese-apps.txt]]></link>
<description><![CDATA[综合《印度时报》和路透社等外媒26日消息，印度电子和信息技术部发布最新通知，将在今年6月永久禁止59款中国手机应用程序，包括TikTok（抖音海外版）、百度、Wechat（微信）和UC浏览器等。<BR /><BR />　　印度Livemint网援引一位消息人士的话说，这一通知是上周发布的。根据《印度时报》的说法，此次永久禁令是印度电子和信息技术部的官员“不满”这些中国公司回应印度政府提出的各种质疑后出台的，这些所谓的质疑包括它们的数据收集和数据处理方法，以及围绕数据安全和隐私的问题。<BR /><BR />　　《印度时报》在报道中也提到此事称，自去年6月起，印度政府已对267款应用程序(不同批次)采取了“前所未有的”行动。印度电子信息技术部去年6月29日宣布，禁止包括TikTok、微信、微博在内的59款中国应用。7月28日，印度电子信息技术部称印度政府已决定开展第二轮禁用中国网络程序的决定，该禁令涉及47个中国公司开发的程序。同年9月2日，印度电子和信息技术部又发布公告，宣布禁用百度搜索等118款中国手机应用程序。之后的11月24日，印度电子和信息技术部再次发布公告，宣布禁用全球速卖通、钉钉等43款中国背景手机应用程序。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/01/indian-ban-chinese-apps.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Wed, 27 Jan 2021 15:34:57 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/01/indian-ban-chinese-apps.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/01/indian-ban-chinese-apps.txt]]></guid>
</item>
<item>
<title><![CDATA[谷歌威胁撤出澳大利亚]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/01/google-australia.txt]]></link>
<description><![CDATA[据英国广播公司（BBC）22日报道，澳大利亚正准备颁布一项法律，强制大型网络企业与当地新闻出版商分享版税，这份立法草案建议让谷歌、脸书甚至更多科企必须先向媒体机构付钱，才能展示新闻内容。报道称，新法规被视为政府如何监管大型科技公司的一个可能的全球测试案例。对此，美国网络巨头谷歌警告，一旦新法落实，该公司将中断澳大利亚的搜索引擎服务。<BR /><BR />　　当地时间22日，谷歌澳大利亚董事总经理梅尔席尔瓦在参议院听证会上说，澳大利亚的这项法案“行不通”。 她说：“如果该法案成为法律，它将使我们别无选择，只能停止在澳大利亚提供谷歌搜索的服务。”席尔瓦女士表示，澳大利亚要求谷歌为链接和搜索结果付费，将是“一个站不住脚的先例”。 她认为，这与互联网的运作方式是不兼容的。<BR /><BR />　　在同一场听证会上，脸书也再次抨击了这一法案。脸书亚太区公共政策副总裁西蒙米尔纳（Simon Milner）指责它“对澳大利亚新闻产业的投资造成了威胁”。他引用万维网发明者蒂姆·伯纳斯·李 （Tim Berners-Lee）的话说，这一法律所开的先例可能会“让全世界都无法使用网络”。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/01/google-australia.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Fri, 22 Jan 2021 17:21:56 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/01/google-australia.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/01/google-australia.txt]]></guid>
</item>
<item>
<title><![CDATA[深圳房产总值可买下半个美国]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/01/shenzhen-house-prices-buys-half-usa.txt]]></link>
<description><![CDATA[经济日报统计，现在把深圳所有房屋按市价卖掉，大概有151万亿人民币，美国股市市值大概在31.3万亿美元，折合人民币203万亿人民币，因此可以买下半个美国。按照房产专家预测，未来深圳房价可以达到每平米30万以上，届时，一个深圳房价市值，超过整个美国市值还有余。<BR /><BR />　　当年中国全国楼市总市值约594.05万亿人民币，约92.82万亿美元，美国的房屋总市值是31.8万亿美元，因此，卖掉中国所有房子可以购买三个美国。<BR /><BR />　　看到这个新闻，有没有觉得很熟悉。没错，以前日本房地产泡沫巅峰期的时候，人们也常说，卖掉东京能买下整个美国。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/01/shenzhen-house-prices-buys-half-usa.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Mon, 18 Jan 2021 17:43:59 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/01/shenzhen-house-prices-buys-half-usa.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/01/shenzhen-house-prices-buys-half-usa.txt]]></guid>
</item>
<item>
<title><![CDATA[特朗普签令封杀支付宝等8款中国应用软件]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/01/.txt]]></link>
<description><![CDATA[　路透社最新独家消息称，美国总统特朗普当地时间5日签署行政命令，禁止与包括支付宝在内的8款中国应用软件进行交易。报道称，此举旨在遏制中国软件应用对美国人构成的威胁。<BR /><BR />　　据美媒报道，美国商务部长罗斯确定的列入行政令禁止范围的软件应用包括：支付宝、扫描全能王、QQ钱包、茄子快传、腾讯QQ、VMate、微信支付和WPS Office。<BR /><BR />　　据路透社（Reuters）报道，一位美国官员认为，这次的情况与特朗普在2020年8月签署的针对抖音和微信的行政命令非常相似，而该项禁令已经被美国法院冻结，“特朗普政府禁止的任何新交易都可能面临类似的法律挑战”。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2021/01/.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Wed, 06 Jan 2021 11:03:55 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/01/.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2021/01/.txt]]></guid>
</item>
<item>
<title><![CDATA[人民日报再评“阿里涉嫌垄断被调查”]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/12/alibaba.txt]]></link>
<description><![CDATA[12月24日，阿里巴巴集团发布公告称，今日，阿里巴巴接到国家市场监管总局通知，依法对阿里巴巴涉嫌垄断行为立案调查。阿里巴巴将积极配合监管部门调查。目前公司业务一切正常。<BR /><BR />　　同日，蚂蚁集团发布公告称，今日收到监管部门的约谈通知，将认真学习和严格遵从监管部门的要求，不折不扣地做好相关工作的落实。<BR /><BR />　　近日，阿里巴巴集团控股有限公司因“二选一”等涉嫌垄断行为，被市场监管总局依法立案调查。此举受到全社会广泛关注，也引发了人们对于平台经济发展的思考。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/12/alibaba.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Fri, 25 Dec 2020 21:01:52 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/12/alibaba.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/12/alibaba.txt]]></guid>
</item>
<item>
<title><![CDATA[Pornhub一夜下架八百八十万视频]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/12/pornhub-down-videos.txt]]></link>
<description><![CDATA[早些时候，《纽约时报》在一篇报道中详细介绍了在Pornhub网站上存在大量的未成年人视频和儿童被侵犯的视频。新闻曝光后，信用卡公司Visa和万事达暂停了其服务后，Pornhub网站开始删除所有未经核实的用户上传到其网站的视频，从2021年开始，所有之前上传的视频都会被撤下，等待验证和审查。目前Pornhub已下架超过880万个视频，该网站共有1350万个视频。<BR /><BR />　　《纽约时报》的早前报道中，提到了现年19岁的受害者。她曾于14岁时因迷恋某个男孩，而将自己的裸露视频分享给了对方，结果最终看到自己出现在了Pornhub网站上。<BR /><BR />　　新闻曝光后，Pornhub网站宣布了一套新政策，以将此类未经当事人许可的视频拒之于门外。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/12/pornhub-down-videos.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 15 Dec 2020 13:37:40 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/12/pornhub-down-videos.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/12/pornhub-down-videos.txt]]></guid>
</item>
<item>
<title><![CDATA[美国华人工程师被判38个月监禁]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/11/raytheon.txt]]></link>
<description><![CDATA[当地时间11月18日，美国司法部发布消息称，一名在美国军工巨头雷神公司（Raytheon）工作的美籍华人工程师，只因携带公司电脑到中国等国家旅游，就被指控违反美国武器出口管制法案。他试图提出无罪抗辩，但最终还是向美国法院低头，被判38个月监禁。<BR /><BR />　　根据美国司法部的公告，这名工程师名叫孙伟（Wei Sun，音译），现年49岁，原为中国公民，后加入美国国籍。他作为电气工程师在美国军工企业雷神公司工作了10年，该公司负责为美国军方开发、生产导弹系统。<BR /><BR />　　检察官称，孙伟于2018年12月至2019年1月到中国旅游，期间携带了一台公司的电脑。美司法部称，这台公司电脑中存储有美国政府管制的技术信息，这些技术资料被美国定义为“国防数据”，未经美国政府许可不得出口。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/11/raytheon.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Sat, 21 Nov 2020 16:04:01 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/11/raytheon.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/11/raytheon.txt]]></guid>
</item>
<item>
<title><![CDATA[阿里巴巴美股投资者发起集体诉讼]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/11/ant-alibaba.txt]]></link>
<description><![CDATA[11月14日，北京郝俊波律师事务所通过官方微信公号透露，阿里巴巴因证券欺诈案已经于近日被美股投资者诉至法院，在目前的诉讼中，投资者指控阿里巴巴公司在2020年10月21日至2020年11月3日的业务和运营状况及发展前景进行虚假陈述，未向投资者披露涉及蚂蚁集团的重大不利事实。<BR /><BR />　　据该报道称，投资者指控阿里巴巴公司在2020年10月21日至2020年11月3日期间就公司的业务和运营状况及发展前景进行虚假陈述，未向投资者披露以下重大不利事实:<BR /><BR />　　(1) 蚂蚁集团不满足上市要求或就某些重大事项未进行充分披露;<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/11/ant-alibaba.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 15 Nov 2020 17:40:02 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/11/ant-alibaba.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/11/ant-alibaba.txt]]></guid>
</item>
<item>
<title><![CDATA[云计算十年：序章，拐点，生死战]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/11/cloud-computing-war.txt]]></link>
<description><![CDATA[2009年，首届“中国云计算大会”在北京举办。虽然冠以“中国”，然而论坛上参与主题演讲的企业代表几乎清一色全部是思科、微软、IBM、英特尔这样的国外企业。<BR /><BR />同期的《互联网周刊》封面文章“云计算第三代”对此的描述是：<BR /><BR />“当演讲台上各大巨头津津乐道于自己所取得的云计算成就时，坐在台下的很多国内本土企业更像是它们的拥趸。”<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/11/cloud-computing-war.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Fri, 13 Nov 2020 16:54:34 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/11/cloud-computing-war.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/11/cloud-computing-war.txt]]></guid>
</item>
<item>
<title><![CDATA[“公司决定允许员工自愿降薪”引热议]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/11/salary-decrease.txt]]></link>
<description><![CDATA[近日，“公司决定允许员工自愿降薪”引热议，截图对话显示，“今年公司效益良好，利润有较大增长。公司决定，允许员工自愿申请每月降低待遇的10%”。据记者采访得知，该截图对话的员工已离职。另有多名该公司员工向记者透露，“自愿降薪”言论为公司的服从性/忠诚度测试，类似测试在公司每年都会发生。（11月7日 红星新闻）<BR /><BR />　　“自愿降薪”四字一出，众多网友表示：“公司效益良好，所以员工自愿降薪，这个逻辑过于离谱。”就该公司说法来看，员工自愿降薪是对其忠诚度的测试，也是非常好的共渡疫情的模式，而且降低月薪的同时实际上提高了年终奖。然而，该说法本身就很吊诡。如果提高的年终奖难以弥补员工所降之薪，那么实际上还是降薪，所谓提高了年终奖只不过是个美丽的误会。如果提高的年终奖幅度超过了员工所降之薪，那么又何必多此一举，来个先降后涨？<BR /><BR />　　而且，员工工作本就是为了实现自我价值的同时获得自己应得利益，尽管在疫情期间存在部分公司通过降薪以共渡难关的案例，但也不能以忠诚度测试为由模糊“公司效益良好，允许员工自愿降薪”一行为对员工的侵犯，让员工陷入自愿降薪利益受损，不自愿降薪可能面临其他刁难的困境。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/11/salary-decrease.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 08 Nov 2020 20:59:57 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/11/salary-decrease.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/11/salary-decrease.txt]]></guid>
</item>
<item>
<title><![CDATA[微软允许员工永久在家办公]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/microsoft-allow-work-from-home.txt]]></link>
<description><![CDATA[据美国科技媒体The Verge报道，微软允许员工每周不超过50%的工作时间在家工作，经过经理批准后可以永久进行远程工作。微软强调，一些职位仍然需要来公司办公室上班，包括那些有关硬件实验室、数据中心和现场培训的职位。<BR /><BR />　　而就在几个月前，微软CEO萨提亚·纳德拉还在接受纽约时报采访时称，永久性在家办公会影响社交互动和心理健康。<BR /><BR />　　可是随着疫情的扩散，几乎所有的美国科技公司和全世界的科技行业都采取了员工在家工作的模式。一些公司在疫情期间甚至给员工报销了购买个人电脑等硬件的费用，另外还调整了公司的信息系统，适应员工远程工作的模式。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/10/microsoft-allow-work-from-home.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 18 Oct 2020 15:51:09 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/microsoft-allow-work-from-home.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/microsoft-allow-work-from-home.txt]]></guid>
</item>
<item>
<title><![CDATA[谷歌前总裁：美国必须在人工智能上击败中国]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/google-ai-beat-china.txt]]></link>
<description><![CDATA[据美国政治新闻网15日报道，谷歌前总裁、现任美国国防创新咨询委员会主席埃里克施密特(Eric Schmidt)表示：美国迫切需要一项发展人工智能技术的国家战略，以应对来自中国的日益激烈的竞争，美国必须遵守“不惜一切代价”的原则在人工智能上击败中国，支配全球人工智能竞争。<BR /><BR />　　周四，在美国政治新闻网主办的人工智能峰会上接受记者采访时，施密特概述了对抗“亚洲超级大国”在人工智能领域崛起的建议。施密特说：“美国缺乏一种‘不惜一切代价’的原则来推动和支配全球人工智能竞争。我们希望由美国来发明这种东西（人工智能技术），或至少让西方国家来进行。”<BR /><BR />　　文章称，针对中国在人工智能领域的发展，特别是在军事领域，施密特曾对美国国内不断发出警告。施密特周四表示，为了应对这一“威胁”，美国应该在研究、伦理和人工智能基础设施方面投入更多资金，并与加拿大、英国、以色列和日本等国合作。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/10/google-ai-beat-china.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Sat, 17 Oct 2020 12:50:27 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/google-ai-beat-china.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/google-ai-beat-china.txt]]></guid>
</item>
<item>
<title><![CDATA[Twitter更改受黑客攻击材料政策]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/twitter-hacker.txt]]></link>
<description><![CDATA[Twitter将更改其受黑客攻击材料政策，此前该公司周三屏蔽《纽约邮报》(New York Post)一篇有关亨特·拜登(Hunter Biden)的文章之举引起轩然大波。此举引起了保守派的愤怒，他们声称Twitter带有偏见，并对该文章进行了审查。<BR /><BR />　　在周四晚间的一系列推文中，Twitter全球法律、政策以及信任和安全主管加德(Vijaya Gadde)表示：“昨天，我们收到了关于我们如何执行黑客攻击材料政策的重要反馈——包括批评和支持。在对这些反馈进行反思后，我们决定对该项政策及其执行方式做出改变。”<BR /><BR />　　两大变化如下：Twitter将不再删除被黑客攻击的内容，除非这些内容是由黑客或与黑客合作的人员直接分享的；Twitter将标记推文以提供背景信息，而不是阻止链接被共享。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/10/twitter-hacker.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Sat, 17 Oct 2020 12:32:10 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/twitter-hacker.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/twitter-hacker.txt]]></guid>
</item>
<item>
<title><![CDATA[苹果应用商店收入为谷歌两倍]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/google-apple-store.txt]]></link>
<description><![CDATA[　　据 Sensor Tower 的新数据显示，2020 年第三季度，苹果 App Store 产生的收入再次几乎是谷歌 Play Store 的两倍。三季度全球消费者在 App Store 上应用内购买、订阅和一次性应用购买的支出上升到 190 亿美元，同比增长 31%。相比之下，谷歌的 Play Store 同期增长 34%，达 103 亿美元。<BR /><BR />　　整体来看，两个应用商店营收比去年的 222 亿美元多出 32%，而安装量增长 23.3%，达到 365 亿。<BR /><BR />　　App 安装量方面，App Store 实现了 2.5% 的增长，估计有 82 亿的安装量，而 Play Store 的增长则蓬勃发展，有 283 亿的安装量，同比增长 31%。尽管首次安装量大增，但作为一个赚钱平台，Android 还是远远落后于 iOS。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/10/google-apple-store.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 04 Oct 2020 14:39:36 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/google-apple-store.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/google-apple-store.txt]]></guid>
</item>
<item>
<title><![CDATA[华为被禁用后，诺基亚拿下英国5G]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/nokia-5g.txt]]></link>
<description><![CDATA[华为被禁用后，诺基亚拿下英国5G<BR />　　据美国消费者新闻与商业频道(CNBC)报道，9月28日，诺基亚宣布与英国最大电信运营商——英国电信集团(BT)签署了一项重要的5G设备供应协议。知情人士透露，根据协议，诺基亚将为英国电信11600处无线电站点提供5G设备与服务。<BR />　　诺基亚总裁兼首席执行官佩卡·伦德马克(PekkaLundmark)在声明中表示：“我们两家公司已经合作了25年以上，我们向英国各地的人们提供了一流的网络连接服务。我们很自豪能够支持英国电信的5G网络发展，并期待在未来的几年里实现更加紧密的合作。”<BR />　　英国电信集团首席执行官菲利普·詹森(Philip Jansen)也发表声明称：“在一个快速发展、竞争激烈的市场，做出正确的技术选择至关重要。”<BR />　　诺基亚公司表示，该协议将使诺基亚成为英国电信最大的基础设施合作伙伴，而业内消息人士向CNBC透露，诺基亚将占据英国电信网络63%的份额。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/10/nokia-5g.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Thu, 01 Oct 2020 08:39:03 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/nokia-5g.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/10/nokia-5g.txt]]></guid>
</item>
<item>
<title><![CDATA[腾讯建议推出美国版微信]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/wechat-usa-version.txt]]></link>
<description><![CDATA[　　据报道，腾讯近日提交给美国政府的和解建议曝光。美国司法部向法院提供的一份文件显示，为缓解美国政府的担忧，腾讯已提出一系列调整措施，其中包括开发一款“美国版微信”，设立相关措施来保证“美国版微信”源代码的安全，通过与美国云服务合作伙伴来存储美国用户的数据，通过设在美国的一家实体来管理“美国版微信”。<BR /><BR />　　这份报告首次披露了腾讯在最近私下向美国政府提出了多条和解建议，这些建议是为了消除美国政府对于美国微信用户数据安全的担忧。为了打消美国政府对美国用户数据安全的担忧，腾讯提出了以下解决方案：<BR /><BR />创建美国版微信APP专供美国用户使用<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/09/wechat-usa-version.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Mon, 28 Sep 2020 10:05:29 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/wechat-usa-version.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/wechat-usa-version.txt]]></guid>
</item>
<item>
<title><![CDATA[我游戏创业失败的教训]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/game-startup-lessons.txt]]></link>
<description><![CDATA[记得2014年的时候，我在一家北欧公司CCP做着次时代PS3/PC相关的游戏引擎研发，我们引擎组的老大是来自英国的一位大牛，曾经是GTA的一位引擎leader。CCP当时在研发氛围，还是福利等方面在行业中绝对是数一数二的，另外技术实力也非常厉害，我们当时把UE3的渲染框架和算法改了个底朝天，就是为了适应我们当时的一款游戏：EVE-Dust514。<BR /><BR />那时候外企的经验还是非常吃香的，不像现在，随着外企的陆续关门，外企的背景跟国内大厂的相比还是占弱势。但是，无论现实有多好，还是拗不过年轻的冲动，看到14年手游市场的逐渐火爆，我跟朋友几次碰面后，毅然决然决定离职创业。<BR /><BR />我们合伙人共有4位，美术是CCP的，另外两位是来自腾讯：一位策划，一位服务端，我是作为客户端和引擎加入，对于前期的研发，这个配置还是比较豪华的。但是我们当时4人并不是互相都认识，我认识美术，美术认识策划，策划认识服务端，大家互相不熟悉，所以这也是对后面的发展有一定的副作用。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/09/game-startup-lessons.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=4">Category:Success&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 27 Sep 2020 06:27:42 +0000</pubDate>
<category><![CDATA[Success]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/game-startup-lessons.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/game-startup-lessons.txt]]></guid>
</item>
<item>
<title><![CDATA[苹果暂免脸书在线产品30%分成]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/apple-facebook.txt]]></link>
<description><![CDATA[美东时间25日，Facebook表示，苹果已经同意，除游戏创作者外，允许因为新冠肺炎疫情被迫通过Facebook App在线上开展付费活动的小企业，无需支付30%的苹果App Store交易收入抽成，对这种苹果税的豁免期为三个月，即到今年年底，2021年将重新开始征收。<BR /><BR />　　这意味着，对那些利用Facebook Pay系统处理支付的小企业来说，直到今年末，他们都不用将自家iPhone App获得的部分收入交给苹果。<BR /><BR />　　苹果此后确认，共享租房平台Airbnb和健身课程订购平台ClassPass也得到了Facebook这样的豁免。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/09/apple-facebook.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 27 Sep 2020 06:26:37 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/apple-facebook.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/apple-facebook.txt]]></guid>
</item>
<item>
<title><![CDATA[美国法官暂停美商务部WeChat下架命令]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/suspent-wechat-ban.txt]]></link>
<description><![CDATA[据《华尔街日报》等多家媒体报道，加州联邦法官劳雷尔·比勒20日下达命令，要求发出初步禁令，以阻止美国商务部禁止下载WeChat的行政命令于20日23时59分生效。商务部18日发布的行政令禁止20日后在美国境内与WeChat有关的交易。《纽约时报》称，鉴于该法官的裁决，相关禁令在20日晚不会生效。<BR /><BR />　　另据CNBC报道，美国加州地方法官比勒（Laurel Beeler）20日在一份命令中称，提起诉讼的WeChat用户“对第一修正案的价值提出了严重质疑，权衡利害后，倾向原告一方”。报道称，比勒的初步禁令阻止了美国商务部的禁令，美国商务部对此没有立即置评，而WeChat用户联盟则称赞该裁决是“美国WeChat用户的一项重要而艰辛的胜利”。<BR /><BR />　　美联社称，比勒法官的裁决是应一组微信用户的请求下达的。比勒法官认为，美政府的行动将影响用户的第一修正案权利，针对WeChat的禁令抹杀了他们的交流平台。该法官还认为，美政府有关微信构成“国家安全威胁”的具体证据也“很不突出”。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/09/suspent-wechat-ban.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Mon, 21 Sep 2020 09:28:48 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/suspent-wechat-ban.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/suspent-wechat-ban.txt]]></guid>
</item>
<item>
<title><![CDATA[苹果公司进入“技术性熊市”]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/apple.txt.txt]]></link>
<description><![CDATA[苹果公司进入“技术性熊市”<BR />　　苹果在短短12个交易日内，已从高点回调超22%，跌入技术性熊市。市值蒸发5333亿美金左右，约合3.6万亿人民币。苹果公司宣布1：4拆股后股价在8月份大幅飙升，成为首家市值突破2万亿美元的美国公司。此后该公司股价一路下滑，而最新秋季发布会上5G新款iPhone的缺席也令市场大失所望。<BR /><BR />　　在过去几周中，苹果公司股价的疲软也正值科技股遭到广泛抛售，纳斯达克综合指数已跌入修正区域，较历史高点下跌了10%以上。一些投资者认为，对科技巨头的抛售来自对过高过快增长的高估值的担忧。<BR /><BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/09/apple.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Sat, 19 Sep 2020 13:29:45 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/apple.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/apple.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[百度海微软声明字节跳动拒绝了微软收购外推网盘：1TB不限速、禁止中国用户访问]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/byte-dance-rejects-microsoft.txt]]></link>
<description><![CDATA[9月14日消息，据微软官方和涉及Tiktok出售资产谈判的知情人士称，Tiktok的母公司字节跳动已拒绝了微软收购Tiktok美国业务的要约。<BR /><BR />　　微软被认为是从字节跳动手中收购TikTok美国业务的最有钱的美国科技公司。此举使甲骨文成为TikTok唯一公开的剩余竞购者。<BR /><BR />　　甲骨文是少数几家公开与美国总统特朗普结盟的硅谷公司之一。参与谈判的人士称，字节跳动已表示，甲骨文将成为其“技术合作伙伴”，但尚不清楚这是否意味着它也将获得该应用的多数股权。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/09/byte-dance-rejects-microsoft.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 15 Sep 2020 10:56:47 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/byte-dance-rejects-microsoft.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/byte-dance-rejects-microsoft.txt]]></guid>
</item>
<item>
<title><![CDATA[百度海外推网盘：1TB不限速、禁止中国用户访问]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/baidu-dubox.txt.txt.txt.txt]]></link>
<description><![CDATA[最近，百度旗下公司Popin在海外推出了一款名为“Dubox”的网盘产品，无论容量还是速度都碾压国内的百度网盘。<BR /><BR />　　据介绍，Dubox网盘完全免费，空间为 1TB (单文件最大 4GB)，据宣传其是高度安全的网络云存储，号称永不会丢失数据，支持自动备份，而最重要的一点是，Dubox完全不限速!根据网友的实际测试，可以看到上传下载能轻松达到 33 MB/s 之快。<BR /><BR />　　不过，该产品仅面向海外市场，暂时不对中国用户开放注册，内地用户是无法访问的，直接提示当前区域不可用。网盘的账号注册也提供了 FaceBook 账号，Google 账号，Apple ID 账号登录.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/09/baidu-dubox.txt.txt.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 15 Sep 2020 10:55:03 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/baidu-dubox.txt.txt.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/09/baidu-dubox.txt.txt.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[Kaprekar]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/kaprekar.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Facebook:<BR /><BR />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.<BR /><BR />This certain function is as follows:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/kaprekar.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Mon, 03 Feb 2020 19:23:39 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/kaprekar.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/kaprekar.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[Making a Height Balanced Binary Search Tree]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/making-a-height-balanced-binary-search-tree.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Google:<BR /><BR />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.<BR /><BR />Here's some code to start with:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/making-a-height-balanced-binary-search-tree.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 21:02:42 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/making-a-height-balanced-binary-search-tree.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/making-a-height-balanced-binary-search-tree.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[Staying on a Chess Board]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/staying-on-a-chess-board.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Google:<BR /><BR />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.<BR /><BR />Here's some starter code:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/staying-on-a-chess-board.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 21:01:59 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/staying-on-a-chess-board.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/staying-on-a-chess-board.txt]]></guid>
</item>
<item>
<title><![CDATA[Multitasking]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/multitasking.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by AirBNB:<BR /><BR />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.<BR /><BR />Given a list of tasks, find how long it will take to complete the tasks in the order they are input.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/multitasking.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 21:01:30 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/multitasking.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/multitasking.txt]]></guid>
</item>
<item>
<title><![CDATA[Sort a Partially Sorted List]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/sort-a-partially-sorted-list.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Uber:<BR /><BR />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)<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/sort-a-partially-sorted-list.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 21:01:10 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/sort-a-partially-sorted-list.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/sort-a-partially-sorted-list.txt]]></guid>
</item>
<item>
<title><![CDATA[Most Frequent Subtree Sum]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/most-frequent-subtree-sum.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by LinkedIn:<BR /><BR />Given a binary tree, find the most frequent subtree sum.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/most-frequent-subtree-sum.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 21:00:46 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/most-frequent-subtree-sum.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/most-frequent-subtree-sum.txt]]></guid>
</item>
<item>
<title><![CDATA[Fix Brackets]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/fix-brackets.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Twitter:<BR /><BR />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.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/fix-brackets.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 21:00:04 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/fix-brackets.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/fix-brackets.txt]]></guid>
</item>
<item>
<title><![CDATA[Palindrome Integers]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/palindrome-integers.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Twitter:<BR /><BR />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.<BR /><BR />import math<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/palindrome-integers.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:59:37 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/palindrome-integers.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/palindrome-integers.txt]]></guid>
</item>
<item>
<title><![CDATA[Print a tree level-by-level, with line-breaks]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/print-a-tree-level-by-level,-with-line-breaks.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Apple:<BR /><BR />You are given a tree, and your job is to print it level-by-level with linebreaks.<BR /><BR />    a<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/print-a-tree-level-by-level,-with-line-breaks.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:59:06 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/print-a-tree-level-by-level,-with-line-breaks.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/print-a-tree-level-by-level,-with-line-breaks.txt]]></guid>
</item>
<item>
<title><![CDATA[Spreadsheet Columns]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/spreadsheet-columns.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Apple:<BR /><BR />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.<BR /><BR />Given a number n, find the n-th column name.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/spreadsheet-columns.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:58:32 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/spreadsheet-columns.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/spreadsheet-columns.txt]]></guid>
</item>
<item>
<title><![CDATA[Generate All IP Addresses]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/generate-all-ip-addresses.txt]]></link>
<description><![CDATA[i, here's your problem today. This problem was recently asked by Microsoft:<BR /><BR />An IP Address is in the format of A.B.C.D, where A, B, C, D are all integers between 0 to 255.<BR /><BR />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.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/generate-all-ip-addresses.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:58:04 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/generate-all-ip-addresses.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/generate-all-ip-addresses.txt]]></guid>
</item>
<item>
<title><![CDATA[Consecutive Ones]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/consecutive-ones.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Microsoft:<BR /><BR />Return the longest run of 1s for a given integer n's binary representation.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/consecutive-ones.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:57:33 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/consecutive-ones.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/consecutive-ones.txt]]></guid>
</item>
<item>
<title><![CDATA[Spreadsheet Column Title]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/spreadsheet-column-title.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Amazon:<BR /><BR />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.<BR />Examples:<BR />Input: 26<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/spreadsheet-column-title.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:57:00 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/spreadsheet-column-title.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/spreadsheet-column-title.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[Compare Version Numbers]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/compare-version-numbers.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Amazon:<BR /><BR />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:<BR />If version1 > version2 return 1.<BR />If version1 < version2 return -1.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/compare-version-numbers.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:56:26 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/compare-version-numbers.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/compare-version-numbers.txt]]></guid>
</item>
<item>
<title><![CDATA[Reverse a Directed Graph]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/reverse-a-directed-graph.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Facebook:<BR /><BR />Given a directed graph, reverse the directed graph so all directed edges are reversed.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/reverse-a-directed-graph.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:55:43 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/reverse-a-directed-graph.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/reverse-a-directed-graph.txt]]></guid>
</item>
<item>
<title><![CDATA[Absolute Path]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/absolute-path.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Facebook:<BR /><BR />Given a file path with folder names, '..' (Parent directory), and '.' (Current directory), return the shortest possible file path (Eliminate all the '..' and '.').<BR /><BR />Example<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/absolute-path.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:55:09 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/absolute-path.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/absolute-path.txt]]></guid>
</item>
<item>
<title><![CDATA[Design Tic-Tac-Toe]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/design-tic-tac-toe.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Google:<BR /><BR />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:<BR /><BR />Given n = 3, assume that player 1 is "X" and player 2 is "O" <BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/design-tic-tac-toe.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:54:33 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/design-tic-tac-toe.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/design-tic-tac-toe.txt]]></guid>
</item>
<item>
<title><![CDATA[Top K Frequent words]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/top-k-frequent-words.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by AirBNB:<BR /><BR />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.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/top-k-frequent-words.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:53:43 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/top-k-frequent-words.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/top-k-frequent-words.txt]]></guid>
</item>
<item>
<title><![CDATA[Detect Linked List Cycle]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/detect-linked-list-cycle.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Uber:<BR /><BR />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.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/detect-linked-list-cycle.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:53:03 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/detect-linked-list-cycle.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/detect-linked-list-cycle.txt]]></guid>
</item>
<item>
<title><![CDATA[Plus One]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/plus-one.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by LinkedIn:<BR /><BR />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'.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/plus-one.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:52:23 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/plus-one.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/plus-one.txt]]></guid>
</item>
<item>
<title><![CDATA[Find Missing Numbers in an Array]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/find-missing-numbers-in-an-array.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Twitter:<BR /><BR />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.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/find-missing-numbers-in-an-array.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:51:43 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/find-missing-numbers-in-an-array.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/find-missing-numbers-in-an-array.txt]]></guid>
</item>
<item>
<title><![CDATA[Binary Tree Level with Minimum Sum]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/binary-tree-level-with-minimum-sum.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Twitter:<BR /><BR />You are given the root of a binary tree. Find the level for the binary tree with the minimum sum, and return that value.<BR /><BR />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.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/02/binary-tree-level-with-minimum-sum.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 02 Feb 2020 20:50:57 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/binary-tree-level-with-minimum-sum.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/02/binary-tree-level-with-minimum-sum.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/lowest-common-ancestor-of-2-nodes-in-binary-tree.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Apple:<BR /><BR />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.<BR /><BR /><BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/lowest-common-ancestor-of-2-nodes-in-binary-tree.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 20:06:55 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/lowest-common-ancestor-of-2-nodes-in-binary-tree.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/lowest-common-ancestor-of-2-nodes-in-binary-tree.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview: Shifted String]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/shifted-string.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Apple:<BR /><BR />You are given two strings, A and B. Return whether A can be shifted some number of times to get B.<BR /><BR />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.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/shifted-string.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 20:06:20 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/shifted-string.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/shifted-string.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview: Level Order Traversal of Binary Tree]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/level-order-traversal-of-binary-tree.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Microsoft:<BR /><BR />Given the root of a binary tree, print its level-order traversal. For example:<BR /><BR /><BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/level-order-traversal-of-binary-tree.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 20:05:43 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/level-order-traversal-of-binary-tree.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/level-order-traversal-of-binary-tree.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview: Determine If Linked List is Palindrome]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/determine-if-linked-list-is-palindrome.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Microsoft:<BR /><BR />You are given a doubly linked list. Determine if it is a palindrome.<BR /><BR />Can you do this for a singly linked list?<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/determine-if-linked-list-is-palindrome.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 20:05:04 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/determine-if-linked-list-is-palindrome.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/determine-if-linked-list-is-palindrome.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview: Subarray With Target Sum]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/subarray-with-target-sum.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Amazon:<BR /><BR />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.<BR /><BR /><BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/subarray-with-target-sum.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 20:04:22 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/subarray-with-target-sum.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/subarray-with-target-sum.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview: Longest Consecutive Sequence]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/longest-consecutive-sequence.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Amazon:<BR /><BR />You are given an array of integers. Return the length of the longest consecutive elements sequence in the array.<BR /><BR />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.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/longest-consecutive-sequence.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 20:03:50 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/longest-consecutive-sequence.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/longest-consecutive-sequence.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview: Permutations of numbers]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/permutations-of-numbers.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Facebook:<BR /><BR />You are given an array of integers. Return all the permutations of this array.<BR /><BR /><BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/permutations-of-numbers.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 20:03:21 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/permutations-of-numbers.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/permutations-of-numbers.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview: Maximum Path Sum in Binary Tree]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/maximum-path-sum-in-binary-tree.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Facebook:<BR /><BR />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.<BR /><BR /><BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/maximum-path-sum-in-binary-tree.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 20:02:51 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/maximum-path-sum-in-binary-tree.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/maximum-path-sum-in-binary-tree.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview: Smallest Number that is not a Sum of a Subset of List]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/smallest-number-that-is-not-a-sum-of-a-subset-of-list.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by AirBNB:<BR /><BR />Given a sorted list of positive numbers, find the smallest positive number that cannot be a sum of any subset in the list.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/smallest-number-that-is-not-a-sum-of-a-subset-of-list.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 20:02:13 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/smallest-number-that-is-not-a-sum-of-a-subset-of-list.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/smallest-number-that-is-not-a-sum-of-a-subset-of-list.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview: Make the Largest Number]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/make-the-largest-number.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Uber:<BR /><BR />Given a number of integers, combine them so it would create the largest number.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/make-the-largest-number.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 20:01:16 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/make-the-largest-number.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/make-the-largest-number.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview: No Adjacent Repeating Characters]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/no-adjacent-repeating-characters.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by LinkedIn:<BR /><BR />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.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/no-adjacent-repeating-characters.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 19:58:47 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/no-adjacent-repeating-characters.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/no-adjacent-repeating-characters.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview: String Compression]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/string-compression.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Twitter:<BR /><BR />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.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/string-compression.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 19:58:12 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/string-compression.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/string-compression.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview: Convert Roman Numerals to Decimal]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/convert-roman-numerals-to-decimal.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Twitter:<BR /><BR />Given a Roman numeral, find the corresponding decimal value. Inputs will be between 1 and 3999.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/convert-roman-numerals-to-decimal.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 19:56:17 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/convert-roman-numerals-to-decimal.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/convert-roman-numerals-to-decimal.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview Question: Find the Single Element in an Array of Duplicates]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/find-the-single-element-in-an-array-of-duplicates.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Apple:<BR /><BR />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.<BR />Example:<BR />Input: arr = [7, 3, 5, 5, 4, 3, 4, 8, 8]<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/find-the-single-element-in-an-array-of-duplicates.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 19:55:15 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/find-the-single-element-in-an-array-of-duplicates.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/find-the-single-element-in-an-array-of-duplicates.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview Question: Nth Fibonacci Number]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/nth-fibonacci-number.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Apple:<BR /><BR />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:<BR /><BR />0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144...<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/nth-fibonacci-number.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 19:53:58 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/nth-fibonacci-number.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/nth-fibonacci-number.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview Question: Max and Min with Limited Comparisons]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/max-and-min-with-limited-comparisons.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Microsoft:<BR /><BR />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.<BR /><BR />Here's a start:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/max-and-min-with-limited-comparisons.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 19:53:17 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/max-and-min-with-limited-comparisons.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/max-and-min-with-limited-comparisons.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview Question: Symmetric k-ary Tree]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/symmetric-k-ary-tree.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Microsoft:<BR /><BR />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.<BR /><BR />Here's an example of a symmetrical k-ary tree.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/symmetric-k-ary-tree.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 19:52:41 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/symmetric-k-ary-tree.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/symmetric-k-ary-tree.txt]]></guid>
</item>
<item>
<title><![CDATA[Algorithm Interview Question: H-Index]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/h-index.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Amazon:<BR /><BR />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.<BR /><BR />Given a list of publications of the number of citations a scholar has, find their h-index.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/h-index.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 12 Jan 2020 19:51:36 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/h-index.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/h-index.txt]]></guid>
</item>
<item>
<title><![CDATA[IT/互联网产业最好的十年：再见，2010年代！]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/.txt]]></link>
<description><![CDATA[10年前，站在新十年的门槛上，我在我的blog上抄录了诗人食指的诗《相信未来》：<BR /><BR />当蜘蛛网无情地查封了我的炉台，<BR /><BR />当灰烬的余烟叹息着贫穷的悲哀，<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2020/01/.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=9">Category:News&gt;&gt;</a><BR />]]></description>
<pubDate>Wed, 01 Jan 2020 13:39:06 +0000</pubDate>
<category><![CDATA[News]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2020/01/.txt]]></guid>
</item>
<item>
<title><![CDATA[Python才是世界上最好的语言]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/python-is-the-best.txt]]></link>
<description><![CDATA[　　不同的编程有不同的应用场景和不同的使用场合，因此无法全面的评论哪种语言是最好的。但是各种不同的媒介还是每隔一段时间都会发布编程语言的热度排行榜。前不久电气和电子工程师协会（ IEEE）发布了顶级编程语言交互排行榜。Python超越Java高居首位。<BR /><BR />　　为什么Python在IEEE Spectrum的调查里面这么受欢迎呢？<BR /><BR />　　一个原因就是Python现在已经逐渐受到嵌入式的支持。放在以前，受到嵌入式硬件的限制，一般只能支持一些编译语言。但是现在随着嵌入式硬件变得越来越强大，他的硬件能力足以支撑起Python的运行。而Python对于一些特定的嵌入式应用场景可以非常简单、方便、快速的搭建起可运行系统。因此，Python现在在嵌入式圈子里逐渐得到应用并且火了起来。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/python-is-the-best.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Thu, 26 Dec 2019 10:33:54 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/python-is-the-best.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/python-is-the-best.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Jump to the End]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/jump-to-the-end.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Facebook:<BR /><BR />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.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/jump-to-the-end.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 24 Dec 2019 21:37:15 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/jump-to-the-end.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/jump-to-the-end.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Circle of Chained Words]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/circle-of-chained-words.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Facebook:<BR /><BR />Two words can be 'chained' if the last character of the first word is the same as the first character of the second word.<BR /><BR />Given a list of words, determine if there is a way to 'chain' all the words in a circle.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/circle-of-chained-words.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 24 Dec 2019 21:36:26 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/circle-of-chained-words.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/circle-of-chained-words.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Decode String]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/decode-string.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Google:<BR /><BR />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.<BR /><BR />Your starting point:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/decode-string.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 24 Dec 2019 21:35:38 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/decode-string.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/decode-string.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Full Binary Tree]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/full-binary-tree.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Google:<BR /><BR />Given a binary tree, remove the nodes in which there is only 1 child, so that the binary tree is a full binary tree.<BR /><BR />So leaf nodes with no children should be kept, and nodes with 2 children should be kept as well.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/full-binary-tree.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 24 Dec 2019 21:35:02 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/full-binary-tree.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/full-binary-tree.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Min Stack]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/min-stack.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Uber:<BR /><BR />Design a simple stack that supports push, pop, top, and retrieving the minimum element in constant time.<BR /><BR />push(x) -- Push element x onto stack.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/min-stack.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 24 Dec 2019 21:34:12 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/min-stack.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/min-stack.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Reverse Integer]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/reverse-integer.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by LinkedIn:<BR /><BR />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.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/reverse-integer.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 24 Dec 2019 21:33:27 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/reverse-integer.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/reverse-integer.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Min Range Needed to Sort]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/min-range-needed-to-sort.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Twitter:<BR /><BR />Given a list of integers, return the bounds of the minimum range that must be sorted so that the whole list would be sorted.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/min-range-needed-to-sort.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 24 Dec 2019 21:32:47 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/min-range-needed-to-sort.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/min-range-needed-to-sort.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Distribute Bonuses]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/distribute-bonuses.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Twitter:<BR /><BR />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.<BR /><BR />The rules of giving bonuses is that:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/distribute-bonuses.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 24 Dec 2019 21:32:07 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/distribute-bonuses.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/distribute-bonuses.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Tree Serialization]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/tree-serialization.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Apple:<BR /><BR />You are given the root of a binary tree. You need to implement 2 functions:<BR /><BR />1. serialize(root) which serializes the tree into a string representation<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/tree-serialization.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 24 Dec 2019 21:31:25 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/tree-serialization.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/tree-serialization.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem:  Arithmetic Binary Tree]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/arithmetic-binary-tree.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Apple:<BR /><BR />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 '/'.<BR /><BR />Write a function that takes this tree and evaluates the expression.<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/arithmetic-binary-tree.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 24 Dec 2019 21:30:28 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/arithmetic-binary-tree.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/arithmetic-binary-tree.txt]]></guid>
</item>
<item>
<title><![CDATA[我的逗逼考研经历]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/just-a-story.txt]]></link>
<description><![CDATA[突然发现明天是研究生入学笔试日。在考研这件事上我有丰富的经验，包括失败的经验、成功的经验、以及出题的经验、面试的经验等等。我的读者分布主要在20-35岁之间，相信大多数人都有亲朋好友明天要上场，甚至自己要上场。把我的逗逼经历写给你们看一下，你们也转发一下，帮助缓解一下焦虑情绪也是好的。<BR /><BR />第一次是大四，考的是本校本专业，按部就班复习都比较顺利。当时专业里大概三分之一人准备出国，三分之一人考研，还有三分之一人直接就业。考研的人里面只要认真复习的几乎都上了，好几个还在辅导班里顺便捡到了外校女朋友——颜值比我们学校的平均水平高很多。我总分还不错但倒霉在数学这门课成绩特别差，单科没有过线，比我正常水平要低20分以上，但当时没有查卷服务，只能作罢。<BR /><BR />在要不要二战这件事上我稍微犹豫了一下，但很快决定要上。其实当时我已经拿了华为等几个公司的offer，参照同批去的同学现状，应该是错过了最简单的一次财务自由机会。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/just-a-story.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=7">Category:To Share&gt;&gt;</a><BR />]]></description>
<pubDate>Fri, 20 Dec 2019 13:31:14 +0000</pubDate>
<category><![CDATA[To Share]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/just-a-story.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/just-a-story.txt]]></guid>
</item>
<item>
<title><![CDATA[Why Divorced women do not choose to marry again?]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/why-divorced-women-do-not-choose-to-marry-again.txt]]></link>
<description><![CDATA[我是一个34岁的单亲妈妈，带着一个13个月的女儿，在北京生活。<BR /><BR />已离婚8个半月。<BR /><BR />先交代一下背景：<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/why-divorced-women-do-not-choose-to-marry-again.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=11">Category:Q & A&gt;&gt;</a><BR />]]></description>
<pubDate>Tue, 17 Dec 2019 21:39:44 +0000</pubDate>
<category><![CDATA[Q & A]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/why-divorced-women-do-not-choose-to-marry-again.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/why-divorced-women-do-not-choose-to-marry-again.txt]]></guid>
</item>
<item>
<title><![CDATA[[Daily Problem] Angles of a Clock]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/-angles-of-a-clock.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Microsoft:<BR /><BR />Given a time in the format of hour and minute, calculate the angle of the hour and minute hand on a clock.<BR /><BR /><BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/-angles-of-a-clock.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 15 Dec 2019 10:39:43 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/-angles-of-a-clock.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/-angles-of-a-clock.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[[Daily Problem] Longest Increasing Subsequence]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/longest-increasing-subsequence.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Microsoft:<BR /><BR />You are given an array of integers. Return the length of the longest increasing subsequence (not necessarily contiguous) in the array.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/longest-increasing-subsequence.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 15 Dec 2019 10:36:40 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/longest-increasing-subsequence.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/longest-increasing-subsequence.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[有没有人装逼正好撞到你擅长的领域上的？]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/zhuangbi.txt.txt]]></link>
<description><![CDATA[前两年去某县里，参加同学的婚礼。<BR /><BR />因为旅途比较远，前一天下午出发了，路上下着雨，到了的时候，天已经大黑了。<BR /><BR />新郎官还有一波同事，和我们坐在一桌流水席。大家准备一起吃完饭，去给新郎帮忙贴喜字，压井盖。<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/zhuangbi.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=7">Category:To Share&gt;&gt;</a><BR />]]></description>
<pubDate>Sun, 15 Dec 2019 10:34:22 +0000</pubDate>
<category><![CDATA[To Share]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/zhuangbi.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/zhuangbi.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Given two arrays, write a function to compute their intersection.]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/given-two-arrays,-write-a-function-to-compute-their-intersection.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Amazon:<BR /><BR />Given two arrays, write a function to compute their intersection - the intersection means the numbers that are in both arrays.<BR /><BR />Example 1:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/given-two-arrays,-write-a-function-to-compute-their-intersection.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Thu, 12 Dec 2019 20:31:02 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/given-two-arrays,-write-a-function-to-compute-their-intersection.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/given-two-arrays,-write-a-function-to-compute-their-intersection.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Product of Array Except Self]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/product-of-array-except-self.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Amazon:<BR /><BR />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.<BR /><BR />For example, an input of [1, 2, 3, 4, 5] should return [120, 60, 40, 30, 24].<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/product-of-array-except-self.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Thu, 12 Dec 2019 20:30:34 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/product-of-array-except-self.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/product-of-array-except-self.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Merge List Of Number Into Ranges]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/merge-list-of-number-into-ranges.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Facebook:<BR /><BR />Given a sorted list of numbers, return a list of strings that represent all of the consecutive numbers.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/merge-list-of-number-into-ranges.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Thu, 12 Dec 2019 20:30:06 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/merge-list-of-number-into-ranges.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/merge-list-of-number-into-ranges.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Reverse Words in a String]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/reverse-words-in-a-string.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Facebook:<BR /><BR />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.<BR /><BR />Example 1:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/reverse-words-in-a-string.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Thu, 12 Dec 2019 20:28:57 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/reverse-words-in-a-string.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/reverse-words-in-a-string.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Room scheduling]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/room-scheduling.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Google:<BR /><BR />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.<BR /><BR />For example. [(30, 75), (0, 50), (60, 150)] should return 2.<a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Thu, 12 Dec 2019 20:28:05 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/room-scheduling.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/room-scheduling.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Running Median]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/running-median.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Google:<BR /><BR />You are given a stream of numbers. Compute the median for each new element .<BR /><BR />Eg. Given [2, 1, 4, 7, 2, 0, 5], the algorithm should output [2, 1.5, 2, 3.0, 2, 2, 2]<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/running-median.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Thu, 12 Dec 2019 20:27:28 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/running-median.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/running-median.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Group Words that are Anagrams]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/group-words-that-are-anagrams.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by AirBNB:<BR /><BR />Given a list of words, group the words that are anagrams of each other. (An anagram are words made up of the same letters).<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/group-words-that-are-anagrams.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Thu, 12 Dec 2019 20:26:57 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/group-words-that-are-anagrams.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/group-words-that-are-anagrams.txt.txt]]></guid>
</item>
<item>
<title><![CDATA[Daily Interview Problem: Minimum Removals for Valid Parenthesis]]></title>
<link><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/minimum-removals-for-valid-parenthesis.txt.txt]]></link>
<description><![CDATA[Hi, here's your problem today. This problem was recently asked by Uber:<BR /><BR />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.<BR /><BR />Example:<BR /><B>...</B><BR /><a href="https://steakovercooked.com/Life.Record/text/article/2019/12/minimum-removals-for-valid-parenthesis.txt.txt">View Full Text&gt;&gt;</a><BR /><a href="https://steakovercooked.com/Life.Blog?cat=2">Category:Computing&gt;&gt;</a><BR />]]></description>
<pubDate>Thu, 12 Dec 2019 20:26:26 +0000</pubDate>
<category><![CDATA[Computing]]></category>
<author>oh@steakovercooked.com (steakovercooked)</author>
<comments><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/minimum-removals-for-valid-parenthesis.txt.txt#comments]]></comments>
<guid isPermaLink="true"><![CDATA[https://steakovercooked.com/Life.Record/text/article/2019/12/minimum-removals-for-valid-parenthesis.txt.txt]]></guid>
</item>
</channel>
</rss>
