<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
      <title>025.04.81.Assignment Collections. Arrays - EmbLogic</title>
      <link>https://www.emblogic.com/forum/categories/025-04-81-assignment-collections-arrays/feed.rss</link>
      <pubDate>Thu, 13 Aug 26 20:50:40 +0530</pubDate>
         <description>025.04.81.Assignment Collections. Arrays - EmbLogic</description>
   <language>en-CA</language>
   <atom:link href="/forum/discussions/feed.rss" rel="self" type="application/rss+xml" />
		<item>
			<title>D.8. Check Array Rotation</title>
			<link>https://www.emblogic.com/forum/discussion/2003/d-8-check-array-rotation</link>
			<pubDate>Mon, 12 May 2025 04:01:50 +0530</pubDate>
			<dc:creator>pravjot</dc:creator>
			<guid isPermaLink="false">2003@/forum/discussions</guid>
			<description><![CDATA[<h3><br /></h3><div><span><span><span>Write a program to check if one array is a rotation of another. For example:</span></span></span></div><div><span><span><span>→ </span><span>Input 1: [1, 2, 3, 4, 5]</span><span> </span></span></span></div><div><span><span><span>→ </span><span>Input 2: [4, 5, 1, 2, 3]</span><span> </span></span></span></div><div><span><span><span><span>→ </span>Output: Yes (it is a rotation).</span></span></span></div>]]></description>
		</item>
		<item>
			<title>C.10. Problem: Subarray with Maximum Sum</title>
			<link>https://www.emblogic.com/forum/discussion/2005/c-10-problem-subarray-with-maximum-sum</link>
			<pubDate>Mon, 12 May 2025 04:02:52 +0530</pubDate>
			<dc:creator>pravjot</dc:creator>
			<guid isPermaLink="false">2005@/forum/discussions</guid>
			<description><![CDATA[<h3><br /></h3><div><span><span><span>Write a Rust program to find the </span><strong><span>maximum sum of a contiguous subarray</span></strong><span> within a given array of integers. This is also known as </span><strong><span>Kadane's Algorithm</span></strong><span> problem.</span></span></span></div><div><span><span><strong><span>Input</span></strong><span>:</span></span></span></div><div><span><span><span>→ </span><span>An integer array, e.g., [-2, 1, -3, 4, -1, 2, 1, -5, 4].</span></span></span></div><div><span><span><strong><span>Output</span></strong><span>:</span></span></span></div><div><span><span><span><span>→ </span>The maximum sum of the contiguous subarray.</span></span></span></div><div><span><span><span><span>→ </span>The subarray that produces this sum.</span></span></span></div><div><span><span><strong><span>Example</span></strong><span>: For the array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the output should be:</span></span></span></div><div><span><span><span>→ </span><span>Maximum sum: 6</span></span></span></div><div><span><span><span>→ </span><span>Subarray: [4, -1, 2, 1]</span></span></span></div>]]></description>
		</item>
		<item>
			<title>D.9. Frequency of Elements</title>
			<link>https://www.emblogic.com/forum/discussion/2004/d-9-frequency-of-elements</link>
			<pubDate>Mon, 12 May 2025 04:02:07 +0530</pubDate>
			<dc:creator>pravjot</dc:creator>
			<guid isPermaLink="false">2004@/forum/discussions</guid>
			<description><![CDATA[<h3><br /></h3><div><span><span><span>Write a program to count and display the frequency of each element in an array. For example, given [1, 2, 2, 3, 3, 3], the output should be:</span></span></span></div><div><span><span><span>→ </span><span>1: 1 time(s)</span></span></span></div><div><span><span><span>→ </span><span>2: 2 time(s)</span></span></span></div><div><span><span><span>→ </span><span>3: 3 time(s)</span></span></span></div>]]></description>
		</item>
		<item>
			<title>D.7. Multi-Dimensional Array Operations</title>
			<link>https://www.emblogic.com/forum/discussion/2002/d-7-multi-dimensional-array-operations</link>
			<pubDate>Mon, 12 May 2025 04:01:35 +0530</pubDate>
			<dc:creator>pravjot</dc:creator>
			<guid isPermaLink="false">2002@/forum/discussions</guid>
			<description><![CDATA[<div><span><span><span>Write a program to create a 2D array (matrix) of size 2x3, initialize it with values, and:</span></span></span></div><div><span><span><span><span>→ </span>Print the matrix in a structured format. </span></span></span></div><div><span><span><span><span>→ </span>Calculate and print the sum of all elements in the matrix.</span></span></span></div>]]></description>
		</item>
		<item>
			<title>I.6. Reverse an Array</title>
			<link>https://www.emblogic.com/forum/discussion/2001/i-6-reverse-an-array</link>
			<pubDate>Mon, 12 May 2025 04:00:44 +0530</pubDate>
			<dc:creator>pravjot</dc:creator>
			<guid isPermaLink="false">2001@/forum/discussions</guid>
			<description><![CDATA[<div><span><span><span>Write a program to reverse the elements of an array. For example, given [1, 2, 3, 4, 5], the output should be [5, 4, 3, 2, 1].</span></span></span></div>]]></description>
		</item>
		<item>
			<title>I.5. Find Maximum and Minimum</title>
			<link>https://www.emblogic.com/forum/discussion/2000/i-5-find-maximum-and-minimum</link>
			<pubDate>Mon, 12 May 2025 04:00:28 +0530</pubDate>
			<dc:creator>pravjot</dc:creator>
			<guid isPermaLink="false">2000@/forum/discussions</guid>
			<description><![CDATA[<div><span><span><span>Write a program to find and print the maximum and minimum values in an array. For example, given [10, 20, 5, 40, 25], the maximum is 40 and the minimum is 5.</span></span></span></div>]]></description>
		</item>
		<item>
			<title>I.4. Sum of Array Elements</title>
			<link>https://www.emblogic.com/forum/discussion/1999/i-4-sum-of-array-elements</link>
			<pubDate>Mon, 12 May 2025 04:00:06 +0530</pubDate>
			<dc:creator>pravjot</dc:creator>
			<guid isPermaLink="false">1999@/forum/discussions</guid>
			<description><![CDATA[<div><span><span><span>Write a program to calculate the sum of all elements in an array of integers. For example, given [1, 2, 3, 4, 5], the output should be 15.</span></span></span></div>]]></description>
		</item>
		<item>
			<title>E.3. Modify Array Elements</title>
			<link>https://www.emblogic.com/forum/discussion/1998/e-3-modify-array-elements</link>
			<pubDate>Mon, 12 May 2025 03:59:22 +0530</pubDate>
			<dc:creator>pravjot</dc:creator>
			<guid isPermaLink="false">1998@/forum/discussions</guid>
			<description><![CDATA[<div><span><span><span>Write a program that declares a mutable array of 5 integers, modifies the value of the third element, and prints the modified array.</span></span></span></div>]]></description>
		</item>
		<item>
			<title>E.2. Array Length</title>
			<link>https://www.emblogic.com/forum/discussion/1997/e-2-array-length</link>
			<pubDate>Mon, 12 May 2025 03:59:01 +0530</pubDate>
			<dc:creator>pravjot</dc:creator>
			<guid isPermaLink="false">1997@/forum/discussions</guid>
			<description><![CDATA[<div><span><span><span>Write a program to find and print the length of an array. Use an array of floating-point numbers [1.1, 2.2, 3.3, 4.4, 5.5].</span></span></span></div>]]></description>
		</item>
		<item>
			<title>E.1. Declare and Print an Array</title>
			<link>https://www.emblogic.com/forum/discussion/1996/e-1-declare-and-print-an-array</link>
			<pubDate>Mon, 12 May 2025 03:58:04 +0530</pubDate>
			<dc:creator>pravjot</dc:creator>
			<guid isPermaLink="false">1996@/forum/discussions</guid>
			<description><![CDATA[<h3><br /></h3><div><span><span><span>Write a program to declare an array of integers, initialize it with the values [10, 20, 30, 40, 50], and print all the elements using a loop.</span></span></span></div>]]></description>
		</item>
   </channel>
</rss>