This is the 19th day of the Competitive programming journey. I am happy to have started this. Through this journey I have discovered many platforms and their workings. In this journey I had come accross working with Strings, Arrays and many more data structures. Today I have solved questions from Leetcode.
Concepts involved :-
1.Merge two sorted arrays - Arrays, loops, conditional statements.
2.Maximum Subarray - Arrays, loops, conditional statements.
First question I did for today is "Merge two sorted arrays". This question made me get a good grip over Arrays and their traversal. This question deals with merging two subarrays being sorted.
Secondly I did a question called "Maximum Subarray".This dealt with Arrays and their traversal.Here we have to find the maximum sum of sub array.
Top comments (0)