Why First and Last Occurrence of Element in DSA C#?

The Big Idea

Discover how to find the exact start and end points of any item in your list without endless searching!

The Scenario

Imagine you have a long list of names written on paper. You want to find where a certain name appears first and last in the list. Doing this by scanning each name one by one is tiring and slow.

The Problem

Manually checking each item means you might miss some spots or take a lot of time, especially if the list is very long. It's easy to get confused or make mistakes when you have to remember positions while looking.

The Solution

Using the method to find the first and last occurrence of an element in a list helps you quickly and correctly find these positions without scanning the whole list multiple times. It saves time and reduces errors.

Before vs After

✗ Before

int first = -1;
int last = -1;
for (int i = 0; i < arr.Length; i++) {
  if (arr[i] == target) {
    if (first == -1) first = i;
    last = i;
  }
}

✓ After

int first = Array.IndexOf(arr, target);
int last = Array.LastIndexOf(arr, target);

What It Enables

This lets you quickly find where an item starts and ends in a list, enabling faster searching and better data handling.

Real Life Example

Think of searching for the first and last time a word appears in a book to understand its importance or theme.

Key Takeaways

Manually searching is slow and error-prone.

Finding first and last occurrence automates and speeds up the search.

This method helps in many real-world tasks like text analysis and data processing.

Practice

1. What does the "First and Last Occurrence of Element" problem ask you to find in an array?

easy

A. The number of unique elements in the array

B. The sum of all elements in the array

C. The maximum and minimum elements in the array

D. The first and last positions where a given element appears

Solution

1. Step 1: Understand the problem statement

   The problem asks to find the first and last positions of a specific element in an array.

2. Step 2: Differentiate from other array queries

   It is not about sums, max/min, or counting unique elements, but about positions of a target element.

3. Final Answer:

   The first and last positions where a given element appears -> Option D

4. Quick Check:

   Positions of element = first and last occurrence [OK]

Hint: Look for positions of target element, not values or counts [OK]

Common Mistakes:

• Confusing with finding max or min element
• Trying to sum elements instead of finding positions
• Counting unique elements instead of occurrences

2. Which of the following C# code snippets correctly initializes an array to find the first and last occurrence of an element?

easy

A. int arr = {1, 2, 3, 4, 5};

B. int arr = new int[5] {1, 2, 3, 4, 5};

C. int[] arr = new int[] {1, 2, 3, 4, 5};

D. int arr[] = new int[] {1, 2, 3, 4, 5};

Solution

1. Step 1: Check array initialization syntax in C#

   Correct syntax is: int[] arr = new int[] {1, 2, 3, 4, 5};

2. Step 2: Identify incorrect options

   int arr = new int[5] {1, 2, 3, 4, 5}; has wrong syntax (cannot assign array with size and initializer like that), A is missing 'new int[]', D uses C-style syntax invalid in C#.

3. Final Answer:

   int[] arr = new int[] {1, 2, 3, 4, 5}; -> Option C

4. Quick Check:

   Correct C# array syntax = int[] arr = new int[] {1, 2, 3, 4, 5}; [OK]

Hint: Use 'int[] arr = new int[] { ... }' for array initialization [OK]

Common Mistakes:

• Using C/C++ style array declarations
• Omitting 'new int[]' keyword
• Assigning array size with initializer incorrectly

3. What will be the output of the following C# code?

int[] arr = {5, 3, 7, 3, 9};
int target = 3;
int first = -1, last = -1;
for (int i = 0; i < arr.Length; i++) {
  if (arr[i] == target) {
    if (first == -1) first = i;
    last = i;
  }
}
Console.WriteLine($"{first} {last}");

medium

A. 3 1

B. 1 3

C. 0 4

D. -1 -1

Solution

1. Step 1: Trace the loop to find first and last occurrence of 3

   Array: [5, 3, 7, 3, 9]. Target = 3. Indices: 0 to 4.
   i=0: arr[0]=5 !=3 skip
   i=1: arr[1]=3 == target, first=-1 so first=1, last=1
   i=2: arr[2]=7 !=3 skip
   i=3: arr[3]=3 == target, first=1 (unchanged), last=3
   i=4: arr[4]=9 !=3 skip

2. Step 2: Print first and last

   first=1, last=3

3. Final Answer:

   1 3 -> Option B

4. Quick Check:

   First and last index of 3 = 1 and 3 [OK]

Hint: Track first when found, update last every time [OK]

Common Mistakes:

• Swapping first and last indices
• Not updating last occurrence correctly
• Initializing first and last with wrong values

4. Identify the error in the following code that tries to find the first and last occurrence of an element:

int[] arr = {2, 4, 2, 5, 2};
int target = 2;
int first = 0, last = 0;
for (int i = 0; i < arr.Length; i++) {
  if (arr[i] == target) {
    first = i;
    last = i;
  }
}
Console.WriteLine($"{first} {last}");

medium

A. first and last are initialized incorrectly, causing wrong output

B. Loop condition should be i <= arr.Length

C. Target value is not assigned properly

D. Console.WriteLine syntax is incorrect

Solution

1. Step 1: Analyze initialization of first and last

   Both first and last start at 0. Inside loop, first and last are set to i every time target is found, so first will be overwritten and end up as last occurrence index.

2. Step 2: Identify correct approach

   First should be set only once when first occurrence is found (e.g., if first == -1). Last should update every time target is found.

3. Final Answer:

   first and last are initialized incorrectly, causing wrong output -> Option A

4. Quick Check:

   Initialize first to -1 and update only once [OK]

Hint: Initialize first to -1 and update only once [OK]

Common Mistakes:

• Overwriting first occurrence index
• Using wrong loop boundary
• Incorrect Console.WriteLine format

5. Given a sorted array with possible duplicates, how can you efficiently find the first and last occurrence of a target element using C#?

hard

A. Use two binary searches: one for first occurrence, one for last occurrence

B. Traverse the array twice: once from start, once from end

C. Use a dictionary to store element counts

D. Sort the array again and find the target

Solution

1. Step 1: Understand the array is sorted with duplicates

   Sorted array allows binary search to find positions efficiently.

2. Step 2: Use binary search twice

   One binary search finds the first occurrence by moving left when target found, another finds last occurrence by moving right.

3. Step 3: Avoid full traversal or extra sorting

   Traversing twice or sorting again is inefficient. Dictionary counts do not give positions.

4. Final Answer:

   Use two binary searches: one for first occurrence, one for last occurrence -> Option A

5. Quick Check:

   Binary search twice = efficient first and last occurrence [OK]

Hint: Binary search twice for first and last occurrence in sorted array [OK]

Common Mistakes:

• Using linear search on large sorted arrays
• Sorting array again unnecessarily
• Using dictionary counts instead of positions