DSA

Linear Search

Arrays. Time O(n), Space O(1).

August 8, 2026

Given an array of integers nums and an integer target, find the smallest index (0 based indexing) where the target appears in the array. If the target is not found in the array, return -1

cpp

class Solution {
public:
    int linearSearch(vector<int>& nums, int target) {
        for(int i=0;i<nums.size();i++){
            if(nums[i]==target)
                return i;
        }
        return -1;
    }
};

Time Complexity: O(n)

Space Complexity: O(1)

DSAMajority Element IIExtended Boyer-Moore Voting — find all elements appearing more than ⌊n/3⌋ times. Time O(n), Space O(1).DSARemove Duplicates from Sorted Array IIKeep each unique element at most twice in-place. Optimal — Time O(n), Space O(1).DSARotate ArrayCovers: Brute Force, Extra Array, Optimal (Reverse). Optimal — Time O(n), Space O(1).

Related articles