- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Program to find dot product of run length encoded vectors in Python

Suppose we have two lists nums1 and nums2. Each of these two list are representing a vector in run-length encoded form. So as an example, a vector [1, 1, 1, 2, 2, 2, 2] is represented as [3, 1, 4, 2]. (because there are 3 ones and 4 twos). So we have to find the dot product of these two vectors. (The dot product is the sum of element wise multiplication of items present in two vectors).

So, if the input is like nums1 = [2, 7, 5, 3] nums2 = [3, 5, 4, 2], then the output will be 109 because, the vectors are like [7, 7, 3, 3, 3, 3, 3] • [5, 5, 5, 2, 2, 2, 2] = 7*5 + 7*5 + 3*5 + 3*2 + 3*2 + 3*2 + 3*2 = 35 + 35 + 15 + 6 + 6 + 6 + 6 = 109.

To solve this, we will follow these steps −

- ans := 0
- while nums1 and nums2 both are non-empty, do
- val1 := last element from nums1 and delete the last item
- count1 := last element from nums1 and delete the last item
- val2 := last element from nums2 and delete the last item
- count2 := last element from nums2 and delete the last item
- ans := ans + (val1 * val2) * (minimum of count2 and count1)
- if count2 > count1, then
- insert |count2 - count1| at the end of nums2
- insert val2 at the end of nums2

- otherwise when count1 > count2, then
- insert |count2 - count1| at the end of nums1
- insert val1 at the end of nums1

- return ans

## Example

Let us see the following implementation to get better understanding −

def solve(nums1, nums2): ans = 0 while nums1 and nums2: val1 = nums1.pop() count1 = nums1.pop() val2 = nums2.pop() count2 = nums2.pop() ans += (val1 * val2) * min(count2, count1) if count2 > count1: nums2.append(abs(count2 - count1)) nums2.append(val2) elif count1 > count2: nums1.append(abs(count2 - count1)) nums1.append(val1) return ans nums1 = [2, 7, 5, 3] nums2 = [3, 5, 4, 2] print(solve(nums1, nums2))

## Input

[2, 7, 5, 3], [3, 5, 4, 2]

## Output

109

- Related Articles
- Program to find out the dot product of two sparse vectors in Python
- Return the dot product of two vectors in Python
- C++ Program for dot product and cross product of two vectors
- Return the dot product of two multidimensional vectors in Python
- Return the dot product of One-Dimensional vectors in Python
- Program to find minimum length of lossy Run-Length Encoding in Python
- Program to find min length of run-length encoding after removing at most k characters in Python
- Program to find maximum length of subarray with positive product in Python
- C++ Program to Compute Cross Product of Two Vectors
- Program to implement run length string decoding iterator class in Python
- Compute the tensor dot product in Python
- Run Length Encoding in Python
- How to find the dot product of two matrices in R?
- Program to decode a run-length form of string into normal form in Python
- Return the cross product of two (arrays of) vectors in Python