<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>https://ecency.com</link><image><url>https://ecency.com/logo512.png</url><title>RSS Feed</title><link>https://ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Fri, 14 Aug 2026 22:49:02 GMT</lastBuildDate><atom:link href="https://ecency.com/created/coding-exercise/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[C++ Coding Exercise - Find All Duplicates in an Array - 编程练习题：找出数组中所有重复的元素]]></title><description><![CDATA[XXX: // Reposted to my blog for better indexing: Support me and my work as a witness - witness thread by voting me here, or voting me as a proxy. Thank you! Some of My Contributions: SteemIt Tutorials,]]></description><link>https://ecency.com/@justyy/coding-exercise-find-all-duplicates-in-an-array</link><guid isPermaLink="true">https://ecency.com/@justyy/coding-exercise-find-all-duplicates-in-an-array</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Wed, 08 Aug 2018 22:43:36 GMT</pubDate></item><item><title><![CDATA[Coding Exercise - Find Letter Case Permutation with DFS 编程练习题：找出字符串的所有大小小组合]]></title><description><![CDATA[Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all possible strings we could create. Examples: Input: S = "a1b2"]]></description><link>https://ecency.com/@justyy/coding-exercise-find-letter-case-permutation-with-dfs</link><guid isPermaLink="true">https://ecency.com/@justyy/coding-exercise-find-letter-case-permutation-with-dfs</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Mon, 06 Aug 2018 20:00:03 GMT</pubDate><enclosure url="https://i.ecency.com/p/7ohP4GDMGPrUMp8dW6yuJTR9MKNu8P8DCXDU9qmmpnDtgfiXTXLJ3o2eEKbxNoCABwiXFvjV2SyGezCCNaMCCSoRUkzfpRM1LGYj?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[C++ Coding Exercise - Find Maximum Depth of N-ary Tree - 编程练习题：找出N叉树的深度]]></title><description><![CDATA[Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. For example, given a 3-ary tree: We should]]></description><link>https://ecency.com/@justyy/c-coding-exercise-find-maximum-depth-of-n-ary-tree-n</link><guid isPermaLink="true">https://ecency.com/@justyy/c-coding-exercise-find-maximum-depth-of-n-ary-tree-n</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Sun, 05 Aug 2018 11:09:09 GMT</pubDate><enclosure url="https://i.ecency.com/p/7ohP4GDMGPrUMp8dW6yuJTR9MKNu8P8DCXDU9qmmpnDtgfiXTXLJ3o2eEKbxNoCABwiXFvjV2SyGezCCNaMCCSoRUkzfpRM1LGYj?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Coding Exercise - Find Third Maximum 编程练习题 - 找出第三大的数]]></title><description><![CDATA[Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n). Example 1: Input: [3, 2, 1] Output:]]></description><link>https://ecency.com/@justyy/coding-exercise-find-third-maximum</link><guid isPermaLink="true">https://ecency.com/@justyy/coding-exercise-find-third-maximum</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Wed, 01 Aug 2018 15:41:36 GMT</pubDate><enclosure url="https://i.ecency.com/p/7ohP4GDMGPrUMp8dW6yuJTR9MKNu8P8DCXDU9qmmpnDtgfiXTXLJ3o2eEKbxNoCABwiXFvjV2SyGezCCNaMCCSoRUkzfpRM1LGYj?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Coding Exercise - Find Max Consecutive Ones 编程练习题 - 最多连续的 1]]></title><description><![CDATA[Given a binary array, find the maximum number of consecutive 1s in this array. Example 1: Input: [1,1,0,1,1,1] Output: 3 Explanation: The first two digits or the last three digits are consecutive 1s. The]]></description><link>https://ecency.com/@justyy/coding-exercise-find-max-consecutive-ones-1</link><guid isPermaLink="true">https://ecency.com/@justyy/coding-exercise-find-max-consecutive-ones-1</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Sat, 28 Jul 2018 23:18:42 GMT</pubDate><enclosure url="https://i.ecency.com/p/7ohP4GDMGPrUMp8dW6yuJTR9MKNu8P8DCXDU9qmmpnDtgfiXTXLJ3o2eEKbxNoCABwiXFvjV2SyGezCCNaMCCSoRUkzfpRM1LGYj?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Coding Exercise - Sum of Left Leaves (BFS + DFS + Recursion) - 编程练习题 - 左子树叶节点之和 (深度优先+广度优先+递归)]]></title><description><![CDATA[XXXX Reposted to my blog for better indexing. Support me and my work as a witness - witness thread by voting me here, or voting me as a proxy. Thank you! Some of My Contributions: SteemIt Tutorials, Robots,]]></description><link>https://ecency.com/@justyy/coding-exercise-sum-of-left-leaves-bfs-dfs-recursion</link><guid isPermaLink="true">https://ecency.com/@justyy/coding-exercise-sum-of-left-leaves-bfs-dfs-recursion</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Fri, 27 Jul 2018 07:28:00 GMT</pubDate></item><item><title><![CDATA[Coding Exercise - Container With Most Water (Recursion) 编程练习题 - 最多水容器 (递归)]]></title><description><![CDATA[Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two]]></description><link>https://ecency.com/@justyy/coding-exercise-container-with-most-water-recursion</link><guid isPermaLink="true">https://ecency.com/@justyy/coding-exercise-container-with-most-water-recursion</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Wed, 25 Jul 2018 18:57:48 GMT</pubDate><enclosure url="https://i.ecency.com/p/2YRZBi4FZVHefEm1GEXUHPs9ENak1AzbK59iQt6jSAUEv3e7vML8eWTgZ6E6XBoeS2nt39hnpB5TLc26gN4VvbBwnBeffpUTBBU?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Coding Exercise - Flip the Integers (Bit Manipulation) - 编程练习题：翻转整数位]]></title><description><![CDATA[Question: Write a function to compute the number of bits required to convert a integer to another. For example, Input 29 (or 11101), 15 (or 01111) the output is 2. It may seem complex but it is actually]]></description><link>https://ecency.com/@justyy/coding-exercise-flip-the-integers-bit-manipulation</link><guid isPermaLink="true">https://ecency.com/@justyy/coding-exercise-flip-the-integers-bit-manipulation</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Mon, 23 Jul 2018 23:17:09 GMT</pubDate><enclosure url="https://i.ecency.com/p/7ohP4GDMGPrUMp8dW6yuJTR9MKNu8P8DCXDU9qmmpnDtgfiXTXLJ3o2eEKbxNoCABwiXFvjV2SyGezCCNaMCCSoRUkzfpRM1LGYj?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Coding Exercise - Add Two Numbers on Singly-Linked List 编程练习题: 对两单向链表求和]]></title><description><![CDATA[Question: You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and]]></description><link>https://ecency.com/@justyy/coding-exercise-add-two-numbers-on-singly-linked-list</link><guid isPermaLink="true">https://ecency.com/@justyy/coding-exercise-add-two-numbers-on-singly-linked-list</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Sat, 21 Jul 2018 19:18:54 GMT</pubDate><enclosure url="https://i.ecency.com/p/7ohP4GDMGPrUMp8dW6yuJTR9MKNu8P8DCXDU9qmmpnDtgfiXTXLJ3o2eEKbxNoCABwiXFvjV2SyGezCCNaMCCSoRUkzfpRM1LGYj?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Coding Exercise - Inspect Two Consecutive Bits - 编程练习题 ：判断是否有连续两个1]]></title><description><![CDATA[Question: Implement the inspect_bits function to check if any given 32-bit integer contains 2 or more consecutive ones in its binary representation. If it does, the function should return 1 otherwise it]]></description><link>https://ecency.com/@justyy/coding-exercise-inspect-two-consecutive-bits-1</link><guid isPermaLink="true">https://ecency.com/@justyy/coding-exercise-inspect-two-consecutive-bits-1</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Fri, 20 Jul 2018 19:36:33 GMT</pubDate><enclosure url="https://i.ecency.com/p/7ohP4GDMGPrUMp8dW6yuJTR9MKNu8P8DCXDU9qmmpnDtgfiXTXLJ3o2eEKbxNoCABwiXFvjV2SyGezCCNaMCCSoRUkzfpRM1LGYj?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Coding Exercise - How to Merge Two Sorted Array? 编程练习题 - 如何合并两个有序的数组？]]></title><description><![CDATA[Task: Merge two given sorted integer array A and B into a new sorted integer array. Example A=[1,2,3,4], B=[2,4,5,6], return [1,2,2,3,4,4,5,6] XXX: Support me and my work as a witness - witness thread]]></description><link>https://ecency.com/@justyy/coding-exercise-how-to-merge-two-sorted-array</link><guid isPermaLink="true">https://ecency.com/@justyy/coding-exercise-how-to-merge-two-sorted-array</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Wed, 18 Jul 2018 22:07:24 GMT</pubDate><enclosure url="https://i.ecency.com/p/7ohP4GDMGPrUMp8dW6yuJTR9MKNu8P8DCXDU9qmmpnDtgfiXTXLJ3o2eEKbxNoCABwiXFvjV2SyGezCCNaMCCSoRUkzfpRM1LGYj?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Coding Exercise - Search Insert Position 编程练习题 - 寻找插入位置]]></title><description><![CDATA[Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array. Example]]></description><link>https://ecency.com/@justyy/coding-exercise-search-insert-position</link><guid isPermaLink="true">https://ecency.com/@justyy/coding-exercise-search-insert-position</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Tue, 10 Jul 2018 12:54:12 GMT</pubDate><enclosure url="https://i.ecency.com/0x0/https://ipfs.busy.org/ipfs/QmfPN8W19QLM76b6UdUgKfFQvZ6niiF1VD4Zk4SqBC2LED" length="0" type="false"/></item><item><title><![CDATA[Coding Exercise - Sort Letters by Case | 编程练习题 - 排序字母]]></title><description><![CDATA[Given a string which contains only letters. Sort it by lower case first and upper case second. Example For "abAcD", a reasonable answer is "acbAD" Challenge Do it in one-pass and in-place.]]></description><link>https://ecency.com/@justyy/coding-exercise-sort-letters-by-case-or</link><guid isPermaLink="true">https://ecency.com/@justyy/coding-exercise-sort-letters-by-case-or</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Tue, 10 Jul 2018 00:27:30 GMT</pubDate><enclosure url="https://i.ecency.com/p/7ohP4GDMGPrUMp8dW6yuJTR9MKNu8P8DCXDU9qmmpnDtgfiXTXLJ3o2eEKbxNoCABwiXFvjV2SyGezCCNaMCCSoRUkzfpRM1LGYj?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>