Extra Element | Daily Dose - 3 | Interview Questions | Geeks for Geeks | Tamil | code io

Index Of an Extra Element
practice.geeksforgeeks.org/pr...
You are given a couple of arrays, you are expected return the missing element from the second array
Follow us in Instagram for more updates
/ code.i.o
#gfg #DailyDose #codeio

[@kidswellstudy6610]

K but you have to change your concept...your program will work only when the missing number is after the mid position...in the case of before mid it will be wrong

[@suganeshrajaram5497]

Nice✨

[@codeio]

Thanks thanks 😊

[@nithishkumark1644]

Questions la bayangrama prepare panni irukkanga ✨✨

[@codeio]

Thanks thanks 😅😅

[@harikrish07]

Solution 1: Time complexity:O(log N) def myfun(n,a,b): s=0 e=n-1 while s

[@karthekeyanz]

// Time Complexity: O(N) + Space Complexity: O(1) > Brute Force Approach int findExtra(int a[], int b[], int n) { if (a == null || b == null || a.length == b.length) return -1; int minLen = a.length < b.length ? a.length : b.length; for (int i = 0; i < minLen; i++) { if (a[i] != b[i]) return i; } return a.length > b.length ? a.length - 1 : b.length - 1; }

[@codeio]

Great Approach bro🤩🤩🤩

[@karthekeyanz]

// Time Complexity: O(log N) + Space Complexity: O(1) > Binary Search Approach int findExtra(int a[], int b[], int n) { if (a == null || b == null || a.length == b.length) return -1; int start = 0, end = n - 1, extraElementIndex = 0; while (start

[@codeio]

Awesome bro🤩🤩🤩