ProgramGuru

DSA Visualizations /

Overview of TechniquesOverview of Techniques14
❯

  1. 1Overview of DSA Problem Solving Techniques
  2. 2Brute Force Technique in DSA
  3. 3Greedy Algorithm Technique in DSA
  4. 4Divide and Conquer Technique in DSA
  5. 5Dynamic Programming Technique in DSA
  6. 6Backtracking Technique in DSA
  7. 7Recursion Technique in DSA
  8. 8Sliding Window Technique in DSA
  9. 9Two Pointers Technique
  10. 10Binary Search Technique
  11. 11Tree / Graph Traversal Technique in DSA
  12. 12Bit Manipulation Technique in DSA
  13. 13Hashing Technique
  14. 14Heaps Technique in DSA

SortingSorting10
❯

  1. 1Bubble Sort
  2. 2Selection Sort
  3. 3Insertion Sort
  4. 4Merge Sort
  5. 5Quick Sort
  6. 6Heap Sort
  7. 7Radix Sort
  8. 8Counting Sort
  9. 9Bucket Sort
  10. 10Shell Sort

ArraysArrays32
❯

  1. 1Find Maximum and Minimum in Array using Loop
  2. 2Find Second Largest in Array
  3. 3Find Second Smallest in Array
  4. 4Reverse Array using Two Pointers
  5. 5Check if Array is Sorted
  6. 6Remove Duplicates from Sorted Array
  7. 7Left Rotate an Array by One Place
  8. 8Left Rotate an Array by K Places
  9. 9Move Zeroes in Array to End
  10. 10Linear Search in Array
  11. 11Union of Two Arrays
  12. 12Find Missing Number in Array
  13. 13Max Consecutive Ones in Array
  14. 14Find Kth Smallest Element
  15. 15Longest Subarray with Given Sum (Positives)
  16. 16Longest Subarray with Given Sum (Positives and Negatives)
  17. 17Find Majority Element in Array (more than n/2 times)
  18. 18Find Majority Element in Array (more than n/3 times)
  19. 19Maximum Subarray Sum using Kadane's Algorithm
  20. 20Print Subarray with Maximum Sum
  21. 21Stock Buy and Sell
  22. 22Rearrange Array Alternating Positive and Negative Elements
  23. 23Next Permutation of Array
  24. 24Leaders in an Array
  25. 25Longest Consecutive Sequence in Array
  26. 26Count Subarrays with Given Sum
  27. 27Sort an Array of 0s, 1s, and 2s
  28. 28Two Sum Problem
  29. 29Three Sum Problem
  30. 304 Sum Problem
  31. 31Find Length of Largest Subarray with 0 Sum
  32. 32Find Maximum Product Subarray

Arrays - Binary SearchArrays - Binary Search28
❯

  1. 1Binary Search in Array<br><span class="highlight">Using Iteration</span>
  2. 2Find Lower Bound in Sorted Array
  3. 3Find Upper Bound in Sorted Array
  4. 4Search Insert Position in Sorted Array (Lower Bound Approach)
  5. 5Floor and Ceil in Sorted Array
  6. 6First Occurrence in a Sorted Array
  7. 7Last Occurrence in a Sorted Array
  8. 8Count Occurrences in Sorted Array
  9. 9Search Element in a Rotated Sorted Array
  10. 10Search in Rotated Sorted Array with Duplicates
  11. 11Minimum in Rotated Sorted Array
  12. 12Find Rotation Count in Sorted Array
  13. 13Search Single Element in Sorted Array
  14. 14Find Peak Element in Array
  15. 15Square Root using Binary Search
  16. 16Nth Root of a Number using Binary Search
  17. 17Koko Eating Bananas
  18. 18Minimum Days to Make M Bouquets
  19. 19Find the Smallest Divisor Given a Threshold
  20. 20Capacity to Ship Packages within D Days
  21. 21Kth Missing Positive Number
  22. 22Aggressive Cows Problem
  23. 23Allocate Minimum Number of Pages
  24. 24Split Array - Minimize Largest Sum
  25. 25Painter's Partition Problem
  26. 26Minimize Maximum Distance Between Gas Stations
  27. 27Median of Two Sorted Arrays of Different Sizes
  28. 28K-th Element of Two Sorted Arrays

