This is the video under the series of DATA STRUCTURE & ALGORITHM in a HASHING Playlist. We are going to solve the problem First Repeating Element from geeksforgeeks which is solved by using unordered_map in c++
Given an array arr[] of size n, find the first repeating element. The element should occur more than once and the index of its first occurrence should be the smallest.
Input:
n = 7
arr[] = {1, 5, 3, 4, 3, 5, 6}
Output: 2
Explanation: 5 is appearing twice and its first appearance is at index 2 which is less than 3 whose first occurring index is 3.
We also Provide courses on Competitive Programming and Data structure. Please see our Full Playlist on our Channel.
We also Provide courses on Competitive Programming and Data structure and Algorithms. Please see our Full Playlist on our Channel.
----------------------------------------------------------------------------------------
Home Work: HW: https://practice.geeksforgeeks.org/pr...
First Repeating Element: https://practice.geeksforgeeks.org/pr...
code in This Video: https://github.com/Prince-1501/Hello_...
Pdf in this video: https://github.com/Prince-1501/Hello_...
----------------------------------------------------------------------------------------
*Follow me *
LinkedIn► / iamprince
Facebook► / helloworldofficials
Instagram► / helloworldbyprince
Twitter► / prince_king_
Telegram► https://telegram.me/helloworldbyprince
----------------------------------------------------------------------------------------
►Our Playlists on:-
►Competitive Programming: • How to start Competitive Programming ...
►C++ Full Course : • L-01 || Introduction and History of C...
►Algorithms: • L-01 || Prefix Sum Array || Algorithms
►Data Structure: • Data Structures with Code Practice | ...
------------------------------------------------------------------------
#hashing #geeksforgeeks #programming