CodeReportSolutions - Revision history

Joseph: /* Other Interesting Solutions */

2024-10-18T17:08:44Z

Joseph: /* Final Array State After K Multiplication Operations I */

2024-09-12T04:39:40Z

Final Array State After K Multiplication Operations I

Joseph: /* Other Interesting Solutions */

2024-09-12T04:33:34Z

Joseph: /* Other Interesting Solutions */

2024-09-12T04:25:44Z

Joseph: /* z^3 Solution */

2024-09-12T04:24:05Z

z^3 Solution

Joseph: /* Snake in Matrix */

2024-09-12T04:23:18Z

Snake in Matrix

Joseph: /* See Related */

2024-09-02T03:30:26Z

See Related

Joseph: /* Maximum Nesting Depth of the Paranthesis */

2024-08-21T14:23:12Z

Maximum Nesting Depth of the Paranthesis

Joseph: /* z^3 Solution */

2024-08-21T14:20:18Z

z^3 Solution

Joseph: /* Check if a matrix is an X-Matrix (X like diagonals are filled) */

2024-08-21T14:19:02Z

Check if a matrix is an X-Matrix (X like diagonals are filled)

@@ Line 620: / Line 620: @@
 n is printed at end
 Note [ ] to keep multiple pieces of the code together in array form as an interesting style.
 </pre>

@@ Line 622: / Line 622: @@
 </pre>
 =Other Interesting Solutions=
 *[[Problems and Solutions]]

@@ Line 626: / Line 626: @@
 *[[Problems and Solutions]]
 *[[Neet Code Problems]]
 =See Related=

@@ Line 622: / Line 622: @@
 </pre>
 =Other Interesting Solutions=
 *[[Problems and Solutions]]
 =See Related=

@@ Line 616: / Line 616: @@
 #0 picks first element
 n[q]*=m multiplies by m
-;𝕗f; creates a function named f (stacky/tail)
+;𝕗f; creates a function named f (stacky/tail). Uses the prior statement or block to construct a function.
 (1..k)@f runs f for 1 to k
 n is printed at end

← Older revision		Revision as of 04:23, 12 September 2024
Line 549:		Line 549:
	</pre>		</pre>

		+	==Final Array State After K Multiplication Operations I ==
		+
		+	Video: https://www.youtube.com/watch?v=O9AsxoQzNdI [Python vs C++ vs BQN vs APL]
		+
		+	Problem Description:
		+	https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i/description/
		+
		+	You are given an integer array nums, an integer k, and an integer multiplier.
		+
		+	You need to perform k operations on nums. In each operation:
		+
		+	Find the minimum value x in nums. If there are multiple occurrences of the minimum value, select the one that appears first.
		+	Replace the selected minimum value x with x * multiplier.
		+	Return an integer array denoting the final state of nums after performing all k operations.
		+
		+
		+
		+	Example 1:
		+
		+	Input: nums = [2,1,3,5,6], k = 5, multiplier = 2
		+
		+	Output: [8,4,6,5,6]
		+
		+	Explanation:
		+
		+	Operation Result
		+	After operation 1 [2, 2, 3, 5, 6]
		+	After operation 2 [4, 2, 3, 5, 6]
		+	After operation 3 [4, 4, 3, 5, 6]
		+	After operation 4 [4, 4, 6, 5, 6]
		+	After operation 5 [8, 4, 6, 5, 6]
		+	Example 2:
		+
		+	Input: nums = [1,2], k = 3, multiplier = 4
		+
		+	Output: [16,8]
		+
		+	Explanation:
		+
		+	Operation Result
		+	After operation 1 [4, 2]
		+	After operation 2 [4, 8]
		+	After operation 3 [16, 8]
		+
		+
		+	Constraints:
		+
		+	1 <= nums.length <= 100
		+	1 <= nums[i] <= 100
		+	1 <= k <= 10
		+	1 <= multiplier <= 5
		+	===z^3 Solution===
		+	<pre>
		+
		+	n=[2,1,3,5,6];k=5;m=2;
		+	[q=(n⒤n↧)#0,n[q]*=m];𝕗f;
		+	(1..k)@f;n
		+	// [8,4,6,5,6]
		+
		+	n=[1,2];k=3;m=4;
		+	[q=(n⒤n↧)#0,n[q]*=m];𝕗f;
		+	(1..k)@f;n
		+	// 16 8
		+
		+	Explanation: (n⒤n↧) finds index array matching i of min of array n
		+	#0 picks first element
		+	n[q]*=m multiplies by m
		+	;𝕗f; creates a function named f (stacky/tail)
		+	(1..k)@f runs f for 1 to k
		+	n is printed at end
		+	Note [ ] to keep multiple pieces of the code together in array form as an interesting style.
		+	</pre>

	=Other Interesting Solutions=		=Other Interesting Solutions=

← Older revision		Revision as of 03:30, 2 September 2024
Line 548:		Line 548:

	</pre>		</pre>
		+
		+
		+	=Other Interesting Solutions=
		+	*[[Problems and Solutions]]

	=See Related=		=See Related=

@@ Line 405: / Line 405: @@
   ∑  SUM
   ↥  MAX
 </pre>
 ==Longest Common Prefix ==

@@ Line 132: / Line 132: @@
   |==| is used to compare this to the m, .$ is used to apply the function "x!=0?1:0"! to every element. "x!=0?1:0"! shows how a function can be created from a string with the ! operator.
   ⤽ is the same as .reverse();
   Also note simpler z^3 Array Notation used to create the variable x (with , (when positive numbers alone are used, the comma is also optional) and ;). Usual Javascript array notations also work.

@@ Line 122: / Line 122: @@
 m=[2 0 0 1; 0 3 1 0; 0 5 2 0; 4 0 0 2];
 n=(m#)[0];
-xm=|n| |+| |n|.reverse();
+xm=|n| |+| |n|⤽;
 xm|==|(m.$("x!=0?1:0"!))
 </pre>
@@ Line 131: / Line 131: @@
   |n| gives n dimensional Identity Matrix, which is added using |+| to the .reverse() of same array.
   |==| is used to compare this to the m, .$ is used to apply the function "x!=0?1:0"! to every element. "x!=0?1:0"! shows how a function can be created from a string with the ! operator.
   Also note simpler z^3 Array Notation used to create the variable x (with , (when positive numbers alone are used, the comma is also optional) and ;). Usual Javascript array notations also work.