Try   HackMD

Roadmap

Though I believe there is no roadmap that fits to everyone, but I think this will help as a guide about what to do and from where to do.

As per the telephonic conversation with you, what I've analyzed is you have a good idea about how things work internally but you face difficulty when it comes to implement them or when you try to solve a problem based on those (stack, queue, tree, graph, etc) concepts

So I will suggest what I have done when I was at your place -

Ok so I think for now this is enough, You can complete all of them within a month (If you can devote ~10 hours/week).
Don't forget to revisit the problem (not the video only the problem) after some days.

Note - I will update for other topics in this article itself very soon

Last changed by 
 
Paras Yadav
0
122

Read more

Untitled

Problem Statement Given an integer array arr of size n, return an array of the same size where the value stored at the $i^{th}$ index of this newly formed array denotes the sum of the subarray of arr that starts from the $0^{th}$ index and ends at the $i^{th}$ index.

Jul 12, 2022
Ninja and The Array

So it is clear that numbers greater than 2048 are of no use, because adding them would create a bigger number. So what we will be doing is, we can sum up all the values less than or equal to 2048 and check if the total sum of those elements is >= 2048 or not. The logic behind this is that - If If we can obtain any number greater than 2048 by summing up all the values, we can definetly get 2048 by not taking some of the values (possibly 0). Actually its more of observation by taking various examples, even I cannot think of any fool proof logic here. In these type of scenarios, what I would suggest you to assume any statement (say $x$) and if you cannot think of any test case such that $x$ fails, most of the time $x$ is a true statement.

Jun 8, 2022
New Suggestion

Hi, As we know that most of the standard Data Structures & Algorithm articles have been either published or in the pipeline of Scaler Topics, most of the data structures on which article are not there are quite complex (people do not usually search about them for example Jhonson’s algorithm, Dial’s algorithm, Self Organizing Lists, etc.). So what I (as an active reader) suggest is to publish some detailed editorial/explanation kind of thing of some of the most popular/standard DSA problems in a detailed manner. A list of article to begin with can be - Aggressive Cows (Application of Binary Search) LRU Cache

Apr 25, 2022
Probability Formulas

Moments The $r^{th}$ moment about mean is denoted by - $$ \mu_r^\prime=E(x^r)=\begin{cases} \sum x^r.f(x) & \text{For DRM} \ \int_{-\infty}^{\infty} x^r.f(x) dx & \text{For CRM} \end{cases} $$ Moment Generating Function (MGF)

Apr 10, 2022
Read more from Paras Yadav
Published on HackMD