Search is not available for this dataset
id string | domain string | subdomain string | difficulty string | source string | source_id string | license string | language string | n_turns int64 | tokens_est int64 | has_cot bool | code_langs list | messages list | nexus_quality_score float64 | nexus_perplexity float64 | nexus_embedding list | decontaminated bool |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
nexus-sft-0e13943e9f4c4fb3 | code | general | easy | nvidia/OpenCodeInstruct | 4d61a897c0f86467f5c504a62a5f7282 | CC-BY-4.0 | en | 2 | 1,024 | false | [
"python",
"sql"
] | [
{
"role": "user",
"content": "You are given a list of `n` tasks, each represented as a tuple `(start, end)`, indicating the start and end times of the task. The tasks are sorted by their start times. Your goal is to determine the maximum number of non-overlapping tasks that can be selected. Two tasks are co... | 0.0715 | 2.026 | [
-0.01216888427734375,
0.01461029052734375,
0.0020389556884765625,
0.033660888671875,
0.0242767333984375,
-0.049285888671875,
0.0213165283203125,
0.00711822509765625,
-0.0283203125,
-0.094970703125,
0.0364990234375,
-0.04339599609375,
0.067626953125,
-0.0335693359375,
0.00376129150390625,... | true |
nexus-sft-9f80d1bb8a67485d | code | general | easy | nvidia/OpenCodeInstruct | bb50ad7bafcd795247a70ecbd7b93512 | CC-BY-4.0 | en | 2 | 1,024 | false | [
"python",
"sql"
] | [
{
"role": "user",
"content": "You are given a string `expression` consisting of characters including parentheses `()`, square brackets `[]`, and curly braces `{}`. Your task is to determine if the brackets in the expression are balanced. A string with balanced brackets means that each opening bracket has a ... | 0.0953 | 2.621 | [
-0.002201080322265625,
-0.0115814208984375,
-0.0095062255859375,
0.0081634521484375,
-0.01517486572265625,
-0.0640869140625,
-0.0092926025390625,
0.033538818359375,
-0.0281982421875,
-0.08843994140625,
0.02081298828125,
0.00881195068359375,
0.058624267578125,
0.022003173828125,
0.0101470... | true |
nexus-sft-a68326b5d8384cdd | code | general | easy | nvidia/OpenCodeInstruct | 8d0437dda41d2a6e554810be6d598c4a | CC-BY-4.0 | en | 2 | 1,024 | false | [
"javascript",
"python"
] | [
{
"role": "user",
"content": "You are given a string `text` consisting of lowercase letters and spaces. Your task is to implement a function `count_words` that returns a dictionary with the frequency of each word in the string, excluding common stop words: 'the', 'and', 'a', 'an', 'in', 'on', 'at', 'by', 'f... | 0.0684 | 1.949 | [
0.0014505386352539062,
0.004291534423828125,
0.004062652587890625,
-0.00411224365234375,
0.0131378173828125,
-0.03167724609375,
0.007904052734375,
0.0283050537109375,
-0.0104522705078125,
-0.07904052734375,
0.0394287109375,
-0.06805419921875,
0.032562255859375,
0.03350830078125,
-0.01980... | true |
nexus-sft-b5c472fa64154c69 | code | general | easy | nvidia/OpenCodeInstruct | f130bdca2b8134c4fabb4e8dd5e3becc | CC-BY-4.0 | en | 2 | 1,024 | false | [
"javascript",
"python",
"sql"
] | [
{
"role": "user",
"content": "You are given a nested list structure containing integers and other nested lists. Your task is to write a recursive function named `flatten_list` that takes this nested list as input and returns a new list with all the integers in a flat structure. The order of elements in the ... | 0.0675 | 1.927 | [
-0.01360321044921875,
-0.0206451416015625,
0.0088653564453125,
0.004749298095703125,
-0.0011501312255859375,
-0.04150390625,
-0.0238800048828125,
0.053466796875,
-0.033538818359375,
-0.08380126953125,
0.034637451171875,
-0.0305023193359375,
0.03790283203125,
-0.01288604736328125,
0.01734... | true |
nexus-sft-864b86e5053242c6 | code | general | easy | nvidia/OpenCodeInstruct | a5af5b8267c4fb797b4f9cdf2bf7fe04 | CC-BY-4.0 | en | 2 | 1,024 | false | [
"javascript",
"python",
"sql"
] | [
{
"role": "user",
"content": "You are given a list of integers `numbers`. Your task is to implement a function `find_mode` that determines the mode of the list, which is the element that appears most frequently. In the event of a tie, where multiple elements share the highest frequency, return the smallest ... | 0.0767 | 2.156 | [
0.005176544189453125,
-0.0028667449951171875,
-0.0051116943359375,
0.0156097412109375,
0.0250091552734375,
-0.0295867919921875,
-0.006168365478515625,
0.048065185546875,
-0.037078857421875,
-0.087158203125,
0.03326416015625,
-0.05389404296875,
0.039520263671875,
0.0019178390502929688,
0.... | true |
nexus-sft-6227166f9b0c4c20 | code | general | easy | nvidia/OpenCodeInstruct | e7ca4436b5c004b2c07534b50b1e4c83 | CC-BY-4.0 | en | 2 | 1,024 | false | [
"javascript",
"python"
] | [
{
"role": "user",
"content": "You are tasked with implementing a function named `factorial` that calculates the factorial of a non-negative integer `n`. The factorial of a non-negative integer `n` is the product of all positive integers less than or equal to `n`. By definition, the factorial of 0 is 1. Your... | 0.0701 | 1.992 | [
-0.01322174072265625,
-0.0469970703125,
-0.0010089874267578125,
0.0270538330078125,
-0.004383087158203125,
-0.01137542724609375,
0.00968170166015625,
0.039947509765625,
-0.052093505859375,
-0.0799560546875,
0.0635986328125,
-0.036590576171875,
0.032623291015625,
0.0426025390625,
0.012107... | true |
nexus-sft-ea323243e8a24fd0 | code | general | medium | nvidia/OpenCodeInstruct | 036b336a0426080e8abbfd30efbd9937 | CC-BY-4.0 | en | 2 | 1,024 | false | [
"python",
"sql"
] | [
{
"role": "user",
"content": "You are tasked with implementing a `BankAccount` class in Python that simulates basic bank account operations. The class should support the following functionalities:\n\n- **Initialization**: The account balance should start at zero.\n- **Deposit**: Add a specified amount to th... | 0.1192 | 3.238 | [
-0.0210723876953125,
-0.006244659423828125,
0.01123809814453125,
0.0240631103515625,
0.0162353515625,
-0.0096282958984375,
0.00830078125,
0.01131439208984375,
-0.046630859375,
-0.10272216796875,
0.0640869140625,
-0.033172607421875,
0.0261077880859375,
-0.0020580291748046875,
0.0260009765... | true |
nexus-sft-f3171f1a6c84438a | code | general | easy | nvidia/OpenCodeInstruct | 5d5954895418a80191cee671a990eea5 | CC-BY-4.0 | en | 2 | 1,024 | false | [
"javascript",
"python",
"sql"
] | [
{
"role": "user",
"content": "You are given a string `text` and a list of integers `positions`. Your task is to implement a function `remove_chars_at_positions` that removes characters from `text` at the indices specified in `positions`. The function should return the modified string. Assume that all positi... | 0.0747 | 2.106 | [
0.0176544189453125,
-0.0374755859375,
0.0244598388671875,
0.028533935546875,
0.01265716552734375,
-0.028472900390625,
0.01105499267578125,
0.050323486328125,
-0.002719879150390625,
-0.08148193359375,
0.00873565673828125,
-0.020904541015625,
0.050811767578125,
0.01910400390625,
-0.0037155... | true |
nexus-sft-1bf3ee29c5dd4322 | code | general | easy | nvidia/OpenCodeInstruct | d68222fe95725f75ccfd2848c0e0b65e | CC-BY-4.0 | en | 2 | 1,024 | false | [
"javascript",
"python",
"sql"
] | [
{
"role": "user",
"content": "You are tasked with implementing a function `generate_report` that processes a list of sales data. Each sale is represented as a dictionary with keys `product`, `quantity`, and `price`. Your function should compute and return a string summarizing the total quantity sold and the... | 0.0957 | 2.63 | [
-0.023162841796875,
-0.007198333740234375,
0.00109100341796875,
0.01296234130859375,
0.0238037109375,
-0.0029621124267578125,
0.0802001953125,
0.006221771240234375,
-0.0185089111328125,
-0.1297607421875,
-0.017852783203125,
-0.049163818359375,
0.036285400390625,
-0.00878143310546875,
0.0... | true |
nexus-sft-7fa1787fa99f413f | code | general | easy | nvidia/OpenCodeInstruct | 02a46544965ba9c5e362bc16f41a8f0b | CC-BY-4.0 | en | 2 | 1,024 | false | [
"javascript",
"python",
"sql"
] | [
{
"role": "user",
"content": "You are given two sorted lists of integers, `list1` and `list2`. Your task is to merge these two lists into a single sorted list. You must not use any built-in sorting functions or similar utilities. \n\n**Input:**\n- Two sorted lists of integers, `list1` and `list2`.\n\n**Outp... | 0.0548 | 1.616 | [
-0.00211334228515625,
-0.0022830963134765625,
0.0013799667358398438,
0.0271453857421875,
0.006580352783203125,
-0.02984619140625,
-0.003887176513671875,
0.04437255859375,
-0.0284576416015625,
-0.068603515625,
0.022186279296875,
-0.0604248046875,
0.044464111328125,
-0.01445770263671875,
0... | true |
nexus-sft-c3975961a12846b5 | code | general | easy | nvidia/OpenCodeInstruct | 1154e0f34a735b07c3e3685d8b7ae497 | CC-BY-4.0 | en | 2 | 934 | false | [
"python",
"sql"
] | [
{
"role": "user",
"content": "You are given a string `s` consisting of lowercase English letters. Your task is to generate all unique permutations of the string `s`. The permutations should be returned as a sorted list of strings.\n\n**Input:**\n- A single string `s` (1 ≤ |s| ≤ 8).\n\n**Output:**\n- A sorte... | 0.0695 | 1.978 | [
0.00661468505859375,
-0.0254974365234375,
-0.0251617431640625,
0.01090240478515625,
0.01153564453125,
-0.05169677734375,
-0.01898193359375,
0.038787841796875,
-0.03558349609375,
-0.0953369140625,
0.03265380859375,
-0.040771484375,
0.0301361083984375,
0.015411376953125,
-0.025741577148437... | true |
nexus-sft-ae6b78ff580c4ec4 | code | general | easy | nvidia/OpenCodeInstruct | c4502018d0a1cfc4c223b32de24f46ec | CC-BY-4.0 | en | 2 | 805 | false | [
"javascript",
"python"
] | [
{
"role": "user",
"content": "You are given a list of integers. Your task is to write a Python function that returns the second largest unique integer in the list. If the list contains fewer than two unique integers, the function should return `None`.\n\n**Sample Input:**\n```\n[1, 2, 3, 4, 5]\n```\n\n**Sam... | 0.0579 | 1.692 | [
-0.005451202392578125,
-0.005054473876953125,
0.0015716552734375,
0.028961181640625,
0.029876708984375,
0.0007104873657226562,
-0.01849365234375,
0.031829833984375,
-0.04266357421875,
-0.07818603515625,
0.08258056640625,
-0.045196533203125,
0.0014829635620117188,
0.0220794677734375,
-0.0... | true |
End of preview. Expand in Data Studio
NEXUS SFT Mix
Dataset SFT optimise pour NEXUS (234M params, programming + trading + conversation).
Format NEXUS v1
Chaque sample suit ce schema (compatible TRL/Axolotl/Unsloth via , enrichi avec curriculum metadata):
Sources
Mix combine ~4M samples de sources publiques curees:
- Code (50%): nvidia/OpenCodeInstruct, Magicoder-OSS/Evol, Ling-Coder-SFT, rStar-Coder, Code-290k-ShareGPT
- Code Reasoning (15%): Nemotron-Competitive-Programming-v2, open-r1/codeforces
- Finance/Trading (10%): gbharti/finance-alpaca, FinGPT, AlphaFin, virattt/financial-qa
- Conversation (20%): WildChat-4.8M, lmsys-chat-1m, ShareGPT_Vicuna
- General Instruction (5%): mlabonne/open-perfectblend
Curation Pipeline
NEXUS (pretrain step_423500) joue le role de curator auto:
- Perplexity scoring -> garde samples qui apprennent au modele
- Embeddings natifs -> dedup semantique cross-source
- Decontamination -> check vs HumanEval/MBPP/MATH/GSM8K
- Domain classification -> confirme tags via logits internes
License
Mix dataset = CC-BY-4.0. Chaque sample garde sa license source dans .
Status
Generation en cours via pipeline streaming HF.
- Downloads last month
- 19