kaysss/leetcode-problem-set · Datasets at Hugging Face

acRate float64 9.28 95.3	difficulty stringclasses 3 values	frontendQuestionId int64 1 3.51k	isFavor bool 1 class	paidOnly bool 2 classes	title stringlengths 3 79	titleSlug stringlengths 3 79	topicTags stringlengths 2 153	hasSolution bool 2 classes	hasVideoSolution bool 2 classes
49.582216	Hard	601	false	false	Human Traffic of Stadium	human-traffic-of-stadium	['Database']	true	false
60.352865	Medium	602	false	false	Friend Requests II: Who Has the Most Friends	friend-requests-ii-who-has-the-most-friends	['Database']	true	false
65.447689	Easy	603	false	true	Consecutive Available Seats	consecutive-available-seats	['Database']	true	false
40.100732	Easy	604	false	true	Design Compressed String Iterator	design-compressed-string-iterator	['Array', 'String', 'Design', 'Iterator']	true	false
28.838214	Easy	605	false	false	Can Place Flowers	can-place-flowers	['Array', 'Greedy']	true	false
69.956792	Medium	606	false	false	Construct String from Binary Tree	construct-string-from-binary-tree	['String', 'Tree', 'Depth-First Search', 'Binary Tree']	true	false
65.819592	Easy	607	false	false	Sales Person	sales-person	['Database']	true	false
73.635791	Medium	608	false	false	Tree Node	tree-node	['Database']	true	false
67.554776	Medium	609	false	false	Find Duplicate File in System	find-duplicate-file-in-system	['Array', 'Hash Table', 'String']	true	false
73.410743	Easy	610	false	false	Triangle Judgement	triangle-judgement	['Database']	true	false
52.041466	Medium	611	false	false	Valid Triangle Number	valid-triangle-number	['Array', 'Two Pointers', 'Binary Search', 'Greedy', 'Sorting']	true	false
61.273532	Medium	612	false	true	Shortest Distance in a Plane	shortest-distance-in-a-plane	['Database']	true	false
79.989844	Easy	613	false	true	Shortest Distance in a Line	shortest-distance-in-a-line	['Database']	true	false
39.764745	Medium	614	false	true	Second Degree Follower	second-degree-follower	['Database']	false	false
56.590832	Hard	615	false	true	Average Salary: Departments VS Company	average-salary-departments-vs-company	['Database']	true	false
50.788529	Medium	616	false	true	Add Bold Tag in String	add-bold-tag-in-string	['Array', 'Hash Table', 'String', 'Trie', 'String Matching']	true	false
79.232363	Easy	617	false	false	Merge Two Binary Trees	merge-two-binary-trees	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	false
63.66357	Hard	618	false	true	Students Report By Geography	students-report-by-geography	['Database']	true	false
68.952681	Easy	619	false	false	Biggest Single Number	biggest-single-number	['Database']	true	false
74.82777	Easy	620	false	false	Not Boring Movies	not-boring-movies	['Database']	true	false
61.107064	Medium	621	false	false	Task Scheduler	task-scheduler	['Array', 'Hash Table', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting']	true	false
52.464872	Medium	622	false	false	Design Circular Queue	design-circular-queue	['Array', 'Linked List', 'Design', 'Queue']	true	false
64.032304	Medium	623	false	false	Add One Row to Tree	add-one-row-to-tree	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	false
45.60368	Medium	624	false	false	Maximum Distance in Arrays	maximum-distance-in-arrays	['Array', 'Greedy']	true	false
33.759276	Medium	625	false	true	Minimum Factorization	minimum-factorization	['Math', 'Greedy']	true	true
72.277353	Medium	626	false	false	Exchange Seats	exchange-seats	['Database']	true	false
83.882499	Easy	627	false	false	Swap Salary	swap-salary	['Database']	true	false
45.253994	Easy	628	false	false	Maximum Product of Three Numbers	maximum-product-of-three-numbers	['Array', 'Math', 'Sorting']	true	false
49.09847	Hard	629	false	false	K Inverse Pairs Array	k-inverse-pairs-array	['Dynamic Programming']	true	false
40.498104	Hard	630	false	false	Course Schedule III	course-schedule-iii	['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']	true	false
43.667328	Hard	631	false	true	Design Excel Sum Formula	design-excel-sum-formula	['Array', 'Hash Table', 'String', 'Graph', 'Design', 'Topological Sort', 'Matrix']	true	false
69.719178	Hard	632	false	false	Smallest Range Covering Elements from K Lists	smallest-range-covering-elements-from-k-lists	['Array', 'Hash Table', 'Greedy', 'Sliding Window', 'Sorting', 'Heap (Priority Queue)']	true	false
36.411386	Medium	633	false	false	Sum of Square Numbers	sum-of-square-numbers	['Math', 'Two Pointers', 'Binary Search']	true	false
41.701347	Medium	634	false	true	Find the Derangement of An Array	find-the-derangement-of-an-array	['Math', 'Dynamic Programming', 'Combinatorics']	true	false
59.224791	Medium	635	false	true	Design Log Storage System	design-log-storage-system	['Hash Table', 'String', 'Design', 'Ordered Set']	true	false
64.324111	Medium	636	false	false	Exclusive Time of Functions	exclusive-time-of-functions	['Array', 'Stack']	true	false
73.885817	Easy	637	false	false	Average of Levels in Binary Tree	average-of-levels-in-binary-tree	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	false
51.823796	Medium	638	false	false	Shopping Offers	shopping-offers	['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Memoization', 'Bitmask']	true	false
31.094365	Hard	639	false	false	Decode Ways II	decode-ways-ii	['String', 'Dynamic Programming']	true	false
44.4375	Medium	640	false	false	Solve the Equation	solve-the-equation	['Math', 'String', 'Simulation']	true	false
64.549898	Medium	641	false	false	Design Circular Deque	design-circular-deque	['Array', 'Linked List', 'Design', 'Queue']	true	false
49.305471	Hard	642	false	true	Design Search Autocomplete System	design-search-autocomplete-system	['String', 'Depth-First Search', 'Design', 'Trie', 'Sorting', 'Heap (Priority Queue)', 'Data Stream']	true	false
44.919526	Easy	643	false	false	Maximum Average Subarray I	maximum-average-subarray-i	['Array', 'Sliding Window']	true	false
37.3592	Hard	644	false	true	Maximum Average Subarray II	maximum-average-subarray-ii	['Array', 'Binary Search', 'Prefix Sum']	true	true
44.848396	Easy	645	false	false	Set Mismatch	set-mismatch	['Array', 'Hash Table', 'Bit Manipulation', 'Sorting']	true	false
60.671894	Medium	646	false	false	Maximum Length of Pair Chain	maximum-length-of-pair-chain	['Array', 'Dynamic Programming', 'Greedy', 'Sorting']	true	false
71.407084	Medium	647	false	false	Palindromic Substrings	palindromic-substrings	['Two Pointers', 'String', 'Dynamic Programming']	true	false
68.282988	Medium	648	false	false	Replace Words	replace-words	['Array', 'Hash Table', 'String', 'Trie']	true	false
48.633654	Medium	649	false	false	Dota2 Senate	dota2-senate	['String', 'Greedy', 'Queue']	true	false
59.515145	Medium	650	false	false	2 Keys Keyboard	2-keys-keyboard	['Math', 'Dynamic Programming']	true	false
55.860528	Medium	651	false	true	4 Keys Keyboard	4-keys-keyboard	['Math', 'Dynamic Programming']	true	false
59.966429	Medium	652	false	false	Find Duplicate Subtrees	find-duplicate-subtrees	['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree']	true	false
62.004375	Easy	653	false	false	Two Sum IV - Input is a BST	two-sum-iv-input-is-a-bst	['Hash Table', 'Two Pointers', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Search Tree', 'Binary Tree']	true	false
85.830131	Medium	654	false	false	Maximum Binary Tree	maximum-binary-tree	['Array', 'Divide and Conquer', 'Stack', 'Tree', 'Monotonic Stack', 'Binary Tree']	true	false
65.332897	Medium	655	false	false	Print Binary Tree	print-binary-tree	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	false
32.366653	Hard	656	false	true	Coin Path	coin-path	['Array', 'Dynamic Programming']	true	false
76.078514	Easy	657	false	false	Robot Return to Origin	robot-return-to-origin	['String', 'Simulation']	true	false
48.454244	Medium	658	false	false	Find K Closest Elements	find-k-closest-elements	['Array', 'Two Pointers', 'Binary Search', 'Sliding Window', 'Sorting', 'Heap (Priority Queue)']	true	false
51.420342	Medium	659	false	false	Split Array into Consecutive Subsequences	split-array-into-consecutive-subsequences	['Array', 'Hash Table', 'Greedy', 'Heap (Priority Queue)']	true	false
57.357139	Hard	660	false	true	Remove 9	remove-9	['Math']	true	false
68.168482	Easy	661	false	false	Image Smoother	image-smoother	['Array', 'Matrix']	true	false
43.864772	Medium	662	false	false	Maximum Width of Binary Tree	maximum-width-of-binary-tree	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	false
41.532113	Medium	663	false	true	Equal Tree Partition	equal-tree-partition	['Tree', 'Depth-First Search', 'Binary Tree']	true	false
60.783685	Hard	664	false	false	Strange Printer	strange-printer	['String', 'Dynamic Programming']	true	false
25.007712	Medium	665	false	false	Non-decreasing Array	non-decreasing-array	['Array']	true	false
62.620038	Medium	666	false	true	Path Sum IV	path-sum-iv	['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree']	true	false
60.331402	Medium	667	false	false	Beautiful Arrangement II	beautiful-arrangement-ii	['Array', 'Math']	true	false
52.606734	Hard	668	false	false	Kth Smallest Number in Multiplication Table	kth-smallest-number-in-multiplication-table	['Math', 'Binary Search']	true	false
66.339871	Medium	669	false	false	Trim a Binary Search Tree	trim-a-binary-search-tree	['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']	true	true
51.739607	Medium	670	false	false	Maximum Swap	maximum-swap	['Math', 'Greedy']	true	false
45.184701	Easy	671	false	false	Second Minimum Node In a Binary Tree	second-minimum-node-in-a-binary-tree	['Tree', 'Depth-First Search', 'Binary Tree']	true	false
49.450986	Medium	672	false	false	Bulb Switcher II	bulb-switcher-ii	['Math', 'Bit Manipulation', 'Depth-First Search', 'Breadth-First Search']	true	false
49.488573	Medium	673	false	false	Number of Longest Increasing Subsequence	number-of-longest-increasing-subsequence	['Array', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree']	true	false
50.96813	Easy	674	false	false	Longest Continuous Increasing Subsequence	longest-continuous-increasing-subsequence	['Array']	true	false
35.145108	Hard	675	false	false	Cut Off Trees for Golf Event	cut-off-trees-for-golf-event	['Array', 'Breadth-First Search', 'Heap (Priority Queue)', 'Matrix']	true	false
58.031398	Medium	676	false	false	Implement Magic Dictionary	implement-magic-dictionary	['Hash Table', 'String', 'Depth-First Search', 'Design', 'Trie']	true	false
56.944426	Medium	677	false	false	Map Sum Pairs	map-sum-pairs	['Hash Table', 'String', 'Design', 'Trie']	true	false
38.688847	Medium	678	false	false	Valid Parenthesis String	valid-parenthesis-string	['String', 'Dynamic Programming', 'Stack', 'Greedy']	true	false
49.837282	Hard	679	false	false	24 Game	24-game	['Array', 'Math', 'Backtracking']	true	false
42.684257	Easy	680	false	false	Valid Palindrome II	valid-palindrome-ii	['Two Pointers', 'String', 'Greedy']	true	false
46.879255	Medium	681	false	true	Next Closest Time	next-closest-time	['Hash Table', 'String', 'Backtracking', 'Enumeration']	true	false
78.440219	Easy	682	false	false	Baseball Game	baseball-game	['Array', 'Stack', 'Simulation']	true	false
37.240115	Hard	683	false	true	K Empty Slots	k-empty-slots	['Array', 'Binary Indexed Tree', 'Segment Tree', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Ordered Set', 'Monotonic Queue']	true	false
66.156378	Medium	684	false	false	Redundant Connection	redundant-connection	['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']	true	false
34.914148	Hard	685	false	false	Redundant Connection II	redundant-connection-ii	['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']	true	false
36.418087	Medium	686	false	false	Repeated String Match	repeated-string-match	['String', 'String Matching']	true	false
42.387475	Medium	687	false	false	Longest Univalue Path	longest-univalue-path	['Tree', 'Depth-First Search', 'Binary Tree']	true	false
56.501776	Medium	688	false	false	Knight Probability in Chessboard	knight-probability-in-chessboard	['Dynamic Programming']	true	false
59.439396	Hard	689	false	false	Maximum Sum of 3 Non-Overlapping Subarrays	maximum-sum-of-3-non-overlapping-subarrays	['Array', 'Dynamic Programming', 'Sliding Window', 'Prefix Sum']	true	false
68.142587	Medium	690	false	false	Employee Importance	employee-importance	['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search']	true	false
49.904123	Hard	691	false	false	Stickers to Spell Word	stickers-to-spell-word	['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Memoization', 'Bitmask']	true	false
59.036	Medium	692	false	false	Top K Frequent Words	top-k-frequent-words	['Array', 'Hash Table', 'String', 'Trie', 'Sorting', 'Heap (Priority Queue)', 'Bucket Sort', 'Counting']	true	false
63.351962	Easy	693	false	false	Binary Number with Alternating Bits	binary-number-with-alternating-bits	['Bit Manipulation']	true	false
62.037625	Medium	694	false	true	Number of Distinct Islands	number-of-distinct-islands	['Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Hash Function']	true	true
72.982509	Medium	695	false	false	Max Area of Island	max-area-of-island	['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']	true	false
65.791246	Easy	696	false	false	Count Binary Substrings	count-binary-substrings	['Two Pointers', 'String']	true	false
57.19244	Easy	697	false	false	Degree of an Array	degree-of-an-array	['Array', 'Hash Table']	true	false
38.080917	Medium	698	false	false	Partition to K Equal Sum Subsets	partition-to-k-equal-sum-subsets	['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Memoization', 'Bitmask']	true	false
46.014103	Hard	699	false	false	Falling Squares	falling-squares	['Array', 'Segment Tree', 'Ordered Set']	true	false
81.430423	Easy	700	false	false	Search in a Binary Search Tree	search-in-a-binary-search-tree	['Tree', 'Binary Search Tree', 'Binary Tree']	true	false

49.582216

Hard

601

false

Human Traffic of Stadium

human-traffic-of-stadium

['Database']

true

false

60.352865

Medium

602

false

Friend Requests II: Who Has the Most Friends

friend-requests-ii-who-has-the-most-friends

['Database']

true

false

65.447689

Easy

603

false

true

Consecutive Available Seats

consecutive-available-seats

['Database']

true

false

40.100732

Easy

604

false

true

Design Compressed String Iterator

design-compressed-string-iterator

['Array', 'String', 'Design', 'Iterator']

true

false

28.838214

Easy

605

false

Can Place Flowers

can-place-flowers

['Array', 'Greedy']

true

false

69.956792

Medium

606

false

Construct String from Binary Tree

construct-string-from-binary-tree

['String', 'Tree', 'Depth-First Search', 'Binary Tree']

true

false

65.819592

Easy

607

false

Sales Person

sales-person

['Database']

true

false

73.635791

Medium

608

false

Tree Node

tree-node

['Database']

true

false

67.554776

Medium

609

false

Find Duplicate File in System

find-duplicate-file-in-system

['Array', 'Hash Table', 'String']

true

false

73.410743

Easy

610

false

Triangle Judgement

triangle-judgement

['Database']

true

false

52.041466

Medium

611

false

Valid Triangle Number

valid-triangle-number

['Array', 'Two Pointers', 'Binary Search', 'Greedy', 'Sorting']

true

false

61.273532

Medium

612

false

true

Shortest Distance in a Plane

shortest-distance-in-a-plane

['Database']

true

false

79.989844

Easy

613

false

true

Shortest Distance in a Line

shortest-distance-in-a-line

['Database']

true

false

39.764745

Medium

614

false

true

Second Degree Follower

second-degree-follower

['Database']

false

56.590832

Hard

615

false

true

Average Salary: Departments VS Company

average-salary-departments-vs-company

['Database']

true

false

50.788529

Medium

616

false

true

Add Bold Tag in String

add-bold-tag-in-string

['Array', 'Hash Table', 'String', 'Trie', 'String Matching']

true

false

79.232363

Easy

617

false

Merge Two Binary Trees

merge-two-binary-trees

['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']

true

false

63.66357

Hard

618

false

true

Students Report By Geography

students-report-by-geography

['Database']

true

false

68.952681

Easy

619

false

Biggest Single Number

biggest-single-number

['Database']

true

false

74.82777

Easy

620

false

Not Boring Movies

not-boring-movies

['Database']

true

false

61.107064

Medium

621

false

Task Scheduler

task-scheduler

['Array', 'Hash Table', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting']

true

false

52.464872

Medium

622

false

Design Circular Queue

design-circular-queue

['Array', 'Linked List', 'Design', 'Queue']

true

false

64.032304

Medium

623

false

Add One Row to Tree

add-one-row-to-tree

['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']

true

false

45.60368

Medium

624

false

Maximum Distance in Arrays

maximum-distance-in-arrays

['Array', 'Greedy']

true

false

33.759276

Medium

625

false

true

Minimum Factorization

minimum-factorization

['Math', 'Greedy']

true

72.277353

Medium

626

false

Exchange Seats

exchange-seats

['Database']

true

false

83.882499

Easy

627

false

Swap Salary

swap-salary

['Database']

true

false

45.253994

Easy

628

false

Maximum Product of Three Numbers

maximum-product-of-three-numbers

['Array', 'Math', 'Sorting']

true

false

49.09847

Hard

629

false

K Inverse Pairs Array

k-inverse-pairs-array

['Dynamic Programming']

true

false

40.498104

Hard

630

false

Course Schedule III

course-schedule-iii

['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']

true

false

43.667328

Hard

631

false

true

Design Excel Sum Formula

design-excel-sum-formula

['Array', 'Hash Table', 'String', 'Graph', 'Design', 'Topological Sort', 'Matrix']

true

false

69.719178

Hard

632

false

Smallest Range Covering Elements from K Lists

smallest-range-covering-elements-from-k-lists

['Array', 'Hash Table', 'Greedy', 'Sliding Window', 'Sorting', 'Heap (Priority Queue)']

true

false

36.411386

Medium

633

false

Sum of Square Numbers

sum-of-square-numbers

['Math', 'Two Pointers', 'Binary Search']

true

false

41.701347

Medium

634

false

true

Find the Derangement of An Array

find-the-derangement-of-an-array

['Math', 'Dynamic Programming', 'Combinatorics']

true

false

59.224791

Medium

635

false

true

Design Log Storage System

design-log-storage-system

['Hash Table', 'String', 'Design', 'Ordered Set']

true

false

64.324111

Medium

636

false

Exclusive Time of Functions

exclusive-time-of-functions

['Array', 'Stack']

true

false

73.885817

Easy

637

false

Average of Levels in Binary Tree

average-of-levels-in-binary-tree

['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']

true

false

51.823796

Medium

638

false

Shopping Offers

shopping-offers

['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Memoization', 'Bitmask']

true

false

31.094365

Hard

639

false

Decode Ways II

decode-ways-ii

['String', 'Dynamic Programming']

true

false

44.4375

Medium

640

false

Solve the Equation

solve-the-equation

['Math', 'String', 'Simulation']

true

false

64.549898

Medium

641

false

Design Circular Deque

design-circular-deque

['Array', 'Linked List', 'Design', 'Queue']

true

false

49.305471

Hard

642

false

true

Design Search Autocomplete System

design-search-autocomplete-system

['String', 'Depth-First Search', 'Design', 'Trie', 'Sorting', 'Heap (Priority Queue)', 'Data Stream']

true

false

44.919526

Easy

643

false

Maximum Average Subarray I

maximum-average-subarray-i

['Array', 'Sliding Window']

true

false

37.3592

Hard

644

false

true

Maximum Average Subarray II

maximum-average-subarray-ii

['Array', 'Binary Search', 'Prefix Sum']

true

44.848396

Easy

645

false

Set Mismatch

set-mismatch

['Array', 'Hash Table', 'Bit Manipulation', 'Sorting']

true

false

60.671894

Medium

646

false

Maximum Length of Pair Chain

maximum-length-of-pair-chain

['Array', 'Dynamic Programming', 'Greedy', 'Sorting']

true

false

71.407084

Medium

647

false

Palindromic Substrings

palindromic-substrings

['Two Pointers', 'String', 'Dynamic Programming']

true

false

68.282988

Medium

648

false

Replace Words

replace-words

['Array', 'Hash Table', 'String', 'Trie']

true

false

48.633654

Medium

649

false

Dota2 Senate

dota2-senate

['String', 'Greedy', 'Queue']

true

false

59.515145

Medium

650

false

2 Keys Keyboard

2-keys-keyboard

['Math', 'Dynamic Programming']

true

false

55.860528

Medium

651

false

true

4 Keys Keyboard

4-keys-keyboard

['Math', 'Dynamic Programming']

true

false

59.966429

Medium

652

false

Find Duplicate Subtrees

find-duplicate-subtrees

['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree']

true

false

62.004375

Easy

653

false

Two Sum IV - Input is a BST

two-sum-iv-input-is-a-bst

['Hash Table', 'Two Pointers', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Search Tree', 'Binary Tree']

true

false

85.830131

Medium

654

false

Maximum Binary Tree

maximum-binary-tree

['Array', 'Divide and Conquer', 'Stack', 'Tree', 'Monotonic Stack', 'Binary Tree']

true

false

65.332897

Medium

655

false

Print Binary Tree

print-binary-tree

['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']

true

false

32.366653

Hard

656

false

true

Coin Path

coin-path

['Array', 'Dynamic Programming']

true

false

76.078514

Easy

657

false

Robot Return to Origin

robot-return-to-origin

['String', 'Simulation']

true

false

48.454244

Medium

658

false

Find K Closest Elements

find-k-closest-elements

['Array', 'Two Pointers', 'Binary Search', 'Sliding Window', 'Sorting', 'Heap (Priority Queue)']

true

false

51.420342

Medium

659

false

Split Array into Consecutive Subsequences

split-array-into-consecutive-subsequences

['Array', 'Hash Table', 'Greedy', 'Heap (Priority Queue)']

true

false

57.357139

Hard

660

false

true

Remove 9

remove-9

['Math']

true

false

68.168482

Easy

661

false

Image Smoother

image-smoother

['Array', 'Matrix']

true

false

43.864772

Medium

662

false

Maximum Width of Binary Tree

maximum-width-of-binary-tree

['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']

true

false

41.532113

Medium

663

false

true

Equal Tree Partition

equal-tree-partition

['Tree', 'Depth-First Search', 'Binary Tree']

true

false

60.783685

Hard

664

false

Strange Printer

strange-printer

['String', 'Dynamic Programming']

true

false

25.007712

Medium

665

false

Non-decreasing Array

non-decreasing-array

['Array']

true

false

62.620038

Medium

666

false

true

Path Sum IV

path-sum-iv

['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree']

true

false

60.331402

Medium

667

false

Beautiful Arrangement II

beautiful-arrangement-ii

['Array', 'Math']

true

false

52.606734

Hard

668

false

Kth Smallest Number in Multiplication Table

kth-smallest-number-in-multiplication-table

['Math', 'Binary Search']

true

false

66.339871

Medium

669

false

Trim a Binary Search Tree

trim-a-binary-search-tree

['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']

true

51.739607

Medium

670

false

Maximum Swap

maximum-swap

['Math', 'Greedy']

true

false

45.184701

Easy

671

false

Second Minimum Node In a Binary Tree

second-minimum-node-in-a-binary-tree

['Tree', 'Depth-First Search', 'Binary Tree']

true

false

49.450986

Medium

672

false

Bulb Switcher II

bulb-switcher-ii

['Math', 'Bit Manipulation', 'Depth-First Search', 'Breadth-First Search']

true

false

49.488573

Medium

673

false

Number of Longest Increasing Subsequence

number-of-longest-increasing-subsequence

['Array', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree']

true

false

50.96813

Easy

674

false

Longest Continuous Increasing Subsequence

longest-continuous-increasing-subsequence

['Array']

true

false

35.145108

Hard

675

false

Cut Off Trees for Golf Event

cut-off-trees-for-golf-event

['Array', 'Breadth-First Search', 'Heap (Priority Queue)', 'Matrix']

true

false

58.031398

Medium

676

false

Implement Magic Dictionary

implement-magic-dictionary

['Hash Table', 'String', 'Depth-First Search', 'Design', 'Trie']

true

false

56.944426

Medium

677

false

Map Sum Pairs

map-sum-pairs

['Hash Table', 'String', 'Design', 'Trie']

true

false

38.688847

Medium

678

false

Valid Parenthesis String

valid-parenthesis-string

['String', 'Dynamic Programming', 'Stack', 'Greedy']

true

false

49.837282

Hard

679

false

24 Game

24-game

['Array', 'Math', 'Backtracking']

true

false

42.684257

Easy

680

false

Valid Palindrome II

valid-palindrome-ii

['Two Pointers', 'String', 'Greedy']

true

false

46.879255

Medium

681

false

true

Next Closest Time

next-closest-time

['Hash Table', 'String', 'Backtracking', 'Enumeration']

true

false

78.440219

Easy

682

false

Baseball Game

baseball-game

['Array', 'Stack', 'Simulation']

true

false

37.240115

Hard

683

false

true

K Empty Slots

k-empty-slots

['Array', 'Binary Indexed Tree', 'Segment Tree', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Ordered Set', 'Monotonic Queue']

true

false

66.156378

Medium

684

false

Redundant Connection

redundant-connection

['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']

true

false

34.914148

Hard

685

false

Redundant Connection II

redundant-connection-ii

['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']

true

false

36.418087

Medium

686

false

Repeated String Match

repeated-string-match

['String', 'String Matching']

true

false

42.387475

Medium

687

false

Longest Univalue Path

longest-univalue-path

['Tree', 'Depth-First Search', 'Binary Tree']

true

false

56.501776

Medium

688

false

Knight Probability in Chessboard

knight-probability-in-chessboard

['Dynamic Programming']

true

false

59.439396

Hard

689

false

Maximum Sum of 3 Non-Overlapping Subarrays

maximum-sum-of-3-non-overlapping-subarrays

['Array', 'Dynamic Programming', 'Sliding Window', 'Prefix Sum']

true

false

68.142587

Medium

690

false

Employee Importance

employee-importance

['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search']

true

false

49.904123

Hard

691

false

Stickers to Spell Word

stickers-to-spell-word

['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Memoization', 'Bitmask']

true

false

59.036

Medium

692

false

Top K Frequent Words

top-k-frequent-words

['Array', 'Hash Table', 'String', 'Trie', 'Sorting', 'Heap (Priority Queue)', 'Bucket Sort', 'Counting']

true

false

63.351962

Easy

693

false

Binary Number with Alternating Bits

binary-number-with-alternating-bits

['Bit Manipulation']

true

false

62.037625

Medium

694

false

true

Number of Distinct Islands

number-of-distinct-islands

['Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Hash Function']

true

72.982509

Medium

695

false

Max Area of Island

max-area-of-island

['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']

true

false

65.791246

Easy

696

false

Count Binary Substrings

count-binary-substrings

['Two Pointers', 'String']

true

false

57.19244

Easy

697

false

Degree of an Array

degree-of-an-array

['Array', 'Hash Table']

true

false

38.080917

Medium

698

false

Partition to K Equal Sum Subsets

partition-to-k-equal-sum-subsets

['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Memoization', 'Bitmask']

true

false

46.014103

Hard

699

false

Falling Squares

falling-squares

['Array', 'Segment Tree', 'Ordered Set']

true

false

81.430423

Easy

700

false

Search in a Binary Search Tree

search-in-a-binary-search-tree

['Tree', 'Binary Search Tree', 'Binary Tree']

true

false