id string | source string | tags list | text string | entities list | negatives list | expect_empty bool |
|---|---|---|---|---|---|---|
dev-conf-001 | config | [
"config"
] | # FastAPI Backend Configuration
APP_ENV=production
SECRET_KEY=sk-proj-fastapiprodsecretkey1234567890abcdefghijklmnopqrstuvwxyz
DATABASE_URL=postgresql://db_master:sk-proj-dbpassword1234567890@10.0.1.25:5432/main_db
ALERT_EMAIL=security-alerts@internal-cloud.io
ONCALL_PHONE=+1-415-555-0199
ADMIN_NAME=Marcus Vance
COMPAN... | [
{
"label": "API_KEY",
"start": 62,
"end": 126,
"text": "sk-proj-fastapiprodsecretkey1234567890abcdefghijklmnopqrstuvwxyz"
},
{
"label": "API_KEY",
"start": 163,
"end": 191,
"text": "sk-proj-dbpassword1234567890"
},
{
"label": "IP_ADDRESS",
"start": 192,
"end": 201... | [] | false |
dev-conf-002 | config | [
"config"
] | // next.config.js - Production Secrets
module.exports = {
env: {
ANTHROPIC_KEY: 'sk-ant-api03-abcdefghijklmnopqrstuvwxyz0123456789-_abcdefghijklmnopqrstuvwxyz0123456789-_abcdefghijkAA',
SLACK_BOT_TOKEN: 'xoxb-test-bot-token-abcdef123456',
TREASURY_WALLET: '0x71C8451C3B24F79F64B29E385203D4f1BfDE450E',
... | [
{
"label": "API_KEY",
"start": 87,
"end": 189,
"text": "sk-ant-api03-abcdefghijklmnopqrstuvwxyz0123456789-_abcdefghijklmnopqrstuvwxyz0123456789-_abcdefghijkAA"
},
{
"label": "API_KEY",
"start": 214,
"end": 246,
"text": "xoxb-test-bot-token-abcdef123456"
},
{
"label": "IBA... | [] | false |
dev-conf-003 | config | [
"config"
] | provider "aws" {
region = "us-west-2"
access_key = "AKIA1234567890ABCDEF"
}
variable "auth_jwt" {
default = "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJzdWIiOiIxMjM0NTY3ODkwIiwibmFtZSI6IkpvaG4gRG9lIiwiaWF0IjoxNTE2MjM5MDIyfQ.SflKxwRJSMeKKF2QT4fwpMeJf36POk6yJV_adQssw5c"
}
# Contact infrastructure lead Vikram Pat... | [
{
"label": "API_KEY",
"start": 60,
"end": 80,
"text": "AKIA1234567890ABCDEF"
},
{
"label": "AUTH_TOKEN",
"start": 120,
"end": 275,
"text": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJzdWIiOiIxMjM0NTY3ODkwIiwibmFtZSI6IkpvaG4gRG9lIiwiaWF0IjoxNTE2MjM5MDIyfQ.SflKxwRJSMeKKF2QT4fwpMeJf36P... | [] | false |
dev-conf-004 | config | [
"config"
] | apiVersion: v1
kind: Pod
metadata:
name: sync-worker
namespace: data-pipeline
spec:
containers:
- name: sync
image: sync-runner:latest
env:
- name: GITHUB_TOKEN
value: "ghp_abcdefghijklmnopqrstuvwxyz0123456789"
- name: HOST_IP
value: "172.16.24.12"
- name: CLUSTER_ADMIN
val... | [
{
"label": "API_KEY",
"start": 195,
"end": 235,
"text": "ghp_abcdefghijklmnopqrstuvwxyz0123456789"
},
{
"label": "IP_ADDRESS",
"start": 271,
"end": 283,
"text": "172.16.24.12"
},
{
"label": "PERSON",
"start": 325,
"end": 337,
"text": "Sarah Connor"
}
] | [] | false |
dev-conf-005 | config | [
"config"
] | version: '3.8'
services:
maps-proxy:
image: maps-service:v2
environment:
- GOOGLE_API_KEY=AIzaSyD3asb-2pEZVqMkmL6M9N6nHZRR_znhrh0
- BIND_ADDRESS=192.168.10.45
- ONCALL_PHONE=+44 20 7946 0912
networks:
app_net:
ipv4_address: 10.244.1.50
networks:
app_net:
driver: brid... | [
{
"label": "API_KEY",
"start": 106,
"end": 145,
"text": "AIzaSyD3asb-2pEZVqMkmL6M9N6nHZRR_znhrh0"
},
{
"label": "IP_ADDRESS",
"start": 167,
"end": 180,
"text": "192.168.10.45"
},
{
"label": "PHONE",
"start": 202,
"end": 218,
"text": "+44 20 7946 0912"
},
{... | [] | false |
dev-cli-006 | cli | [
"cli"
] | curl -X POST https://api.stripe.com/v1/customers \
-H "Authorization: Bearer eyJhbGciOiJIUzI1NiJ9.eyJ1c2VyIjoiZGV2In0.signature_string_here_1234567890" \
-H "Content-Type: application/json" \
-d '{
"email": "customer.billing@acme-corp.com",
"name": "David Miller",
"ip": "198.51.100.22"
}' | [
{
"label": "AUTH_TOKEN",
"start": 72,
"end": 152,
"text": "Bearer eyJhbGciOiJIUzI1NiJ9.eyJ1c2VyIjoiZGV2In0.signature_string_here_1234567890"
},
{
"label": "EMAIL",
"start": 218,
"end": 248,
"text": "customer.billing@acme-corp.com"
},
{
"label": "PERSON",
"start": 264,... | [] | false |
dev-cli-007 | cli | [
"cli"
] | export GITHUB_TOKEN="github_pat_11ABCDEFG0123456789_abcdefghijklmnopqrstuvwxyz0123456789"
git clone https://${GITHUB_TOKEN}@github.com/secure-org/core-services.git
ssh -i /root/.ssh/deploy_key ubuntu@172.16.50.12 "sudo systemctl restart nginx"
Contact admin: Rachel Green (rgreen@secure-org.com)
| [
{
"label": "API_KEY",
"start": 21,
"end": 88,
"text": "github_pat_11ABCDEFG0123456789_abcdefghijklmnopqrstuvwxyz0123456789"
},
{
"label": "IP_ADDRESS",
"start": 200,
"end": 212,
"text": "172.16.50.12"
},
{
"label": "PERSON",
"start": 260,
"end": 272,
"text": "... | [] | false |
dev-cli-008 | cli | [
"cli"
] | cat << 'EOF' > /etc/ssl/certs/server.key
-----BEGIN RSA PRIVATE KEY-----
MIIEowIBAAKCAQEAw7N8b9pL5m4k3j2h1g0f9e8d7c6b5a4z
-----END RSA PRIVATE KEY-----
EOF
Host binding: 10.0.0.1
Operator: Arthur Dent
Organization: Galactic Transport
| [
{
"label": "AUTH_TOKEN",
"start": 41,
"end": 72,
"text": "-----BEGIN RSA PRIVATE KEY-----"
},
{
"label": "IP_ADDRESS",
"start": 171,
"end": 179,
"text": "10.0.0.1"
},
{
"label": "PERSON",
"start": 190,
"end": 201,
"text": "Arthur Dent"
},
{
"label": "O... | [] | false |
dev-logs-009 | logs | [
"logs"
] | [2026-10-24 14:15:22] ERROR in app.services.billing: Payment failed
Traceback (most recent call last):
File "/srv/app/services/billing.py", line 142, in process_transaction
charge = stripe.Charge.create(amount=5000, card=card_number, iban=payout_iban)
CardError: Transaction declined for card 4532015112830366.
Loc... | [
{
"label": "CREDIT_CARD",
"start": 299,
"end": 315,
"text": "4532015112830366"
},
{
"label": "CREDIT_CARD",
"start": 351,
"end": 367,
"text": "4532015112830366"
},
{
"label": "IBAN_CRYPTO",
"start": 386,
"end": 408,
"text": "DE89370400440532013000"
},
{
... | [] | false |
dev-logs-010 | logs | [
"logs"
] | Nginx Access Log:
192.168.1.105 - - [24/Oct/2026:12:00:01 +0000] "GET /v1/user?email=alice.smith@acme.com HTTP/1.1" 200 1024
10.0.4.15 - - [24/Oct/2026:12:00:02 +0000] "POST /v1/auth HTTP/1.1" 401 256
Incident reported in Seattle, Washington
Maintained by Umbrella Health
| [
{
"label": "IP_ADDRESS",
"start": 18,
"end": 31,
"text": "192.168.1.105"
},
{
"label": "EMAIL",
"start": 85,
"end": 105,
"text": "alice.smith@acme.com"
},
{
"label": "IP_ADDRESS",
"start": 125,
"end": 134,
"text": "10.0.4.15"
},
{
"label": "LOCATION",
... | [] | false |
dev-logs-011 | logs | [
"logs"
] | Verification Audit Trail:
Record ID: KYC-2026-9901
Identity Check: National ID 2345 6789 0124 verified.
SSN: 123-45-6789
Customer: Rahul Sharma
Phone: +91 98765 43210
Office: New Delhi, India
Authorized by Apex Financial Services
| [
{
"label": "GOVT_ID",
"start": 79,
"end": 93,
"text": "2345 6789 0124"
},
{
"label": "GOVT_ID",
"start": 109,
"end": 120,
"text": "123-45-6789"
},
{
"label": "PERSON",
"start": 131,
"end": 143,
"text": "Rahul Sharma"
},
{
"label": "PHONE",
"start":... | [] | false |
dev-code-012 | code | [
"code"
] | import openai
import psycopg2
client = openai.OpenAI(
api_key="sk-proj-supersecretkey1234567890abcdefghijklmnopqrstuvwxyz"
)
conn = psycopg2.connect("postgresql://app_user:sk-admin-pass9876543210@10.20.30.40:5432/production")
ENGINEER_CONTACT = "elena.rostova@quantum-soft.io"
ENGINEER_NAME = "Elena Rostova"
| [
{
"label": "API_KEY",
"start": 68,
"end": 126,
"text": "sk-proj-supersecretkey1234567890abcdefghijklmnopqrstuvwxyz"
},
{
"label": "API_KEY",
"start": 178,
"end": 201,
"text": "sk-admin-pass9876543210"
},
{
"label": "IP_ADDRESS",
"start": 202,
"end": 213,
"text... | [] | false |
dev-code-013 | code | [
"code"
] | import { ethers } from "ethers";
const provider = new ethers.JsonRpcProvider("http://192.168.10.200:8545");
const deployerWallet = "0x71C8451C3B24F79F64B29E385203D4f1BfDE450E";
const adminSlack = "xoxp-test-user-token-abcdef123456";
const lead = "Hiroshi Takahashi";
| [
{
"label": "IP_ADDRESS",
"start": 86,
"end": 100,
"text": "192.168.10.200"
},
{
"label": "IBAN_CRYPTO",
"start": 133,
"end": 175,
"text": "0x71C8451C3B24F79F64B29E385203D4f1BfDE450E"
},
{
"label": "API_KEY",
"start": 198,
"end": 231,
"text": "xoxp-test-user-to... | [] | false |
dev-conf-014 | config | [
"config"
] | SLACK_SIGNING_SECRET=sk-proj-slacksecretkey1234567890
SLACK_BOT_TOKEN=xoxb-test-slack-token-9876543210
SLACK_USER_TOKEN=xoxp-test-user-token-1111222233
MAINTAINER_EMAIL=bot-admin@slack-integrations.dev
MAINTAINER_NAME=Sergei Volkov
| [
{
"label": "API_KEY",
"start": 21,
"end": 53,
"text": "sk-proj-slacksecretkey1234567890"
},
{
"label": "API_KEY",
"start": 70,
"end": 102,
"text": "xoxb-test-slack-token-9876543210"
},
{
"label": "API_KEY",
"start": 120,
"end": 151,
"text": "xoxp-test-user-tok... | [] | false |
dev-conf-015 | config | [
"config"
] | {
"type": "service_account",
"project_id": "analytics-prod-9921",
"private_key": "-----BEGIN RSA PRIVATE KEY-----\nMIIEowIBAAKCAQEA0mFk73l3K8v9v4B2c1A890deF\n-----END RSA PRIVATE KEY-----\n",
"client_email": "svc-data-sync@analytics-prod-9921.iam.gserviceaccount.com",
"admin_contact": "maya.patel@globaltech.o... | [
{
"label": "AUTH_TOKEN",
"start": 88,
"end": 119,
"text": "-----BEGIN RSA PRIVATE KEY-----"
},
{
"label": "EMAIL",
"start": 217,
"end": 274,
"text": "svc-data-sync@analytics-prod-9921.iam.gserviceaccount.com"
},
{
"label": "EMAIL",
"start": 297,
"end": 322,
"t... | [] | false |
dev-code-016 | code | [
"code"
] | INSERT INTO users (id, name, email, phone, ssn, created_at) VALUES
(1, 'Alice Walker', 'alice.walker@venture.io', '+1-202-555-0143', '219-09-9999', NOW()),
(2, 'Bob Montgomery', 'bob.m@quantum-soft.io', '+44 7911 123456', '457-55-5462', NOW());
-- Migration approved by Security Director: Gregory Harrison at Acme Corpo... | [
{
"label": "PERSON",
"start": 72,
"end": 84,
"text": "Alice Walker"
},
{
"label": "EMAIL",
"start": 88,
"end": 111,
"text": "alice.walker@venture.io"
},
{
"label": "PHONE",
"start": 115,
"end": 130,
"text": "+1-202-555-0143"
},
{
"label": "GOVT_ID",
... | [] | false |
dev-cli-017 | cli | [
"cli"
] | commit c35a435ff79b50ada7ec6a781e052a5b3ebf1bca
Author: Sarthak Maurya <sarthexe@users.noreply.github.com>
Date: Sat Oct 24 14:55:00 2026 +0530
Reviewed-by: Linus Torvalds <torvalds@linux-foundation.org>
Signed-off-by: Alan Turing <aturing@bletchley.ac.uk>
| [
{
"label": "PERSON",
"start": 56,
"end": 70,
"text": "Sarthak Maurya"
},
{
"label": "EMAIL",
"start": 72,
"end": 105,
"text": "sarthexe@users.noreply.github.com"
},
{
"label": "PERSON",
"start": 164,
"end": 178,
"text": "Linus Torvalds"
},
{
"label": "... | [] | false |
dev-code-018 | code | [
"code"
] | // python microservice connector for redis
const connectionString = "redis://user:sk-proj-testkey0001abcdefghijklmnopqrstuvwxyz123456@10.10.0.50:6379/production";
const support = "eng_python_0@company-cloud.dev";
console.log("Service started by Developer_PYTHON");
| [
{
"label": "API_KEY",
"start": 82,
"end": 133,
"text": "sk-proj-testkey0001abcdefghijklmnopqrstuvwxyz123456"
},
{
"label": "IP_ADDRESS",
"start": 134,
"end": 144,
"text": "10.10.0.50"
},
{
"label": "EMAIL",
"start": 180,
"end": 210,
"text": "eng_python_0@compa... | [] | false |
dev-code-019 | code | [
"code"
] | // typescript microservice connector for postgres
const connectionString = "postgres://user:sk-ant-api03-testkey0002abcdefghijklmnopqrstuvwxyz0123456789-_0123456789AA@10.10.1.50:6379/production";
const support = "eng_typescript_1@company-cloud.dev";
console.log("Service started by Developer_TYPESCRIPT");
| [
{
"label": "API_KEY",
"start": 92,
"end": 166,
"text": "sk-ant-api03-testkey0002abcdefghijklmnopqrstuvwxyz0123456789-_0123456789AA"
},
{
"label": "IP_ADDRESS",
"start": 167,
"end": 177,
"text": "10.10.1.50"
},
{
"label": "EMAIL",
"start": 213,
"end": 247,
"tex... | [] | false |
dev-code-020 | code | [
"code"
] | // go microservice connector for mongodb
const connectionString = "mongodb://user:AKIA9988776655443322@10.10.2.50:6379/production";
const support = "eng_go_2@company-cloud.dev";
console.log("Service started by Developer_GO");
| [
{
"label": "API_KEY",
"start": 82,
"end": 102,
"text": "AKIA9988776655443322"
},
{
"label": "IP_ADDRESS",
"start": 103,
"end": 113,
"text": "10.10.2.50"
},
{
"label": "EMAIL",
"start": 149,
"end": 175,
"text": "eng_go_2@company-cloud.dev"
},
{
"label":... | [] | false |
dev-code-021 | code | [
"code"
] | // rust microservice connector for sqlite
const connectionString = "sqlite://user:ghp_99887766554433221100abcdefghijklmnop@10.10.3.50:6379/production";
const support = "eng_rust_3@company-cloud.dev";
console.log("Service started by Developer_RUST");
| [
{
"label": "API_KEY",
"start": 82,
"end": 122,
"text": "ghp_99887766554433221100abcdefghijklmnop"
},
{
"label": "IP_ADDRESS",
"start": 123,
"end": 133,
"text": "10.10.3.50"
},
{
"label": "EMAIL",
"start": 169,
"end": 197,
"text": "eng_rust_3@company-cloud.dev"... | [] | false |
dev-code-022 | code | [
"code"
] | // java microservice connector for kafka
const connectionString = "kafka://user:AIzaSyD3asb-2pEZVqMkmL6M9N6nHZRR_znhrh0@10.10.4.50:6379/production";
const support = "eng_java_4@company-cloud.dev";
console.log("Service started by Developer_JAVA");
| [
{
"label": "API_KEY",
"start": 80,
"end": 119,
"text": "AIzaSyD3asb-2pEZVqMkmL6M9N6nHZRR_znhrh0"
},
{
"label": "IP_ADDRESS",
"start": 120,
"end": 130,
"text": "10.10.4.50"
},
{
"label": "EMAIL",
"start": 166,
"end": 194,
"text": "eng_java_4@company-cloud.dev"
... | [] | false |
dev-code-023 | code | [
"code"
] | // shell microservice connector for mysql
const connectionString = "mysql://user:xoxb-test-bot-token-9999888877@10.10.5.50:6379/production";
const support = "eng_shell_5@company-cloud.dev";
console.log("Service started by Developer_SHELL");
| [
{
"label": "API_KEY",
"start": 81,
"end": 111,
"text": "xoxb-test-bot-token-9999888877"
},
{
"label": "IP_ADDRESS",
"start": 112,
"end": 122,
"text": "10.10.5.50"
},
{
"label": "EMAIL",
"start": 158,
"end": 187,
"text": "eng_shell_5@company-cloud.dev"
},
{... | [] | false |
dev-hard-024 | hard_neg | [
"hard_neg"
] | #include <iostream>
#include <vector>
#include <memory>
#include <map>
template <typename T, typename Allocator = std::allocator<T>>
class ThreadSafeQueue {
public:
void push(const T& item) {
if ((item < 100) && (1 << 4 < 32)) {
data.push_back(item);
}
}
private:
std::vector<T, ... | [] | [
{
"label": "API_KEY",
"value": "ThreadSafeQueue"
},
{
"label": "PERSON",
"value": "ThreadSafeQueue"
},
{
"label": "ORGANIZATION",
"value": "ThreadSafeQueue"
}
] | true |
dev-hard-025 | hard_neg | [
"hard_neg"
] | Release Artifact Checksum & Verification Report:
Git Commit: 710204362001dde49bb1e4567890abcdef123456
Docker Digest: sha256:4d5e1234567890abcdef1234567890abcdef1234567890abcdef1234567890abcdef
Session UUID: 550e8400-e29b-41d4-a716-446655440000
Invalid IP: 192.168.1.300
Order #4532015112830367 shipped.
Tracking #2345 67... | [] | [
{
"label": "IP_ADDRESS",
"value": "192.168.1.300"
},
{
"label": "CREDIT_CARD",
"value": "4532015112830367"
},
{
"label": "GOVT_ID",
"value": "2345 6789 0120"
},
{
"label": "IBAN_CRYPTO",
"value": "DE89370400440532013001"
}
] | true |
dev-hard-026 | hard_neg | [
"hard_neg"
] | function renderComponent({ count, items }) {
return (
<div className="layout">
{count < 10 ? (
<span className="badge">Few items left</span>
) : (
<ul className="list">
{items.map(i => <li key={i.id}>{i.name}</li>)}
</ul>
)}
</div>
);
}
/* CSS Stylesheet ... | [] | [
{
"label": "PERSON",
"value": "renderComponent"
}
] | true |
dev-hard-027 | hard_neg | [
"hard_neg"
] | Tech Architecture Allowlist:
We deploy with Docker, Kubernetes, and Terraform on AWS, Azure, and GCP.
Our services run on Linux Ubuntu using Python, FastAPI, Redis, PostgreSQL, and Kafka.
The frontend is built with React, Next.js, and TypeScript.
Monitoring is handled by Datadog, Prometheus, and Grafana.
Code Identifi... | [] | [
{
"label": "ORGANIZATION",
"value": "Docker"
},
{
"label": "ORGANIZATION",
"value": "Kubernetes"
},
{
"label": "ORGANIZATION",
"value": "AWS"
},
{
"label": "ORGANIZATION",
"value": "GCP"
},
{
"label": "ORGANIZATION",
"value": "Azure"
},
{
"label": "ORG... | true |
dev-hard-028 | hard_neg | [
"hard_neg"
] | #!/bin/bash
if [ "$COUNT" -lt 5 ] && [ "$STATUS" != "active" ]; then
cat input.txt > /tmp/output.log 2>&1
fi
while [ $INDEX -lt $MAX_ITEMS ]; do
echo "Item: $INDEX" >> list.txt
INDEX=$((INDEX + 1))
done
| [] | [] | true |
dev-hard-029 | hard_neg | [
"hard_neg"
] | SELECT
user_id,
COUNT(order_id) as total_orders,
SUM(amount) as total_spend
FROM orders
WHERE status = 'completed'
AND amount > 50.00
AND created_at < '2026-01-01'
AND (discount_code IS NULL OR discount_code < 'DISC-100')
GROUP BY user_id
HAVING COUNT(order_id) > 2 AND SUM(amount) < 10000.00
ORDER BY... | [] | [] | true |
dev-hard-030 | hard_neg | [
"hard_neg"
] | use std::collections::HashMap;
pub struct Cache<'a, K: Eq + std::hash::Hash, V> {
entries: HashMap<K, (V, u64)>,
ttl: &'a u64,
}
impl<'a, K: Eq + std::hash::Hash, V> Cache<'a, K, V> {
pub fn get(&self, key: &K) -> Option<&V> {
let (val, timestamp) = self.entries.get(key)?;
if *timestamp < ... | [] | [
{
"label": "PERSON",
"value": "Cache"
},
{
"label": "API_KEY",
"value": "Cache"
}
] | true |
dev-hard-031 | hard_neg | [
"hard_neg"
] | import re
EMAIL_REGEX = r'^[a-zA-Z0-9_.+-]+@[a-zA-Z0-9-]+\.[a-zA-Z0-9-.]+$'
VERSION_REGEX = r'^v\d+\.\d+\.\d+(-[a-zA-Z0-9]+)?$'
IP_CANDIDATE = r'\b(?:\d{1,3}\.){3}\d{1,3}\b'
HEX_COLOR = r'^#([A-Fa-f0-9]{6}|[A-Fa-f0-9]{3})$'
def validate_input(val: str) -> bool:
return bool(re.match(VERSION_REGEX, val))
| [] | [] | true |
dev-hard-032 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #100
#include <vector>
#include <algorithm>
class Solution_0 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx]... | [] | [] | true |
dev-hard-033 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #101
#include <vector>
#include <algorithm>
class Solution_1 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx]... | [] | [] | true |
dev-hard-034 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #102
#include <vector>
#include <algorithm>
class Solution_2 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx]... | [] | [] | true |
dev-hard-035 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #103
#include <vector>
#include <algorithm>
class Solution_3 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx]... | [] | [] | true |
dev-hard-036 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #104
#include <vector>
#include <algorithm>
class Solution_4 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx]... | [] | [] | true |
dev-hard-037 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #105
#include <vector>
#include <algorithm>
class Solution_5 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx]... | [] | [] | true |
dev-hard-038 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #106
#include <vector>
#include <algorithm>
class Solution_6 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx]... | [] | [] | true |
dev-hard-039 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #107
#include <vector>
#include <algorithm>
class Solution_7 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx]... | [] | [] | true |
dev-hard-040 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #108
#include <vector>
#include <algorithm>
class Solution_8 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx]... | [] | [] | true |
dev-hard-041 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #109
#include <vector>
#include <algorithm>
class Solution_9 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx]... | [] | [] | true |
dev-hard-042 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #110
#include <vector>
#include <algorithm>
class Solution_10 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-043 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #111
#include <vector>
#include <algorithm>
class Solution_11 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-044 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #112
#include <vector>
#include <algorithm>
class Solution_12 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-045 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #113
#include <vector>
#include <algorithm>
class Solution_13 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-046 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #114
#include <vector>
#include <algorithm>
class Solution_14 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-047 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #115
#include <vector>
#include <algorithm>
class Solution_15 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-048 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #116
#include <vector>
#include <algorithm>
class Solution_16 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-049 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #117
#include <vector>
#include <algorithm>
class Solution_17 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-050 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #118
#include <vector>
#include <algorithm>
class Solution_18 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-051 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #119
#include <vector>
#include <algorithm>
class Solution_19 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-052 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #120
#include <vector>
#include <algorithm>
class Solution_20 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-053 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #121
#include <vector>
#include <algorithm>
class Solution_21 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-054 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #122
#include <vector>
#include <algorithm>
class Solution_22 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-055 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #123
#include <vector>
#include <algorithm>
class Solution_23 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
dev-hard-056 | hard_neg | [
"hard_neg"
] | // Clean LeetCode Algorithmic Problem #124
#include <vector>
#include <algorithm>
class Solution_24 {
public:
int maxSubArray(std::vector<int>& nums) {
int max_so_far = nums[0];
int curr_max = nums[0];
for (size_t idx = 1; idx < nums.size(); ++idx) {
curr_max = std::max(nums[idx... | [] | [] | true |
README.md exists but content is empty.
- Downloads last month
- 23