Leetcode QOTD:- 3043. Find the Length of the Longest Common Prefix
The article discusses a coding problem from Leetcode that focuses on finding the length of the longest common prefix between two arrays of integers. It outlines a solution using a HashSet to store prefixes from the first array and checks these against the second array. The approach involves iterating through the numbers, removing digits, and determining the maximum length of matching prefixes.
- ▪The problem is titled 'Find the Length of the Longest Common Prefix' and is part of Leetcode's Question of the Day.
- ▪A HashSet is used to store all prefixes of numbers from the first array.
- ▪The solution involves checking prefixes from the second array against those stored in the HashSet.
Opening excerpt (first ~120 words) tap to expand
try { if(localStorage) { let currentUser = localStorage.getItem('current_user'); if (currentUser) { currentUser = JSON.parse(currentUser); if (currentUser.id === 3729866) { document.getElementById('article-show-container').classList.add('current-user-is-article-author'); } } } } catch (e) { console.error(e); } shipra Shankhwar Posted on May 21 Leetcode QOTD:- 3043. Find the Length of the Longest Common Prefix #leetcode #java #interview Store all prefixes of numbers from arr1 in a HashSet. Example for 12345: 12345 1234 123 12 1 We get these prefixes by repeatedly dividing by 10. Then for every number in arr2, keep removing digits from the end and check if that prefix exists in the set. Example: 1239 → 123 → found So common prefix length = 3.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at DEV.to (Top).
Discussion
0 commentsMore from DEV.to (Top)