StringsStrings2
❯

  1. 1Remove Outermost Parentheses in String
  2. 2Edit Distance Problem

MatrixMatrix3
❯

  1. 1Set Matrix Zeroes
  2. 2Rotate Matrix by 90 Degrees Clockwise
  3. 3Print Matrix in Spiral Manner

Matrix - Binary SearchMatrix - Binary Search5
❯

  1. 1Row with Maximum Number of 1's
  2. 2Search in a Sorted 2D Matrix
  3. 3Search in Row and Column-wise Sorted Matrix
  4. 4Find Target in 2D Matrix
  5. 5Matrix Median

Binary TreesBinary Trees36
❯

  1. 1Preorder Traversal of a Binary Tree using Recursion
  2. 2Preorder Traversal of a Binary Tree using Iteration
  3. 3Postorder Traversal of a Binary Tree Using Recursion
  4. 4Postorder Traversal of a Binary Tree using Iteration
  5. 5Level Order Traversal of a Binary Tree using Recursion
  6. 6Level Order Traversal of a Binary Tree using Iteration
  7. 7Reverse Level Order Traversal of a Binary Tree using Iteration
  8. 8Reverse Level Order Traversal of a Binary Tree using Recursion
  9. 9Find Height of a Binary Tree
  10. 10Find Diameter of a Binary Tree
  11. 11Find Mirror of a Binary Tree - Todo
  12. 12Inorder Traversal of a Binary Tree using Recursion
  13. 13Inorder Traversal of a Binary Tree using Iteration
  14. 14Left View of a Binary Tree
  15. 15Right View of a Binary Tree
  16. 16Top View of a Binary Tree
  17. 17Bottom View of a Binary Tree
  18. 18Zigzag Traversal of a Binary Tree
  19. 19Check if a Binary Tree is Balanced
  20. 20Diagonal Traversal of a Binary Tree
  21. 21Boundary Traversal of a Binary Tree
  22. 22Construct a Binary Tree from a String with Bracket Representation
  23. 23Convert a Binary Tree into a Doubly Linked List
  24. 24Convert a Binary Tree into a Sum Tree
  25. 25Find Minimum Swaps Required to Convert a Binary Tree into a BST
  26. 26Check if a Binary Tree is a Sum Tree
  27. 27Check if All Leaf Nodes are at the Same Level in a Binary Tree
  28. 28Lowest Common Ancestor (LCA) in a Binary Tree
  29. 29Solve the Tree Isomorphism Problem
  30. 30Check if a Binary Tree Contains Duplicate Subtrees of Size 2 or More
  31. 31Check if Two Binary Trees are Mirror Images
  32. 32Calculate the Sum of Nodes on the Longest Path from Root to Leaf in a Binary Tree
  33. 33Print All Paths in a Binary Tree with a Given Sum
  34. 34Find the Distance Between Two Nodes in a Binary Tree
  35. 35Find the kth Ancestor of a Node in a Binary Tree
  36. 36Find All Duplicate Subtrees in a Binary Tree

Binary Search TreesBinary Search Trees14
❯

  1. 1Find a Value in a Binary Search Tree
  2. 2Delete a Node in a Binary Search Tree
  3. 3Find the Minimum Value in a Binary Search Tree
  4. 4Find the Maximum Value in a Binary Search Tree
  5. 5Find the Inorder Successor in a Binary Search Tree
  6. 6Find the Inorder Predecessor in a Binary Search Tree
  7. 7Check if a Binary Tree is a Binary Search Tree
  8. 8Find the Lowest Common Ancestor of Two Nodes in a Binary Search Tree
  9. 9Convert a Binary Tree into a Binary Search Tree
  10. 10Balance a Binary Search Tree
  11. 11Merge Two Binary Search Trees
  12. 12Find the kth Largest Element in a Binary Search Tree
  13. 13Find the kth Smallest Element in a Binary Search Tree
  14. 14Flatten a Binary Search Tree into a Sorted List

