query-id
stringlengths 31
92
| corpus-id
stringlengths 29
90
| score
int64 1
1
|
|---|---|---|
leetcode_494_Target Sum_java_query
|
leetcode_494_Target Sum_java_doc
| 1
|
leetcode_445_Add Two Numbers II_javascript_query
|
leetcode_445_Add Two Numbers II_javascript_doc
| 1
|
leetcode_58_Length of Last Word_python_query
|
leetcode_58_Length of Last Word_python_doc
| 1
|
leetcode_88_Merge Sorted Array_python_query
|
leetcode_88_Merge Sorted Array_python_doc
| 1
|
leetcode_2384_Largest Palindromic Number_java_query
|
leetcode_2384_Largest Palindromic Number_java_doc
| 1
|
leetcode_7_Reverse Integer_javascript_query
|
leetcode_7_Reverse Integer_javascript_doc
| 1
|
leetcode_752_Open the Lock_javascript_query
|
leetcode_752_Open the Lock_javascript_doc
| 1
|
leetcode_1616_Split Two Strings to Make Palindrome_c++_query
|
leetcode_1616_Split Two Strings to Make Palindrome_c++_doc
| 1
|
leetcode_1765_Map of Highest Peak_javascript_query
|
leetcode_1765_Map of Highest Peak_javascript_doc
| 1
|
leetcode_555_Split Concatenated Strings_java_query
|
leetcode_555_Split Concatenated Strings_java_doc
| 1
|
leetcode_148_Sort List_javascript_query
|
leetcode_148_Sort List_javascript_doc
| 1
|
leetcode_856_Score of Parentheses_javascript_query
|
leetcode_856_Score of Parentheses_javascript_doc
| 1
|
leetcode_1838_Frequency of the Most Frequent Element_c++_query
|
leetcode_1838_Frequency of the Most Frequent Element_c++_doc
| 1
|
leetcode_34_Find First and Last Position of Element in Sorted Array_python_query
|
leetcode_34_Find First and Last Position of Element in Sorted Array_python_doc
| 1
|
leetcode_943_Find the Shortest Superstring_python_query
|
leetcode_943_Find the Shortest Superstring_python_doc
| 1
|
leetcode_47_Permutations II_c++_query
|
leetcode_47_Permutations II_c++_doc
| 1
|
leetcode_2543_Check if Point Is Reachable_javascript_query
|
leetcode_2543_Check if Point Is Reachable_javascript_doc
| 1
|
leetcode_191_Number of 1 Bits_javascript_query
|
leetcode_191_Number of 1 Bits_javascript_doc
| 1
|
leetcode_169_Majority Element_java_query
|
leetcode_169_Majority Element_java_doc
| 1
|
leetcode_1413_Minimum Value to Get Positive Step by Step Sum_java_query
|
leetcode_1413_Minimum Value to Get Positive Step by Step Sum_java_doc
| 1
|
leetcode_54_Spiral Matrix_c++_query
|
leetcode_54_Spiral Matrix_c++_doc
| 1
|
leetcode_866_Prime Palindrome_java_query
|
leetcode_866_Prime Palindrome_java_doc
| 1
|
leetcode_2021_Brightest Position on Street_c++_query
|
leetcode_2021_Brightest Position on Street_c++_doc
| 1
|
leetcode_55_Jump Game_c++_query
|
leetcode_55_Jump Game_c++_doc
| 1
|
leetcode_986_Interval List Intersections_python_query
|
leetcode_986_Interval List Intersections_python_doc
| 1
|
leetcode_903_Valid Permutations for DI Sequence_java_query
|
leetcode_903_Valid Permutations for DI Sequence_java_doc
| 1
|
leetcode_1391_Check if There is a Valid Path in a Grid_c++_query
|
leetcode_1391_Check if There is a Valid Path in a Grid_c++_doc
| 1
|
leetcode_1871_Jump Game VII_c++_query
|
leetcode_1871_Jump Game VII_c++_doc
| 1
|
leetcode_1215_Stepping Numbers_javascript_query
|
leetcode_1215_Stepping Numbers_javascript_doc
| 1
|
leetcode_1963_Minimum Number of Swaps to Make the String Balanced_c++_query
|
leetcode_1963_Minimum Number of Swaps to Make the String Balanced_c++_doc
| 1
|
leetcode_1233_Remove Sub-Folders from the Filesystem_java_query
|
leetcode_1233_Remove Sub-Folders from the Filesystem_java_doc
| 1
|
leetcode_243_Shortest Word Distance_javascript_query
|
leetcode_243_Shortest Word Distance_javascript_doc
| 1
|
leetcode_1198_Find Smallest Common Element in All Rows_python_query
|
leetcode_1198_Find Smallest Common Element in All Rows_python_doc
| 1
|
leetcode_392_Is Subsequence_javascript_query
|
leetcode_392_Is Subsequence_javascript_doc
| 1
|
leetcode_2379_Minimum Recolors to Get K Consecutive Black Blocks_javascript_query
|
leetcode_2379_Minimum Recolors to Get K Consecutive Black Blocks_javascript_doc
| 1
|
leetcode_211_Design Add and Search Words Data Structure_javascript_query
|
leetcode_211_Design Add and Search Words Data Structure_javascript_doc
| 1
|
leetcode_222_Count Complete Tree Nodes_javascript_query
|
leetcode_222_Count Complete Tree Nodes_javascript_doc
| 1
|
leetcode_95_Unique Binary Search Trees II_java_query
|
leetcode_95_Unique Binary Search Trees II_java_doc
| 1
|
leetcode_1485_Clone Binary Tree With Random Pointer_java_query
|
leetcode_1485_Clone Binary Tree With Random Pointer_java_doc
| 1
|
leetcode_889_Construct Binary Tree from Preorder and Postorder Traversal_java_query
|
leetcode_889_Construct Binary Tree from Preorder and Postorder Traversal_java_doc
| 1
|
leetcode_108_Convert Sorted Array to Binary Search Tree_c++_query
|
leetcode_108_Convert Sorted Array to Binary Search Tree_c++_doc
| 1
|
leetcode_671_Second Minimum Node In a Binary Tree_c++_query
|
leetcode_671_Second Minimum Node In a Binary Tree_c++_doc
| 1
|
leetcode_563_Binary Tree Tilt_c++_query
|
leetcode_563_Binary Tree Tilt_c++_doc
| 1
|
leetcode_2280_Minimum Lines to Represent a Line Chart_java_query
|
leetcode_2280_Minimum Lines to Represent a Line Chart_java_doc
| 1
|
leetcode_2608_Shortest Cycle in a Graph_javascript_query
|
leetcode_2608_Shortest Cycle in a Graph_javascript_doc
| 1
|
leetcode_332_Reconstruct Itinerary_python_query
|
leetcode_332_Reconstruct Itinerary_python_doc
| 1
|
leetcode_1467_Probability of a Two Boxes Having The Same Number of Distinct Balls_java_query
|
leetcode_1467_Probability of a Two Boxes Having The Same Number of Distinct Balls_java_doc
| 1
|
leetcode_382_Linked List Random Node_python_query
|
leetcode_382_Linked List Random Node_python_doc
| 1
|
leetcode_2315_Count Asterisks_python_query
|
leetcode_2315_Count Asterisks_python_doc
| 1
|
leetcode_146_LRU Cache_python_query
|
leetcode_146_LRU Cache_python_doc
| 1
|
leetcode_356_Line Reflection_c++_query
|
leetcode_356_Line Reflection_c++_doc
| 1
|
leetcode_736_Parse Lisp Expression_c++_query
|
leetcode_736_Parse Lisp Expression_c++_doc
| 1
|
leetcode_1309_Decrypt String from Alphabet to Integer Mapping_javascript_query
|
leetcode_1309_Decrypt String from Alphabet to Integer Mapping_javascript_doc
| 1
|
leetcode_1381_Design a Stack With Increment Operation_javascript_query
|
leetcode_1381_Design a Stack With Increment Operation_javascript_doc
| 1
|
leetcode_274_H-Index_java_query
|
leetcode_274_H-Index_java_doc
| 1
|
leetcode_1656_Design an Ordered Stream_c++_query
|
leetcode_1656_Design an Ordered Stream_c++_doc
| 1
|
leetcode_1781_Sum of Beauty of All Substrings_c++_query
|
leetcode_1781_Sum of Beauty of All Substrings_c++_doc
| 1
|
leetcode_777_Swap Adjacent in LR String_java_query
|
leetcode_777_Swap Adjacent in LR String_java_doc
| 1
|
leetcode_892_Surface Area of 3D Shapes_c++_query
|
leetcode_892_Surface Area of 3D Shapes_c++_doc
| 1
|
leetcode_2044_Count Number of Maximum Bitwise-OR Subsets_python_query
|
leetcode_2044_Count Number of Maximum Bitwise-OR Subsets_python_doc
| 1
|
leetcode_1462_Course Schedule IV_c++_query
|
leetcode_1462_Course Schedule IV_c++_doc
| 1
|
leetcode_325_Maximum Size Subarray Sum Equals k_c++_query
|
leetcode_325_Maximum Size Subarray Sum Equals k_c++_doc
| 1
|
leetcode_1703_Minimum Adjacent Swaps for K Consecutive Ones_c++_query
|
leetcode_1703_Minimum Adjacent Swaps for K Consecutive Ones_c++_doc
| 1
|
leetcode_700_Search in a Binary Search Tree_java_query
|
leetcode_700_Search in a Binary Search Tree_java_doc
| 1
|
leetcode_2463_Minimum Total Distance Traveled_python_query
|
leetcode_2463_Minimum Total Distance Traveled_python_doc
| 1
|
leetcode_1823_Find the Winner of the Circular Game_javascript_query
|
leetcode_1823_Find the Winner of the Circular Game_javascript_doc
| 1
|
leetcode_1847_Closest Room_python_query
|
leetcode_1847_Closest Room_python_doc
| 1
|
leetcode_411_Minimum Unique Word Abbreviation_python_query
|
leetcode_411_Minimum Unique Word Abbreviation_python_doc
| 1
|
leetcode_2029_Stone Game IX_c++_query
|
leetcode_2029_Stone Game IX_c++_doc
| 1
|
leetcode_985_Sum of Even Numbers After Queries_javascript_query
|
leetcode_985_Sum of Even Numbers After Queries_javascript_doc
| 1
|
leetcode_1253_Reconstruct a 2-Row Binary Matrix_c++_query
|
leetcode_1253_Reconstruct a 2-Row Binary Matrix_c++_doc
| 1
|
leetcode_1617_Count Subtrees With Max Distance Between Cities_java_query
|
leetcode_1617_Count Subtrees With Max Distance Between Cities_java_doc
| 1
|
leetcode_2040_Kth Smallest Product of Two Sorted Arrays_python_query
|
leetcode_2040_Kth Smallest Product of Two Sorted Arrays_python_doc
| 1
|
leetcode_465_Optimal Account Balancing_c++_query
|
leetcode_465_Optimal Account Balancing_c++_doc
| 1
|
leetcode_2213_Longest Substring of One Repeating Character_javascript_query
|
leetcode_2213_Longest Substring of One Repeating Character_javascript_doc
| 1
|
leetcode_546_Remove Boxes_java_query
|
leetcode_546_Remove Boxes_java_doc
| 1
|
leetcode_355_Design Twitter_c++_query
|
leetcode_355_Design Twitter_c++_doc
| 1
|
leetcode_1663_Smallest String With A Given Numeric Value_java_query
|
leetcode_1663_Smallest String With A Given Numeric Value_java_doc
| 1
|
leetcode_2174_Remove All Ones With Row and Column Flips II_python_query
|
leetcode_2174_Remove All Ones With Row and Column Flips II_python_doc
| 1
|
leetcode_458_Poor Pigs_c++_query
|
leetcode_458_Poor Pigs_c++_doc
| 1
|
leetcode_2436_Minimum Split Into Subarrays With GCD Greater Than One_c++_query
|
leetcode_2436_Minimum Split Into Subarrays With GCD Greater Than One_c++_doc
| 1
|
leetcode_769_Max Chunks To Make Sorted_c++_query
|
leetcode_769_Max Chunks To Make Sorted_c++_doc
| 1
|
leetcode_2206_Divide Array Into Equal Pairs_python_query
|
leetcode_2206_Divide Array Into Equal Pairs_python_doc
| 1
|
leetcode_1223_Dice Roll Simulation_python_query
|
leetcode_1223_Dice Roll Simulation_python_doc
| 1
|
leetcode_1170_Compare Strings by Frequency of the Smallest Character_c++_query
|
leetcode_1170_Compare Strings by Frequency of the Smallest Character_c++_doc
| 1
|
leetcode_1813_Sentence Similarity III_python_query
|
leetcode_1813_Sentence Similarity III_python_doc
| 1
|
leetcode_420_Strong Password Checker_java_query
|
leetcode_420_Strong Password Checker_java_doc
| 1
|
leetcode_1506_Find Root of N-Ary Tree_c++_query
|
leetcode_1506_Find Root of N-Ary Tree_c++_doc
| 1
|
leetcode_2136_Earliest Possible Day of Full Bloom_javascript_query
|
leetcode_2136_Earliest Possible Day of Full Bloom_javascript_doc
| 1
|
leetcode_2101_Detonate the Maximum Bombs_python_query
|
leetcode_2101_Detonate the Maximum Bombs_python_doc
| 1
|
leetcode_2322_Minimum Score After Removals on a Tree_python_query
|
leetcode_2322_Minimum Score After Removals on a Tree_python_doc
| 1
|
leetcode_2383_Minimum Hours of Training to Win a Competition_javascript_query
|
leetcode_2383_Minimum Hours of Training to Win a Competition_javascript_doc
| 1
|
leetcode_1620_Coordinate With Maximum Network Quality_javascript_query
|
leetcode_1620_Coordinate With Maximum Network Quality_javascript_doc
| 1
|
leetcode_1325_Delete Leaves With a Given Value_javascript_query
|
leetcode_1325_Delete Leaves With a Given Value_javascript_doc
| 1
|
leetcode_1899_Merge Triplets to Form Target Triplet_javascript_query
|
leetcode_1899_Merge Triplets to Form Target Triplet_javascript_doc
| 1
|
leetcode_1235_Maximum Profit in Job Scheduling_python_query
|
leetcode_1235_Maximum Profit in Job Scheduling_python_doc
| 1
|
leetcode_1154_Day of the Year_c++_query
|
leetcode_1154_Day of the Year_c++_doc
| 1
|
leetcode_1354_Construct Target Array With Multiple Sums_java_query
|
leetcode_1354_Construct Target Array With Multiple Sums_java_doc
| 1
|
leetcode_961_N-Repeated Element in Size 2N Array_java_query
|
leetcode_961_N-Repeated Element in Size 2N Array_java_doc
| 1
|
leetcode_1200_Minimum Absolute Difference_python_query
|
leetcode_1200_Minimum Absolute Difference_python_doc
| 1
|
README.md exists but content is empty.
- Downloads last month
- 3