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
57.279322	Easy	501	false	false	Find Mode in Binary Search Tree	find-mode-in-binary-search-tree	['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']	true	false
53.001728	Hard	502	false	false	IPO	ipo	['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']	true	false
65.771357	Medium	503	false	false	Next Greater Element II	next-greater-element-ii	['Array', 'Stack', 'Monotonic Stack']	true	false
51.640721	Easy	504	false	false	Base 7	base-7	['Math']	false	false
54.037097	Medium	505	false	true	The Maze II	the-maze-ii	['Array', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']	true	false
73.030564	Easy	506	false	false	Relative Ranks	relative-ranks	['Array', 'Sorting', 'Heap (Priority Queue)']	true	false
44.262362	Easy	507	false	false	Perfect Number	perfect-number	['Math']	true	false
67.602419	Medium	508	false	false	Most Frequent Subtree Sum	most-frequent-subtree-sum	['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree']	true	false
72.677574	Easy	509	false	false	Fibonacci Number	fibonacci-number	['Math', 'Dynamic Programming', 'Recursion', 'Memoization']	true	false
60.940889	Medium	510	false	true	Inorder Successor in BST II	inorder-successor-in-bst-ii	['Tree', 'Binary Search Tree', 'Binary Tree']	true	false
75.548487	Easy	511	false	false	Game Play Analysis I	game-play-analysis-i	['Database']	true	false
53.791293	Easy	512	false	true	Game Play Analysis II	game-play-analysis-ii	['Database']	true	false
71.643794	Medium	513	false	false	Find Bottom Left Tree Value	find-bottom-left-tree-value	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	false
58.831813	Hard	514	false	false	Freedom Trail	freedom-trail	['String', 'Dynamic Programming', 'Depth-First Search', 'Breadth-First Search']	true	false
66.277361	Medium	515	false	false	Find Largest Value in Each Tree Row	find-largest-value-in-each-tree-row	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	false
63.781876	Medium	516	false	false	Longest Palindromic Subsequence	longest-palindromic-subsequence	['String', 'Dynamic Programming']	true	false
42.206431	Hard	517	false	false	Super Washing Machines	super-washing-machines	['Array', 'Greedy']	true	false
62.908457	Medium	518	false	false	Coin Change II	coin-change-ii	['Array', 'Dynamic Programming']	true	false
43.261618	Medium	519	false	false	Random Flip Matrix	random-flip-matrix	['Hash Table', 'Math', 'Reservoir Sampling', 'Randomized']	true	false
56.131575	Easy	520	false	false	Detect Capital	detect-capital	['String']	true	false
61.203185	Easy	521	false	false	Longest Uncommon Subsequence I	longest-uncommon-subsequence-i	['String']	true	false
42.758942	Medium	522	false	false	Longest Uncommon Subsequence II	longest-uncommon-subsequence-ii	['Array', 'Hash Table', 'Two Pointers', 'String', 'Sorting']	false	false
30.778891	Medium	523	false	false	Continuous Subarray Sum	continuous-subarray-sum	['Array', 'Hash Table', 'Math', 'Prefix Sum']	true	false
51.644961	Medium	524	false	false	Longest Word in Dictionary through Deleting	longest-word-in-dictionary-through-deleting	['Array', 'Two Pointers', 'String', 'Sorting']	true	false
49.022172	Medium	525	false	false	Contiguous Array	contiguous-array	['Array', 'Hash Table', 'Prefix Sum']	true	false
64.466667	Medium	526	false	false	Beautiful Arrangement	beautiful-arrangement	['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']	true	false
61.728806	Hard	527	false	true	Word Abbreviation	word-abbreviation	['Array', 'String', 'Greedy', 'Trie', 'Sorting']	true	false
48.321453	Medium	528	false	false	Random Pick with Weight	random-pick-with-weight	['Array', 'Math', 'Binary Search', 'Prefix Sum', 'Randomized']	true	false
67.868367	Medium	529	false	false	Minesweeper	minesweeper	['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix']	false	false
58.718974	Easy	530	false	false	Minimum Absolute Difference in BST	minimum-absolute-difference-in-bst	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Search Tree', 'Binary Tree']	true	false
62.486345	Medium	531	false	true	Lonely Pixel I	lonely-pixel-i	['Array', 'Hash Table', 'Matrix']	true	true
44.392662	Medium	532	false	false	K-diff Pairs in an Array	k-diff-pairs-in-an-array	['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Sorting']	true	false
48.627465	Medium	533	false	true	Lonely Pixel II	lonely-pixel-ii	['Array', 'Hash Table', 'Matrix']	false	false
81.173958	Medium	534	false	true	Game Play Analysis III	game-play-analysis-iii	['Database']	true	false
86.62732	Medium	535	false	false	Encode and Decode TinyURL	encode-and-decode-tinyurl	['Hash Table', 'String', 'Design', 'Hash Function']	true	false
58.148876	Medium	536	false	true	Construct Binary Tree from String	construct-binary-tree-from-string	['String', 'Stack', 'Tree', 'Depth-First Search', 'Binary Tree']	true	false
72.27089	Medium	537	false	false	Complex Number Multiplication	complex-number-multiplication	['Math', 'String', 'Simulation']	true	false
70.284487	Medium	538	false	false	Convert BST to Greater Tree	convert-bst-to-greater-tree	['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']	true	false
62.290178	Medium	539	false	false	Minimum Time Difference	minimum-time-difference	['Array', 'Math', 'String', 'Sorting']	true	false
59.169544	Medium	540	false	false	Single Element in a Sorted Array	single-element-in-a-sorted-array	['Array', 'Binary Search']	true	false
51.881036	Easy	541	false	false	Reverse String II	reverse-string-ii	['Two Pointers', 'String']	true	false
50.935054	Medium	542	false	false	01 Matrix	01-matrix	['Array', 'Dynamic Programming', 'Breadth-First Search', 'Matrix']	true	false
63.034082	Easy	543	false	false	Diameter of Binary Tree	diameter-of-binary-tree	['Tree', 'Depth-First Search', 'Binary Tree']	true	false
77.363419	Medium	544	false	true	Output Contest Matches	output-contest-matches	['String', 'Recursion', 'Simulation']	true	false
46.921437	Medium	545	false	true	Boundary of Binary Tree	boundary-of-binary-tree	['Tree', 'Depth-First Search', 'Binary Tree']	true	false
48.192404	Hard	546	false	false	Remove Boxes	remove-boxes	['Array', 'Dynamic Programming', 'Memoization']	true	false
68.184974	Medium	547	false	false	Number of Provinces	number-of-provinces	['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']	true	false
50.140188	Hard	548	false	true	Split Array with Equal Sum	split-array-with-equal-sum	['Array', 'Hash Table', 'Prefix Sum']	true	false
49.560747	Medium	549	false	true	Binary Tree Longest Consecutive Sequence II	binary-tree-longest-consecutive-sequence-ii	['Tree', 'Depth-First Search', 'Binary Tree']	true	false
39.10924	Medium	550	false	false	Game Play Analysis IV	game-play-analysis-iv	['Database']	true	false
49.502137	Easy	551	false	false	Student Attendance Record I	student-attendance-record-i	['String']	true	false
55.669803	Hard	552	false	false	Student Attendance Record II	student-attendance-record-ii	['Dynamic Programming']	true	false
61.53741	Medium	553	false	false	Optimal Division	optimal-division	['Array', 'Math', 'Dynamic Programming']	true	false
55.792719	Medium	554	false	false	Brick Wall	brick-wall	['Array', 'Hash Table']	true	true
43.285394	Medium	555	false	true	Split Concatenated Strings	split-concatenated-strings	['Array', 'String', 'Greedy']	false	false
34.456543	Medium	556	false	false	Next Greater Element III	next-greater-element-iii	['Math', 'Two Pointers', 'String']	true	false
83.564933	Easy	557	false	false	Reverse Words in a String III	reverse-words-in-a-string-iii	['Two Pointers', 'String']	true	false
50.114776	Medium	558	false	false	Logical OR of Two Binary Grids Represented as Quad-Trees	logical-or-of-two-binary-grids-represented-as-quad-trees	['Divide and Conquer', 'Tree']	false	false
72.780794	Easy	559	false	false	Maximum Depth of N-ary Tree	maximum-depth-of-n-ary-tree	['Tree', 'Depth-First Search', 'Breadth-First Search']	true	false
45.108592	Medium	560	false	false	Subarray Sum Equals K	subarray-sum-equals-k	['Array', 'Hash Table', 'Prefix Sum']	true	true
80.171552	Easy	561	false	false	Array Partition	array-partition	['Array', 'Greedy', 'Sorting', 'Counting Sort']	true	false
50.498692	Medium	562	false	true	Longest Line of Consecutive One in Matrix	longest-line-of-consecutive-one-in-matrix	['Array', 'Dynamic Programming', 'Matrix']	true	false
63.663465	Easy	563	false	false	Binary Tree Tilt	binary-tree-tilt	['Tree', 'Depth-First Search', 'Binary Tree']	true	false
31.579927	Hard	564	false	false	Find the Closest Palindrome	find-the-closest-palindrome	['Math', 'String']	true	false
55.908622	Medium	565	false	false	Array Nesting	array-nesting	['Array', 'Depth-First Search']	true	false
63.747745	Easy	566	false	false	Reshape the Matrix	reshape-the-matrix	['Array', 'Matrix', 'Simulation']	true	false
46.958323	Medium	567	false	false	Permutation in String	permutation-in-string	['Hash Table', 'Two Pointers', 'String', 'Sliding Window']	true	false
46.252677	Hard	568	false	true	Maximum Vacation Days	maximum-vacation-days	['Array', 'Dynamic Programming', 'Matrix']	true	false
66.259681	Hard	569	false	true	Median Employee Salary	median-employee-salary	['Database']	true	false
49.034556	Medium	570	false	false	Managers with at Least 5 Direct Reports	managers-with-at-least-5-direct-reports	['Database']	true	false
42.549107	Hard	571	false	true	Find Median Given Frequency of Numbers	find-median-given-frequency-of-numbers	['Database']	false	false
49.626115	Easy	572	false	false	Subtree of Another Tree	subtree-of-another-tree	['Tree', 'Depth-First Search', 'String Matching', 'Binary Tree', 'Hash Function']	true	false
57.239764	Medium	573	false	true	Squirrel Simulation	squirrel-simulation	['Array', 'Math']	true	true
61.795073	Medium	574	false	true	Winning Candidate	winning-candidate	['Database']	true	false
69.236475	Easy	575	false	false	Distribute Candies	distribute-candies	['Array', 'Hash Table']	true	false
48.113508	Medium	576	false	false	Out of Boundary Paths	out-of-boundary-paths	['Dynamic Programming']	true	false
77.06964	Easy	577	false	false	Employee Bonus	employee-bonus	['Database']	true	false
40.236748	Medium	578	false	true	Get Highest Answer Rate Question	get-highest-answer-rate-question	['Database']	true	false
48.511228	Hard	579	false	true	Find Cumulative Salary of an Employee	find-cumulative-salary-of-an-employee	['Database']	true	false
59.660426	Medium	580	false	true	Count Student Number in Departments	count-student-number-in-departments	['Database']	true	false
37.30298	Medium	581	false	false	Shortest Unsorted Continuous Subarray	shortest-unsorted-continuous-subarray	['Array', 'Two Pointers', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack']	true	false
70.004424	Medium	582	false	true	Kill Process	kill-process	['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search']	true	true
63.268684	Medium	583	false	false	Delete Operation for Two Strings	delete-operation-for-two-strings	['String', 'Dynamic Programming']	true	false
71.667337	Easy	584	false	false	Find Customer Referee	find-customer-referee	['Database']	true	false
49.834968	Medium	585	false	false	Investments in 2016	investments-in-2016	['Database']	true	false
64.490566	Easy	586	false	false	Customer Placing the Largest Number of Orders	customer-placing-the-largest-number-of-orders	['Database']	true	false
52.089657	Hard	587	false	false	Erect the Fence	erect-the-fence	['Array', 'Math', 'Geometry']	true	false
48.102497	Hard	588	false	true	Design In-Memory File System	design-in-memory-file-system	['Hash Table', 'String', 'Design', 'Trie', 'Sorting']	true	false
76.088849	Easy	589	false	false	N-ary Tree Preorder Traversal	n-ary-tree-preorder-traversal	['Stack', 'Tree', 'Depth-First Search']	true	false
80.587801	Easy	590	false	false	N-ary Tree Postorder Traversal	n-ary-tree-postorder-traversal	['Stack', 'Tree', 'Depth-First Search']	true	false
38.789233	Hard	591	false	false	Tag Validator	tag-validator	['String', 'Stack']	true	false
66.112536	Medium	592	false	false	Fraction Addition and Subtraction	fraction-addition-and-subtraction	['Math', 'String', 'Simulation']	true	false
44.196681	Medium	593	false	false	Valid Square	valid-square	['Math', 'Geometry']	true	false
56.706591	Easy	594	false	false	Longest Harmonious Subsequence	longest-harmonious-subsequence	['Array', 'Hash Table', 'Sliding Window', 'Sorting', 'Counting']	true	false
68.194108	Easy	595	false	false	Big Countries	big-countries	['Database']	true	false
60.009445	Easy	596	false	false	Classes More Than 5 Students	classes-more-than-5-students	['Database']	true	false
41.47217	Easy	597	false	true	Friend Requests I: Overall Acceptance Rate	friend-requests-i-overall-acceptance-rate	['Database']	true	false
57.081224	Easy	598	false	false	Range Addition II	range-addition-ii	['Array', 'Math']	true	false
57.573611	Easy	599	false	false	Minimum Index Sum of Two Lists	minimum-index-sum-of-two-lists	['Array', 'Hash Table', 'String']	true	false
40.068164	Hard	600	false	false	Non-negative Integers without Consecutive Ones	non-negative-integers-without-consecutive-ones	['Dynamic Programming']	true	false

57.279322

Easy

501

false

Find Mode in Binary Search Tree

find-mode-in-binary-search-tree

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

true

false

53.001728

Hard

502

false

IPO

ipo

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

true

false

65.771357

Medium

503

false

Next Greater Element II

next-greater-element-ii

['Array', 'Stack', 'Monotonic Stack']

true

false

51.640721

Easy

504

false

Base 7

base-7

['Math']

false

54.037097

Medium

505

false

true

The Maze II

the-maze-ii

['Array', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']

true

false

73.030564

Easy

506

false

Relative Ranks

relative-ranks

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

true

false

44.262362

Easy

507

false

Perfect Number

perfect-number

['Math']

true

false

67.602419

Medium

508

false

Most Frequent Subtree Sum

most-frequent-subtree-sum

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

true

false

72.677574

Easy

509

false

Fibonacci Number

fibonacci-number

['Math', 'Dynamic Programming', 'Recursion', 'Memoization']

true

false

60.940889

Medium

510

false

true

Inorder Successor in BST II

inorder-successor-in-bst-ii

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

true

false

75.548487

Easy

511

false

Game Play Analysis I

game-play-analysis-i

['Database']

true

false

53.791293

Easy

512

false

true

Game Play Analysis II

game-play-analysis-ii

['Database']

true

false

71.643794

Medium

513

false

Find Bottom Left Tree Value

find-bottom-left-tree-value

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

true

false

58.831813

Hard

514

false

Freedom Trail

freedom-trail

['String', 'Dynamic Programming', 'Depth-First Search', 'Breadth-First Search']

true

false

66.277361

Medium

515

false

Find Largest Value in Each Tree Row

find-largest-value-in-each-tree-row

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

true

false

63.781876

Medium

516

false

Longest Palindromic Subsequence

longest-palindromic-subsequence

['String', 'Dynamic Programming']

true

false

42.206431

Hard

517

false

Super Washing Machines

super-washing-machines

['Array', 'Greedy']

true

false

62.908457

Medium

518

false

Coin Change II

coin-change-ii

['Array', 'Dynamic Programming']

true

false

43.261618

Medium

519

false

Random Flip Matrix

random-flip-matrix

['Hash Table', 'Math', 'Reservoir Sampling', 'Randomized']

true

false

56.131575

Easy

520

false

Detect Capital

detect-capital

['String']

true

false

61.203185

Easy

521

false

Longest Uncommon Subsequence I

longest-uncommon-subsequence-i

['String']

true

false

42.758942

Medium

522

false

Longest Uncommon Subsequence II

longest-uncommon-subsequence-ii

['Array', 'Hash Table', 'Two Pointers', 'String', 'Sorting']

false

30.778891

Medium

523

false

Continuous Subarray Sum

continuous-subarray-sum

['Array', 'Hash Table', 'Math', 'Prefix Sum']

true

false

51.644961

Medium

524

false

Longest Word in Dictionary through Deleting

longest-word-in-dictionary-through-deleting

['Array', 'Two Pointers', 'String', 'Sorting']

true

false

49.022172

Medium

525

false

Contiguous Array

contiguous-array

['Array', 'Hash Table', 'Prefix Sum']

true

false

64.466667

Medium

526

false

Beautiful Arrangement

beautiful-arrangement

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

true

false

61.728806

Hard

527

false

true

Word Abbreviation

word-abbreviation

['Array', 'String', 'Greedy', 'Trie', 'Sorting']

true

false

48.321453

Medium

528

false

Random Pick with Weight

random-pick-with-weight

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

true

false

67.868367

Medium

529

false

Minesweeper

minesweeper

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

false

58.718974

Easy

530

false

Minimum Absolute Difference in BST

minimum-absolute-difference-in-bst

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

true

false

62.486345

Medium

531

false

true

Lonely Pixel I

lonely-pixel-i

['Array', 'Hash Table', 'Matrix']

true

44.392662

Medium

532

false

K-diff Pairs in an Array

k-diff-pairs-in-an-array

['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Sorting']

true

false

48.627465

Medium

533

false

true

Lonely Pixel II

lonely-pixel-ii

['Array', 'Hash Table', 'Matrix']

false

81.173958

Medium

534

false

true

Game Play Analysis III

game-play-analysis-iii

['Database']

true

false

86.62732

Medium

535

false

Encode and Decode TinyURL

encode-and-decode-tinyurl

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

true

false

58.148876

Medium

536

false

true

Construct Binary Tree from String

construct-binary-tree-from-string

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

true

false

72.27089

Medium

537

false

Complex Number Multiplication

complex-number-multiplication

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

true

false

70.284487

Medium

538

false

Convert BST to Greater Tree

convert-bst-to-greater-tree

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

true

false

62.290178

Medium

539

false

Minimum Time Difference

minimum-time-difference

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

true

false

59.169544

Medium

540

false

Single Element in a Sorted Array

single-element-in-a-sorted-array

['Array', 'Binary Search']

true

false

51.881036

Easy

541

false

Reverse String II

reverse-string-ii

['Two Pointers', 'String']

true

false

50.935054

Medium

542

false

01 Matrix

01-matrix

['Array', 'Dynamic Programming', 'Breadth-First Search', 'Matrix']

true

false

63.034082

Easy

543

false

Diameter of Binary Tree

diameter-of-binary-tree

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

true

false

77.363419

Medium

544

false

true

Output Contest Matches

output-contest-matches

['String', 'Recursion', 'Simulation']

true

false

46.921437

Medium

545

false

true

Boundary of Binary Tree

boundary-of-binary-tree

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

true

false

48.192404

Hard

546

false

Remove Boxes

remove-boxes

['Array', 'Dynamic Programming', 'Memoization']

true

false

68.184974

Medium

547

false

Number of Provinces

number-of-provinces

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

true

false

50.140188

Hard

548

false

true

Split Array with Equal Sum

split-array-with-equal-sum

['Array', 'Hash Table', 'Prefix Sum']

true

false

49.560747

Medium

549

false

true

Binary Tree Longest Consecutive Sequence II

binary-tree-longest-consecutive-sequence-ii

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

true

false

39.10924

Medium

550

false

Game Play Analysis IV

game-play-analysis-iv

['Database']

true

false

49.502137

Easy

551

false

Student Attendance Record I

student-attendance-record-i

['String']

true

false

55.669803

Hard

552

false

Student Attendance Record II

student-attendance-record-ii

['Dynamic Programming']

true

false

61.53741

Medium

553

false

Optimal Division

optimal-division

['Array', 'Math', 'Dynamic Programming']

true

false

55.792719

Medium

554

false

Brick Wall

brick-wall

['Array', 'Hash Table']

true

43.285394

Medium

555

false

true

Split Concatenated Strings

split-concatenated-strings

['Array', 'String', 'Greedy']

false

34.456543

Medium

556

false

Next Greater Element III

next-greater-element-iii

['Math', 'Two Pointers', 'String']

true

false

83.564933

Easy

557

false

Reverse Words in a String III

reverse-words-in-a-string-iii

['Two Pointers', 'String']

true

false

50.114776

Medium

558

false

Logical OR of Two Binary Grids Represented as Quad-Trees

logical-or-of-two-binary-grids-represented-as-quad-trees

['Divide and Conquer', 'Tree']

false

72.780794

Easy

559

false

Maximum Depth of N-ary Tree

maximum-depth-of-n-ary-tree

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

true

false

45.108592

Medium

560

false

Subarray Sum Equals K

subarray-sum-equals-k

['Array', 'Hash Table', 'Prefix Sum']

true

80.171552

Easy

561

false

Array Partition

array-partition

['Array', 'Greedy', 'Sorting', 'Counting Sort']

true

false

50.498692

Medium

562

false

true

Longest Line of Consecutive One in Matrix

longest-line-of-consecutive-one-in-matrix

['Array', 'Dynamic Programming', 'Matrix']

true

false

63.663465

Easy

563

false

Binary Tree Tilt

binary-tree-tilt

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

true

false

31.579927

Hard

564

false

Find the Closest Palindrome

find-the-closest-palindrome

['Math', 'String']

true

false

55.908622

Medium

565

false

Array Nesting

array-nesting

['Array', 'Depth-First Search']

true

false

63.747745

Easy

566

false

Reshape the Matrix

reshape-the-matrix

['Array', 'Matrix', 'Simulation']

true

false

46.958323

Medium

567

false

Permutation in String

permutation-in-string

['Hash Table', 'Two Pointers', 'String', 'Sliding Window']

true

false

46.252677

Hard

568

false

true

Maximum Vacation Days

maximum-vacation-days

['Array', 'Dynamic Programming', 'Matrix']

true

false

66.259681

Hard

569

false

true

Median Employee Salary

median-employee-salary

['Database']

true

false

49.034556

Medium

570

false

Managers with at Least 5 Direct Reports

managers-with-at-least-5-direct-reports

['Database']

true

false

42.549107

Hard

571

false

true

Find Median Given Frequency of Numbers

find-median-given-frequency-of-numbers

['Database']

false

49.626115

Easy

572

false

Subtree of Another Tree

subtree-of-another-tree

['Tree', 'Depth-First Search', 'String Matching', 'Binary Tree', 'Hash Function']

true

false

57.239764

Medium

573

false

true

Squirrel Simulation

squirrel-simulation

['Array', 'Math']

true

61.795073

Medium

574

false

true

Winning Candidate

winning-candidate

['Database']

true

false

69.236475

Easy

575

false

Distribute Candies

distribute-candies

['Array', 'Hash Table']

true

false

48.113508

Medium

576

false

Out of Boundary Paths

out-of-boundary-paths

['Dynamic Programming']

true

false

77.06964

Easy

577

false

Employee Bonus

employee-bonus

['Database']

true

false

40.236748

Medium

578

false

true

Get Highest Answer Rate Question

get-highest-answer-rate-question

['Database']

true

false

48.511228

Hard

579

false

true

Find Cumulative Salary of an Employee

find-cumulative-salary-of-an-employee

['Database']

true

false

59.660426

Medium

580

false

true

Count Student Number in Departments

count-student-number-in-departments

['Database']

true

false

37.30298

Medium

581

false

Shortest Unsorted Continuous Subarray

shortest-unsorted-continuous-subarray

['Array', 'Two Pointers', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack']

true

false

70.004424

Medium

582

false

true

Kill Process

kill-process

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

true

63.268684

Medium

583

false

Delete Operation for Two Strings

delete-operation-for-two-strings

['String', 'Dynamic Programming']

true

false

71.667337

Easy

584

false

Find Customer Referee

find-customer-referee

['Database']

true

false

49.834968

Medium

585

false

Investments in 2016

investments-in-2016

['Database']

true

false

64.490566

Easy

586

false

Customer Placing the Largest Number of Orders

customer-placing-the-largest-number-of-orders

['Database']

true

false

52.089657

Hard

587

false

Erect the Fence

erect-the-fence

['Array', 'Math', 'Geometry']

true

false

48.102497

Hard

588

false

true

Design In-Memory File System

design-in-memory-file-system

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

true

false

76.088849

Easy

589

false

N-ary Tree Preorder Traversal

n-ary-tree-preorder-traversal

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

true

false

80.587801

Easy

590

false

N-ary Tree Postorder Traversal

n-ary-tree-postorder-traversal

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

true

false

38.789233

Hard

591

false

Tag Validator

tag-validator

['String', 'Stack']

true

false

66.112536

Medium

592

false

Fraction Addition and Subtraction

fraction-addition-and-subtraction

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

true

false

44.196681

Medium

593

false

Valid Square

valid-square

['Math', 'Geometry']

true

false

56.706591

Easy

594

false

Longest Harmonious Subsequence

longest-harmonious-subsequence

['Array', 'Hash Table', 'Sliding Window', 'Sorting', 'Counting']

true

false

68.194108

Easy

595

false

Big Countries

big-countries

['Database']

true

false

60.009445

Easy

596

false

Classes More Than 5 Students

classes-more-than-5-students

['Database']

true

false

41.47217

Easy

597

false

true

Friend Requests I: Overall Acceptance Rate

friend-requests-i-overall-acceptance-rate

['Database']

true

false

57.081224

Easy

598

false

Range Addition II

range-addition-ii

['Array', 'Math']

true

false

57.573611

Easy

599

false

Minimum Index Sum of Two Lists

minimum-index-sum-of-two-lists

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

true

false

40.068164

Hard

600

false

Non-negative Integers without Consecutive Ones

non-negative-integers-without-consecutive-ones

['Dynamic Programming']

true

false