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.
DEV.to (Top) files mainly under programming. We currently carry 4,924 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | DEV.to (Top) |
| Canonical URL | https://dev.to/shipra_shakya_5ebf9808e2a/leetcode-qotd-3043-find-the-length-of-the-longest-common-prefix-3nb |
| Publication time | Thu, 21 May 2026 02:12:10 +0000 |
| Retrieval time | 2026-05-21T02:35:03.339Z |
| Last seen | 2026-05-21T02:35:03.339Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | TA8kHY4UJrXr |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
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)