Find Last Occurrence of an Element in a Sorted Array
Using Binary Search

Topic Contents

ProblemExamplesSolutionVisualizationCodeTime ComplexitySpace Complexity

Problem Statement

Given a sorted array of integers and a target number key, your task is to find the last occurrence (last index) of the key in the array.

This problem is commonly solved using a modified version of binary search for better efficiency.

Examples❯

Input ArrayKeyLast Occurrence IndexDescription
[5, 10, 10, 10, 20, 20]103Key 10 appears at indices 1, 2, and 3. Last is at index 3.
[1, 2, 3, 4, 5]32Key 3 occurs only once at index 2.
[1, 1, 1, 1, 1]14All elements are the key. Last is at index 4.
[1, 2, 4, 5, 6]3-1Key 3 is not present in the array.
[1, 2, 3, 4, 5]54Key is the last element in the array.
[10, 20, 30, 40, 50]100Key is the first element, and occurs only once.
[]7-1Empty array. No elements to search.

Solution❯

To find the last occurrence of a given number in a sorted array, we use a variation of binary search that continues the search even after finding a match. This ensures we find the rightmost index where the element appears.

We begin by setting up two pointers—start at the beginning of the array and end at the end. We also keep a variable, say res, initialized to -1 which will store the result.

Now, we repeatedly calculate the mid index and compare the arr[mid] value with the key:

  • Case 1: If arr[mid] is equal to the key, it means we found a match. But we don't stop here—there might be more occurrences to the right. So we update res = mid and shift our search to the right side by setting start = mid + 1.
  • Case 2: If arr[mid] < key, it means we need to move right, so we update start = mid + 1.
  • Case 3: If arr[mid] > key, the key (if present) must be on the left side, so we update end = mid - 1.

We continue this loop until start exceeds end. At the end, if res is still -1, that means the key was not found in the array.

Handling Different Scenarios

  • If the key occurs once: The algorithm will detect and return the exact index on the first match.
  • If the key occurs multiple times: It will skip earlier matches and eventually return the rightmost index.
  • If the key does not exist: It will return -1 after exhausting the search range.
  • If the array is empty: The loop doesn't run, and -1 is returned immediately.

This binary search variation is optimal with a time complexity of O(log n), making it ideal for large sorted arrays.

Visualization

Algorithm Steps

  1. Initialize start = 0, end = n - 1, and res = -1 to store the result.
  2. While start ≤ end, calculate mid = start + (end - start) / 2.
  3. If arr[mid] == key: update res = mid and move start = mid + 1 to search towards the right.
  4. If arr[mid] < key: move start = mid + 1.
  5. If arr[mid] > key: move end = mid - 1.
  6. After the loop, res will contain the last occurrence index or -1 if not found.

Code

Python
Java
JavaScript
C
C++
C#
Kotlin
Swift
Go
Php
def last_occurrence(arr, key):
    start, end = 0, len(arr) - 1
    result = -1

    while start <= end:
        mid = start + (end - start) // 2
        if arr[mid] == key:
            result = mid  # Record the index
            start = mid + 1  # Move right to find a later occurrence
        elif key < arr[mid]:
            end = mid - 1
        else:
            start = mid + 1

    return result

# Example usage
arr = [5, 10, 10, 10, 20, 20]
key = 10
print("Last Occurrence Index:", last_occurrence(arr, key))

Time Complexity

CaseTime ComplexityExplanation
Best CaseO(1)When the key is found at the first mid computation and no further checking is needed.
Average CaseO(log n)Each iteration halves the search space, leading to logarithmic performance.
Average CaseO(log n)In the worst case, the search checks each level of the binary search tree until no more right occurrences are found.

Space Complexity

O(1)

Explanation: Only a fixed number of variables are used, with no extra memory required.

Welcome to ProgramGuru

Sign up to start your journey with us

Support ProgramGuru.org

Mention your name, and programguru.org in the message. Your name shall be displayed in the sponsers list.

PayPal

UPI

PhonePe QR

MALLIKARJUNA M