If you are not sure if the website you would like to visit is secure, you can verify it here. Enter the website address of the page and see parts of its content and the thumbnail images on this site. None (if any) dangerous scripts on the referenced page will be executed. Additionally, if the selected site contains subpages, you can verify it (review) in batches containing 5 pages.
favicon.ico: leetcodejavascript.com/solutions/maximum-binary-tree - #654 - Maximum Binary Tree - L.

site address: leetcodejavascript.com/solutions/maximum-binary-tree

site title: #654 - Maximum Binary Tree - LeetCode JavaScript Solutions

Our opinion (on Wednesday 18 November 2026 22:53:57 UTC):

GREEN status (no comments) - no comments
After content analysis of this website we propose the following hashtags:


page from cache:  10 secunds ago
Meta tags:
description=You are given an integer array nums with no duplicates. A maximum binary tree can be built recursively from nums using the following algorit...;
keywords=leetcode, javascript, solutions, algorithms, data structures, coding, programming, coding challenges, coding problems, coding solutions;
author=;

Headings (most frequently used words):

654, maximum, binary, tree, problem, description, solution,

Text of the page (most frequently used words):
nums (11), the (11), tree (7), left (7), right (7), #maximum (7), binary (6), val (4), return (4), max (4), head (4), value (4), treenode (3), this (3), undefined (3), null (3), constructmaximumbinarytree (3), const (3), index (3), recursively (3), leetcodejavascript (2), com (2), node (2), function (2), slice (2), built (2), from (2), build (2), subtree (2), subarray (2), array (2), stack (2), view (2), github (2), leetcode (2), 654 (2), solutions (2), 2025, josh, crozier, definition, for, param, number, var, length, math, indexof, new, solution, suffix, prefix, create, root, whose, you, are, given, integer, with, duplicates, can, using, following, algorithm, problem, description, divide, and, conquer, monotonic, medium, back, all, star, javascript,


Text of the page (random words):
654 maximum binary tree leetcode javascript solutions leetcodejavascript com star on github back to all solutions 654 maximum binary tree medium view on leetcode view on github array tree binary tree stack monotonic stack divide and conquer problem description you are given an integer array nums with no duplicates a maximum binary tree can be built recursively from nums using the following algorithm create a root node whose value is the maximum value in nums recursively build the left subtree on the subarray prefix to the left of the maximum value recursively build the right subtree on the subarray suffix to the right of the maximum value return the maximum binary tree built from nums solution definition for a binary tree node function treenode val left right this val val undefined 0 val this left left undefined null left this right right undefined null right param number nums return treenode var constructmaximumbinarytree function nums if nums length return null const max math max nums const index nums indexof max const head new treenode max head left constructmaximumbinarytree nums slice 0 index head right constructmaximumbinarytree nums slice index 1 return head 2025 leetcodejavascript com josh crozier
Images from subpage: "leetcodejavascript.com" Verify
Images from subpage: "leetcodejavascript.com/tags/array" Verify
Images from subpage: "leetcodejavascript.com/tags/tree" Verify
Images from subpage: "leetcodejavascript.com/tags/binary-tree" Verify
Images from subpage: "leetcodejavascript.com/tags/stack" Verify

Verified site has: 7 subpage(s). Do you want to verify them? Verify pages:

1-5 6-7


The site also has 3 references to external domain(s).

 github.com  Verify  leetcode.com  Verify  joshcrozier.com  Verify


Top 50 hastags from of all verified websites.

Supplementary Information (add-on for SEO geeks)*- See more on header.verify-www.com

Header

HTTP/2 200
date Wed, 18 Nov 2026 22:53:47 GMT
content-type text/html; charset=utf-8
x-frame-options DENY
report-to group : cf-nel , max_age :604800, endpoints :[ url : htt????/a.nel.cloudflare.com/report/v4?s=LnYnBXieeo8ST%2B%2BOaaukQ4blQ074OZUr8UB2S7oSGebmxbo4Mn98Bnd6ZD3Db%2FXbjTXDMI5fh6aPe8jGh%2BeCl6AWEophK%2BQ5vhcRSbcguZuu1Y%2FrLgnwhEKBsPReFRtmafWvqknHdytw ]
nel report_to : cf-nel , success_fraction :0.0, max_age :604800
access-control-allow-origin htt????/leetcodejavascript.com
cache-control public, max-age=14400, must-revalidate
x-content-type-options nosniff
strict-transport-security max-age=31536000
permissions-policy geolocation=(), microphone=(), camera=(), payment=(), usb=(), accelerometer=(), gyroscope=(), magnetometer=()
referrer-policy no-referrer
vary accept-encoding
server cloudflare
last-modified Wed, 18 Nov 2026 22:53:47 GMT
cf-cache-status EXPIRED
content-encoding gzip
cf-ray a5ca8da66cd311ff-CDG
alt-svc h3= :443 ; ma=86400

Meta Tags

title="#654 - Maximum Binary Tree - LeetCode JavaScript Solutions"
charset="UTF-8"
content="width=device-width,initial-scale=1" name="viewport"
content="You are given an integer array nums with no duplicates. A maximum binary tree can be built recursively from nums using the following algorit..." name="description"
content="leetcode, javascript, solutions, algorithms, data structures, coding, programming, coding challenges, coding problems, coding solutions" name="keywords"
content="LeetCodeJavascript.com" name="author"
content="index, follow" name="robots"
content="article" property="og:type"
content="htt????/leetcodejavascript.com/solutions/maximum-binary-tree" property="og:url"
content="#654 - Maximum Binary Tree - LeetCode JavaScript Solutions" property="og:title"
content="You are given an integer array nums with no duplicates. A maximum binary tree can be built recursively from nums using the following algorit..." property="og:description"
content="htt????/leetcodejavascript.com/og-image.jpg" property="og:image"
content="LeetCode JavaScript Solutions" property="og:site_name"
content="summary_large_image" name="twitter:card"
content="htt????/leetcodejavascript.com/solutions/maximum-binary-tree" name="twitter:url"
content="#654 - Maximum Binary Tree - LeetCode JavaScript Solutions" name="twitter:title"
content="You are given an integer array nums with no duplicates. A maximum binary tree can be built recursively from nums using the following algorit..." name="twitter:description"
content="htt????/leetcodejavascript.com/og-image.jpg" name="twitter:image"
content="@joshcrozier" name="twitter:creator"
content="#1f2937" name="theme-color"

Load Info

page size9252
load time (s)0.12802
redirect count0
speed download21312
server IP 188.114.97.0
* all occurrences of the string "http://" have been changed to "htt???/"