Pages

Thursday, June 26, 2025

Iterative Search in Linked List in C++

 int searchItr(int key) {
Node* temp = head;

int idx = 0;


while(temp != NULL) {
if(temp->data == key) {
return idx; }
temp = temp->next;

idx++; }
return -1;



No comments:

Post a Comment

3917. Count Indices With Opposite Parity (Brute Force) O(n2) + Optimized Solution O(n) + tips LEETCODE WEEKLY 500

  class Solution {     public int [] countOppositeParity ( int [] nums ) {          // approach 1 - checks every pair         int n = n...