42c39 No.1049
Ever tried to pair numbers from different sequences and felt like solving a puzzle? Well, this problem takes it up a notch. The challenge here is finding the best hidden sub-sequences within two arrays of integers - nums1 and nums2 - that'll give us an amazing dot product result! Here’s what we got: You need to find the maximum possible dot products between nonempty subsequence pairs from these two numberseries. Sounds fun, right? I couldn't resist giving it a shot myself and found some interesting patterns along the way… What do you guys think about this one or have any tips on how we can optimize our solutions further?! Let’s share 'em!
Source:
https://dev.to/om_shree_0709/beginner-friendly-guide-max-dot-product-of-two-subsequences-leetcode-1458-c-python-2mgf