Guide to Solving Dynamic Array Coding Challenges in Javascript
Liz is kicking off a new series in this video where she focuses on dynamic arrays. Although arrays are often seen as a simpler data structure, dynamic array questions often come up in interviews since they test a baseline understanding of key concepts.
In this video, Liz walks through a dynamic array problem and touches on how memory allocation & amortization works with array resizing.
Coding challenge prompt Liz walks through in the video:
Given an array (arr) of integers, return an array (products) such that products[i] is equal to the product of all the elements of arr except arr[i]. Solve without the division operator in O(n) time.
1:10 The Problem
3:15 The Naive Approach
6:37 The Greedy Approach
11:50 Coding a Javascript Solution
33:22 What are Dynamic Arrays?
34:16 Appending & Amortization
38:24 Recap
Additional Resources:
* Practice hundreds of real coding challenges at https://coderbyte.com/
* Need more practice? Check out our channel for more videos on preparing for a coding interview / coderbytedevelopers
In questa pagina del sito puoi guardare il video online Guide to Solving Dynamic Array Coding Challenges in Javascript della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Coderbyte 14 giugno 2021, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 10,916 volte e gli è piaciuto 161 spettatori. Buona visione!
