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.

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.

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 - Stack Playalist from Aditya Verma Just watch the video then search for them problem on LeetCode or GeeksForGeeks and code it there. If any issue is there refer to the discuss section of the concerned platform (this applies to every point). Recursion from Striver (Raj Vikramaditya) Same watch videos and then practice problems. Free Ka Tree Series This is very much important as this will help you in graph algorithms.

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

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)

:::success Number of questions? Direct questions (Like Assignments) or some story will be given (just like Hackerrank)? Do we need to write the code on paper? Any other thing except the code that is needed to submitted? Let's say we've got a question on Kruskal/Prim/Dijkstra's algorithm, are we supposed to build the heap or we can use the pre-existingl library $i.e.$ PriorityQueue? ::: :::info If possible, please give an example question so that we can get a better idea.

$1^{st}$ Semester Tutiton Fee - $59,400$ Other Fees - $25,800$ Hostel Caution Fee - $8,000$ Hostel Room Fees - $10,700$ Mess Charges - $15,400$ So, Total Hostel & Mess fee paid = $26,100$ Total Fees submitted in First Semester = $1,19,300$

BCNF - LHS of all FDs should be CK or SK 3rd NF - LHS should be CK or RHS should be Prime Attribute 2nd NF - No partial FDs PFD - LHS is subse of CK and RHS is non prime

You will be awarded a grade based on your makrs with respect to others. Following are the grades awarded in our college. Grade Points S 10 A