-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfeed.xml
More file actions
1 lines (1 loc) · 4.25 KB
/
Copy pathfeed.xml
File metadata and controls
1 lines (1 loc) · 4.25 KB
1
<?xml version="1.0" encoding="UTF-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><atom:link href="http://thinkingfunctionally.com/" rel="self" type="application/rss+xml"/><title>Thinking Functionally</title><link>http://thinkingfunctionally.com/</link><description>This blog is awesome</description><lastBuildDate>Sat, 18 Nov 2023 22:09:31 +0800</lastBuildDate><generator>clj-rss</generator><item><guid>http://thinkingfunctionally.com/posts-output/2023-11-17-0003-longest-substring-without-repeats/</guid><link>http://thinkingfunctionally.com/posts-output/2023-11-17-0003-longest-substring-without-repeats/</link><title>0003 Longest Substring Without Repeats</title><description>incorrect</description><author>ThinkingFunctionally</author><pubDate>Fri, 17 Nov 2023 00:00:00 +0800</pubDate></item><item><guid>http://thinkingfunctionally.com/posts-output/2023-11-16-0002-add-two-number/</guid><link>http://thinkingfunctionally.com/posts-output/2023-11-16-0002-add-two-number/</link><title>0002 Add Two Number</title><description>The given code defines four functions: vec-to-num, num-to-vec, add-two-numbers, and executes a calculation at the end.</description><author>ThinkingFunctionally</author><pubDate>Thu, 16 Nov 2023 00:00:00 +0800</pubDate></item><item><guid>http://thinkingfunctionally.com/posts-output/2023-11-15-1877-minimize-maximum-pair-sum-in-array/</guid><link>http://thinkingfunctionally.com/posts-output/2023-11-15-1877-minimize-maximum-pair-sum-in-array/</link><title>1877 Minimize Maximum Pair Sum in Array</title><description>The min-pair-sum function takes a vector of integers nums as input. It first sorts the elements of the nums vector using the sort function. Then, it initializes variables i and j to represent the start and end indices of the sorted vector, respectively. The variable max-pair-sum is initialized to 0.</description><author>ThinkingFunctionally</author><pubDate>Wed, 15 Nov 2023 00:00:00 +0800</pubDate></item><item><guid>http://thinkingfunctionally.com/posts-output/2023-11-14-1877-minimize-maximum-pair-sum-In-array/</guid><link>http://thinkingfunctionally.com/posts-output/2023-11-14-1877-minimize-maximum-pair-sum-In-array/</link><title>1877 Minimize Maximum Pair Sum in Array</title><description>Certainly! Let's break down the time and space complexity analysis for the given code snippet:</description><author>ThinkingFunctionally</author><pubDate>Tue, 14 Nov 2023 00:00:00 +0800</pubDate></item><item><guid>http://thinkingfunctionally.com/posts-output/2023-11-13-1877-Array-Partition/</guid><link>http://thinkingfunctionally.com/posts-output/2023-11-13-1877-Array-Partition/</link><title>1877 Array Partition</title><description>In this Clojure version, we define a function array-pair-sum that takes an array of integers nums as input and returns the maximum sum of the minimum elements in pairs.</description><author>ThinkingFunctionally</author><pubDate>Mon, 13 Nov 2023 00:00:00 +0800</pubDate></item><item><guid>http://thinkingfunctionally.com/posts-output/2023-11-12-0004-median-Of-Two-Sorted-Arrays/</guid><link>http://thinkingfunctionally.com/posts-output/2023-11-12-0004-median-Of-Two-Sorted-Arrays/</link><title>0004 Median of Two Sorted Arrays</title><description>Now let's analyze the time complexity of the code:</description><author>ThinkingFunctionally</author><pubDate>Sun, 12 Nov 2023 00:00:00 +0800</pubDate></item><item><guid>http://thinkingfunctionally.com/posts-output/2023-11-11-0001-two-sum/</guid><link>http://thinkingfunctionally.com/posts-output/2023-11-11-0001-two-sum/</link><title>0001 Two Sum</title><description>The code defines a function two-sum that takes a vector of numbers nums and a target number target. The function finds two numbers in the nums vector that add up to the target number and returns their indices as a vector.</description><author>ThinkingFunctionally</author><pubDate>Sat, 11 Nov 2023 00:00:00 +0800</pubDate></item><item><guid>http://thinkingfunctionally.com/posts-output/2020-12-03-docs/</guid><link>http://thinkingfunctionally.com/posts-output/2020-12-03-docs/</link><title>Quick Start Guide</title><description>This intro only documents a subset of Cryogen's features. For additional documentation please see the cryogen site.Features</description><pubDate>Thu, 03 Dec 2020 00:00:00 +0800</pubDate></item></channel></rss>