Available question text
Given timestamped user page-view logs, compute for each page the top K pages to recommend based on how frequently users navigate from that page to other pages (excluding itself), with deterministic tie-breaking and ordering. The task focuses on counting/co‑occurrence of consecutive visits and producing per‑page ranked top‑N results — typically solved by grouping/aggregation and ranking (e.g., using window functions or efficient streaming counts).
Related questions
Continue with questions that share topics or the same question type.
- Page Recommendations
Coding
- Build a React Web Page to Display GDP Data
Coding
- Design a Versioned Social Follow Graph with Friend Recommendations
Coding
- Implement Follow Graph with Snapshots and Recommendations
Coding · Data Structure Design · Graphs
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1892. Page Recommendations II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source