Arrays – Data Structures and Algorithms in Javascript | Frontend DSA Interview Questions

#javascriptinterviewquestions #datastructures #datastructuresandalgorithms

In this video, we will dive into Array methods in JavaScript and explore their various use cases. We will also discuss commonly DSA interview questions related to Arrays and how to solve them using JavaScript.
This is the most Entertaining and Knowledge Packed Data Structures and Algorithms in Javascript Interview Course on Youtube !

➡️ Book an Interview Preparation call with me –
https://topmate.io/roadsidecoder

🟦 Follow me on Twitter and u will clear your interview 🤓 –
https://twitter.com/piyush_eon

➡️ Source Code –
https://github.com/piyush-eon/dsa-with-javascript-course

📄 Homework Questions ( I will make videos on these questions as well ) –
https://leetcode.com/problems/move-zeroes/
https://leetcode.com/problems/maximum-difference-between-increasing-elements/
https://leetcode.com/problems/contains-duplicate/
https://leetcode.com/problems/intersection-of-two-arrays/

🔗 Complete Data Structures and Algorithms with JS Course –
https://www.youtube.com/playlist?list=PLKhlp2qtUcSZtJefDThsXcsAbRBCSTgW4

🔗 Big O Notation Video –
https://www.youtube.com/watch?v=LaexPVi1VRE&list=PLKhlp2qtUcSZtJefDThsXcsAbRBCSTgW4&index=5

🔗 Functions Video –
https://www.youtube.com/watch?v=btwFJT_xzdg&list=PLKhlp2qtUcSaCVJEt4ogEFs6I41pNnMU5&index=3

🔗 Map, filter and reducr video –
https://www.youtube.com/watch?v=dGq0gi0wv64&list=PLKhlp2qtUcSaCVJEt4ogEFs6I41pNnMU5&index=2

🔗 Frontend Machine Coding Interview Series –
https://www.youtube.com/playlist?list=PLKhlp2qtUcSYQojD5G-ElgHezoCyq2Hgo

🔗 Cars24 Interview Experience –
https://www.youtube.com/watch?v=vxggZffOqek&list=PLKhlp2qtUcSb_WQZC3sq9Vw3NC4DbreUL&index=2

🔗 Unacademy Interview Experience –
https://www.youtube.com/watch?v=abbdJ4Yfm54

🔗 Tazorpay Interview Experience –
https://www.youtube.com/watch?v=q-ylRxSxGcY

🔗 MERN Stack Tutorial with Redux –
https://www.youtube.com/watch?v=IQXjO0t4XRM&list=PLKhlp2qtUcSYC7EffnHzD-Ws2xG-j3aYo

🔗 React Beginner’s Project Tutorials –
https://www.youtube.com/playlist?list=PLKhlp2qtUcSa_rX7glmB7HyFsEOEQa0Uk

————————————————————————-

00:00:00 Intro
00:00:54 Creating an Array
00:01:34 Initializing an Array
00:02:24 What all can array store?
00:03:24 Array length Property
00:03:54 Add / Remove items in Array
00:03:58 Push and Pop method
00:05:32 shift and unshift method
00:06:29 Looping the Arrays
00:06:49 “for” loop
00:07:37 “while” loop
00:08:09 Inbuilt Traversal Methods
00:08:25 map() in Arrays
00:10:14 filter() in Arrays
00:10:59 reduce() in Arrays
00:12:55 some() in Arrays
00:13:25 every() in Arrays
00:14:01 find() in Arrays
00:14:42 Spread and Rest Operators
00:17:51 More Array Methods
00:17:56 concat() in Arrays
00:19:19 slice() in Arrays
00:21:13 splice() in Arrays
00:22:47 fill() in Arrays
00:23:58 findIndex() in Arrays
00:25:09 flat() in Arrays
00:26:19 Technical Glitch
00:26:48 reverse() in Arrays
00:27:18 sort() in Arrays
00:29:44 DSA Interview Questions on Array in Javascript
00:29:50 Ques 1 – Second Largest Number
00:30:28 Solution #1 – Brute Force Approach
00:34:46 Time Complexity of this Algorithm
00:36:33 Solution #2 – Optimised Approach
00:39:30 Explanation of Solution #2
00:41:29 Time Complexity of this Algorithm
00:42:26 Space Complexity of this Algorithm
00:42:49 Ques 2 – Rotate Array by K
00:43:51 Solution #1 – Using Inbuilt JS Functions
00:48:40 Time Complexity of this Algorithm
00:49:24 Solution #2 – Without Inbuilt Functions
00:56:26 Time Complexity of this Algorithm
00:57:29 Space Complexity of this Algorithm
00:58:16 Ques 3 – Remove Duplicates from Sorted Array
00:59:20 Solution #1 – With Inbuilt JS Methods
01:03:08 Time Complexity of this Algorithm
01:03:32 Space Complexity of this Algorithm
01:03:41 Solution #2 – Two Pointer Approach
01:07:28 Explanation of above algorithm
01:10:22 Time / Space Complexity of this Algorithm

————————————————————————-

⭐ Support the channel and learn from me One on One –
https://www.youtube.com/channel/UCIPZVAwDGa-A4ZJxCBvXRuQ/join

Special Thanks to our members –