🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:
Response:
Calculated Shard: 99 (from laksa120)

2. Crawled Status Check

Query:
Response:

3. Robots.txt Check

Query:
Response:

4. Spam/Ban Check

Query:
Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

📍
LOCATION
Host 99 · Partition 19
laksa099
17128001481954483899
📄
INDEXABLE
CRAWLED
17 days ago
🤖
ROBOTS ALLOWED

Page Info Filters

FilterStatusConditionDetails
HTTP statusPASSdownload_http_code = 200HTTP 200
Age cutoffPASSdownload_stamp > now() - 6 MONTH0.6 months ago
History dropPASSisNull(history_drop_reason)No drop reason
Spam/banPASSfh_dont_index != 1 AND ml_spam_score = 0ml_spam_score=0
CanonicalPASSmeta_canonical IS NULL OR = '' OR = src_unparsedNot set

Page Details

PropertyValue
URLhttps://leetcode.com/problems/number-of-visible-people-in-a-queue/
Last Crawled2026-05-17 06:25:29 (17 days ago)
First Indexed2021-07-25 05:32:35 (4 years ago)
HTTP Status Code200
Content
Meta TitleNumber of Visible People in a Queue - LeetCode
Meta DescriptionCan you solve this real interview question? Number of Visible People in a Queue - There are n people standing in a queue, and they numbered from 0 to n - 1 in left to right order. You are given an array heights of distinct integers where heights[i] represents the height of the ith person. A person can see another person to their right in the queue if everybody in between is shorter than both of them. More formally, the ith person can see the jth person if i < j and min(heights[i], heights[j]) > max(heights[i+1], heights[i+2], ..., heights[j-1]). Return an array answer of length n where answer[i] is the number of people the ith person can see to their right in the queue. Example 1: [https://assets.leetcode.com/uploads/2021/05/29/queue-plane.jpg] Input: heights = [10,6,8,5,11,9] Output: [3,1,2,1,1,0] Explanation: Person 0 can see person 1, 2, and 4. Person 1 can see person 2. Person 2 can see person 3 and 4. Person 3 can see person 4. Person 4 can see person 5. Person 5 can see no one since nobody is to the right of them. Example 2: Input: heights = [5,1,2,3,10] Output: [4,1,1,1,0] Constraints: * n == heights.length * 1 <= n <= 105 * 1 <= heights[i] <= 105 * All the values of heights are unique.
Meta Canonicalnull
Boilerpipe Text
heavy column, fetched on demand
Markdown
heavy column, fetched on demand
Readable Markdown
heavy column, fetched on demand
ML Classification
ML Categories
/Computers_and_Electronics
76.3%
/Computers_and_Electronics/Programming
43.0%
/Computers_and_Electronics/Programming/Scripting_Languages
24.5%
/Jobs_and_Education
23.6%
/Jobs_and_Education/Education
18.1%
/Jobs_and_Education/Education/Computer_Education
14.3%
Raw JSON
{
    "/Computers_and_Electronics": 763,
    "/Computers_and_Electronics/Programming": 430,
    "/Computers_and_Electronics/Programming/Scripting_Languages": 245,
    "/Jobs_and_Education": 236,
    "/Jobs_and_Education/Education": 181,
    "/Jobs_and_Education/Education/Computer_Education": 143
}
ML Page Types
/Article
90.5%
/Article/Tutorial_or_Guide
49.5%
Raw JSON
{
    "/Article": 905,
    "/Article/Tutorial_or_Guide": 495
}
ML Intent Types
Informational
97.9%
Raw JSON
{
    "Informational": 979
}
Content Metadata
Languageen
Authornull
Publish Timenot set
Original Publish Time2021-07-25 05:32:35 (4 years ago)
RepublishedNo
Word Count (Total)513
Word Count (Content)205
Links
External Links0
Internal Links21
Technical SEO
Meta NofollowNo
Meta NoarchiveNo
JS RenderedYes
Redirect Targetnull
Performance
Download Time (ms)322
TTFB (ms)312
Download Size (bytes)61,418
Location
Host ID99 (laksa099)
Partition ID19
Root Hash17128001481954483899
Unparsed URLcom,leetcode!/problems/number-of-visible-people-in-a-queue/ s443