Binary TreesBinary Trees36
  1. 1Preorder Traversal of a Binary Tree using Recursion
  2. 2Preorder Traversal of a Binary Tree using Iteration
  3. 3Inorder Traversal of a Binary Tree using Recursion
  4. 4Inorder Traversal of a Binary Tree using Iteration
  5. 5Postorder Traversal of a Binary Tree Using Recursion
  6. 6Postorder Traversal of a Binary Tree using Iteration
  7. 7Level Order Traversal of a Binary Tree using Recursion
  8. 8Level Order Traversal of a Binary Tree using Iteration
  9. 9Reverse Level Order Traversal of a Binary Tree using Iteration
  10. 10Reverse Level Order Traversal of a Binary Tree using Recursion
  11. 11Find Height of a Binary Tree
  12. 12Find Diameter of a Binary Tree
  13. 13Find Mirror of a Binary Tree
  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
GraphsGraphs46
  1. 1Breadth-First Search in Graphs
  2. 2Depth-First Search in Graphs
  3. 3Number of Provinces in an Undirected Graph
  4. 4Connected Components in a Matrix
  5. 5Rotten Oranges Problem - BFS in Matrix
  6. 6Flood Fill Algorithm - Graph Based
  7. 7Detect Cycle in an Undirected Graph using DFS
  8. 8Detect Cycle in an Undirected Graph using BFS
  9. 9Distance of Nearest Cell Having 1 - Grid BFS
  10. 10Surrounded Regions in Matrix using Graph Traversal
  11. 11Number of Enclaves in Grid
  12. 12Word Ladder - Shortest Transformation using Graph
  13. 13Word Ladder II - All Shortest Transformation Sequences
  14. 14Number of Distinct Islands using DFS
  15. 15Check if a Graph is Bipartite using DFS
  16. 16Topological Sort Using DFS
  17. 17Topological Sort using Kahn's Algorithm
  18. 18Cycle Detection in Directed Graph using BFS
  19. 19Course Schedule - Task Ordering with Prerequisites
  20. 20Course Schedule 2 - Task Ordering Using Topological Sort
  21. 21Find Eventual Safe States in a Directed Graph
  22. 22Alien Dictionary Character Order
  23. 23Shortest Path in Undirected Graph with Unit Distance
  24. 24Shortest Path in DAG using Topological Sort
  25. 25Dijkstra's Algorithm Using Set - Shortest Path in Graph
  26. 26Dijkstra’s Algorithm Using Priority Queue
  27. 27Shortest Distance in a Binary Maze using BFS
  28. 28Path With Minimum Effort in Grid using Graphs
  29. 29Cheapest Flights Within K Stops - Graph Problem
  30. 30Number of Ways to Reach Destination in Shortest Time - Graph Problem
  31. 31Minimum Multiplications to Reach End - Graph BFS
  32. 32Bellman-Ford Algorithm for Shortest Paths
  33. 33Floyd Warshall Algorithm for All-Pairs Shortest Path
  34. 34Find the City With the Fewest Reachable Neighbours
  35. 35Minimum Spanning Tree in Graphs
  36. 36Prim's Algorithm for Minimum Spanning Tree
  37. 37Disjoint Set (Union-Find) with Union by Rank and Path Compression
  38. 38Kruskal's Algorithm - Minimum Spanning Tree
  39. 39Minimum Operations to Make Network Connected
  40. 40Most Stones Removed with Same Row or Column
  41. 41Accounts Merge Problem using Disjoint Set Union
  42. 42Number of Islands II - Online Queries using DSU
  43. 43Making a Large Island Using DSU
  44. 44Bridges in Graph using Tarjan's Algorithm
  45. 45Articulation Points in Graphs
  46. 46Strongly Connected Components using Kosaraju's Algorithm

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

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.

  • If the key appears multiple times, return the index of its last appearance.
  • If the key does not exist in the array, return -1.
  • If the array is empty, return -1.

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

Examples

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

Visualization Player

Solution

Understanding the Problem

We are given a sorted array and a target number called key. Our goal is to find the last occurrence (also called the rightmost index) of this key in the array.

Since the array is sorted, we can use a powerful technique called binary search to solve this efficiently in O(log n) time. However, we need to slightly modify the traditional binary search so that instead of stopping at the first match, we continue looking toward the right side of the array. This way, we ensure that we don’t miss any later occurrences of the same number.

Step-by-Step Solution with Example

Example

Input: arr = [2, 4, 10, 10, 10, 18, 20], key = 10  
Expected Output: 4 (since the last occurrence of 10 is at index 4)

Step 1: Initialize Variables

We begin by setting two pointers: start = 0 and end = length of array - 1. We also set a result variable res = -1 to store the index of the last occurrence (if found).

Step 2: Apply Binary Search

We now enter a loop while start <= end. In each iteration, we calculate the middle index: mid = Math.floor((start + end) / 2).

Then, we compare arr[mid] with the key and take action:

  • Case 1: arr[mid] == key
    We have found an occurrence! But we still want to find if there’s another occurrence further to the right. So, we set res = mid and update start = mid + 1.
  • Case 2: arr[mid] < key
    The key must be on the right, so we move the start pointer to mid + 1.
  • Case 3: arr[mid] > key
    The key must be on the left, so we move the end pointer to mid - 1.

Step 3: End of Search

The loop ends when start > end. At this point, the value of res will either hold the last occurrence index or remain -1 if the key wasn't found.

How the Code Handles Edge Cases

  • If the key occurs once: We find and return that index.
  • If the key occurs multiple times: The algorithm continues to search toward the right, updating the result every time it finds a match, and ultimately returns the last index.
  • If the key does not exist: No match will be found, and the result stays at -1.
  • If the array is empty: The loop never runs, and -1 is returned immediately.

By continuing the search even after finding a match, we make sure we don’t stop too early. This makes our approach robust, especially when the target number appears multiple times. And because we are cutting the search space in half each time, the time complexity is only O(log n), which is very efficient for large arrays.

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

C
C++
Python
Java
JS
Go
Rust
Kotlin
Swift
TS
#include <stdio.h>

int lastOccurrence(int arr[], int n, int key) {
  int start = 0, end = n - 1, res = -1;
  while (start <= end) {
    int mid = start + (end - start) / 2;
    if (arr[mid] == key) {
      res = mid;
      start = mid + 1;
    } else if (key < arr[mid]) {
      end = mid - 1;
    } else {
      start = mid + 1;
    }
  }
  return res;
}

int main() {
  int arr[] = {5, 10, 10, 10, 20, 20};
  int n = sizeof(arr) / sizeof(arr[0]);
  int key = 10;
  printf("Last Occurrence Index: %d\n", lastOccurrence(arr, n, key));
  return 0;
}

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.
Worst 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.


Comments

💬 Please keep your comment relevant and respectful. Avoid spamming, offensive language, or posting promotional/backlink content.
All comments are subject to moderation before being published.


Loading comments...