CampusX Data Science Mentorship Program 2022-23 - Array Interview Questions | Paid Members | Data Science Mentorship Program(DSMP) 2022-23

🔖 *Chapters:* 📝 *Topic 0 - Session Start* 00:00:00 - Session start 00:02:12 - Discussion & Plan of attack 00:05:06 - Important points have to remember 📝 *Topic 1 - Solving Questions* 00:09:24 - Question no 10 00:43:42 - Question no 09 01:19:56 - Question no 08 01:43:05 - Question no 07 01:52:50 - Question no 06 02:00:10 - Question no 05 02:03:45 - Question no 04 02:05:00 - Question no 03 02:07:07 - Question no 02 02:10:52 - Question no 01 📝 *Topic 2 - Session end* 02:13:59 - Discussions and further resources *Note:* Last method which is shown in question no 10, has time complexity of O(n*k). As the built-in clear() method has O(k) time complexity itself. And k is the times the clear() method is called. This k can also vary. *Code* - https://colab.research.google.com/drive/1xUoy5AW_vlI92xbIcfEbnx0ZnGb7IKbj?usp=sharing *Practice here* - https://practice.geeksforgeeks.org/explore?page=1&category[]=Arrays&sortBy=submissions ############################################################# Time Stamp: 40:00. Q10 Maximum Sum SubArray. Getting the best sum but Array printed is not correct. This is happening because of list referencing. Say we have a list a = [1,2,3] and another list b which is referencing a, so if we make changes in a, b will also change. But if we assign b like:  b = a[:] This time upon changing a, b will not change. Correction in approach 1 :  d[sum(subarray)] = subarray[:] # Cloning will solve this. Correction in Approach 2: best_seq = curr_seq[:]