uuid stringlengths 36 36 | repo_name stringlengths 5 133 | relative_path stringlengths 3 3.76k | content stringlengths 282 4.03M | category stringclasses 6
values | algo_rel_score float32 0.9 1 | quality_score float32 3 8.13 | source_meta dict |
|---|---|---|---|---|---|---|---|
eb4d05b4-dd77-48e5-bdb3-257082606607 | danyfang/SourceCode | cpp/leetcode/ValidBoomerang.cpp | //Leetcode Problem No 1037. Valid Boomerang
//Solution written by <NAME> on 14 May, 2019
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
using namespace std;
class Solution {
public:
bool isBoomerang(v... | ALGO | 0.999496 | 6.117522 | {
"github_metadata": {
"branch": "master",
"commit_count": 249,
"repo_created_at": "2018-02-05T13:48:22.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "6e7a6ab9... |
0911b469-9a9c-4d86-a090-eef0422b3cdc | AdarshNandanwar/DSA-and-Competitive-Programming | LeetCode/943.cpp | // https://leetcode.com/problems/verifying-an-alien-dictionary/
// Method 1 (TSP, Last Case logic not clear, strategy of selecting max overlap path if the weight are equal passes the test case. but not sure why):
class Solution {
public:
int get_overlap(string i, string j){
if(i == j) return 0;
... | ALGO | 0.999953 | 5.720585 | {
"github_metadata": {
"branch": "master",
"commit_count": 52,
"repo_created_at": "2020-04-05T22:00:23.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 1,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "70f4c2a66... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.