Blog

Collection: it represents a group of objects as single unit It have two child

https://medium.com/womenintechnology/callbacks-vs-promises-vs-async-await-detailed-comparison-d1f6ae7c778a#:~:text=Conclusion,and%20more%20readable%20code%20structures. In JavaScript, Promise.all, Promise.race, Promise.any, and Promise.allSettled are methods used to handle multiple promises. Here’s a breakdown of each method and how they differ: Promise.all Promise.race Promise.any Promise.allSettled Summary:

Promise.all Deboune Throttle Promise handling promise chaining with only supports of a single onResolveCb and onRejectCb. Native Promises support multiple .then() and .catch() calls by maintaining a list of callbacks.

don’t keep text hard coded istead keep it in config.if data is not changing often then keep it in local i.e in front-end side. if it is changing often put it in database and get it from API if the application is global then suggest them about multi language support

any UI application have 2 layer1. UI Layer or Presentation(Data Layer controls UI layer)2. Data Layer (all the Dynamic Data is in Data Layer) Why do we need State?1. Because of it’s dynamic Behaviour we need State. i.e all the interactivity are managed by state. We will Learn1. Local State (component): any dynamic data in … Read more

Config Driven UI / Backend Driven UI / Dynamic UI Same code => multiple UI, Customizable without deployment in UI you can change change the UI by just change in backend or API

Component Composition: write code Modular, reusable, Readable, Testable first Do Component design before start writing code. it will make your code modular reusable readable, testable, it will be require less refactoring and it will helpful in State management and write proper CSS. SOLID principlefollow single responsibility principle in component design as well when you have … Read more

Graph https://www.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/1 2. BFS https://www.geeksforgeeks.org/problems/bfs-traversal-of-graph/1 Missed: make the child visited just after pushing into the queue because it might be child of other node as well. visited[child] = 1;