Scribd
Upload
5 views2 pages

Home Assignment On Array Problems

The document outlines a home assignment for BCA students focusing on various array problems, including finding the maximum and second largest elements, reversing an array, removing duplicates, and moving zeros to the end. Each problem includes a brief description, time and space complexity, and links to relevant LeetCode problems for practice. Additionally, it features a tough segment on checking if an array is sorted.

Uploaded by

suryansh803
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views2 pages

Home Assignment On Array Problems

The document outlines a home assignment for BCA students focusing on various array problems, including finding the maximum and second largest elements, reversing an array, removing duplicates, and moving zeros to the end. Each problem includes a brief description, time and space complexity, and links to relevant LeetCode problems for practice. Additionally, it features a tough segment on checking if an array is sorted.

Uploaded by

suryansh803
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

DSA Training (23/02/2026) BCA 6th & 4th Sem

Home Assignment on Array Problems


Find Maximum Element in an array:
You are given an array of size n. Find out the largest element present in the
array.
Another Variant: Find out the second largest element present in the array.
Time complexity: O(n)
Space complexity: O(1)
• [Link]
array/description/
• [Link]
• [Link]
• [Link]
• [Link]
• [Link]
Find the Reverse of an array:
You are given an array of size n. Reverse the array in place.
Time complexity: O(n)
Space complexity: O(1)
• [Link]
• [Link]
• [Link]
• [Link]
Remove duplicates from a sorted array:
You are given an array of size n. Remove the duplicates of an array and return
the new size of array containing only unique elements.
Space complexity: O(1)
Time Complexity: O(n)
• [Link]
• [Link]
• [Link]
• [Link]
Move Zeros to the end:
You are given an array of size n. move all the zero at the end of the array and do
not change the order of non zero elements:
Time Complexity: O(n)
Space Complexity: O(1)
• [Link]
• [Link]
• [Link]
• [Link]
• [Link]
• [Link]

Tough Segment
Check if array is sorted:
You are given an array of size n. Check if it is sorted or not. (Must Try)
Time Complexity: O(n)
Space Complexity: O(1)
• [Link]
• [Link]
• [Link]
• [Link]
• [Link]

You might also like