instruction_seed stringlengths 22 11.5k | source stringclasses 1
value | embeddings sequencelengths 1.02k 1.02k | mean_positive_score float64 0.72 0.86 | mean_negative_score float64 0.69 0.81 | difference_score float64 0.03 0.07 |
|---|---|---|---|---|---|
Write a function that takes in two lists of integers and returns a new list that contains only the common elements between the two input lists. The function should have a time complexity of O(n+m), where n and m are the lengths of the two input lists. The function should not use any additional data structures.
For exa... | sharegpt | [
0.029939798638224602,
0.02393188886344433,
-0.03869692236185074,
-0.05385199189186096,
0.03640586510300636,
-0.01367579959332943,
-0.018361905589699745,
0.070126973092556,
0.014816504903137684,
-0.02750447764992714,
0.015619687736034393,
0.01257637981325388,
0.007208924274891615,
-0.012801... | 0.823995 | 0.789602 | 0.034393 |
Write an algorithm that sorts the elements in an array from largest to smallest, but the algorithm must be implemented without using any built-in sort functions. [3, 9, 7, 5, 1, 8] | sharegpt | [
0.03484080731868744,
0.03242316469550133,
-0.026554500684142113,
-0.02865475043654442,
0.029921703040599823,
-0.024022821336984634,
-0.02021227590739727,
0.04649201035499573,
0.013226481154561043,
-0.03245508298277855,
0.017374783754348755,
0.026739630848169327,
-0.03849097341299057,
-0.02... | 0.822547 | 0.779392 | 0.043155 |
Construct a list that comprises the squared values of the initial ten odd integers in ascending order. | sharegpt | [
0.028165554627776146,
0.04900864511728287,
-0.006134116556495428,
-0.060407448559999466,
0.038762304931879044,
-0.024337038397789,
-0.0220484659075737,
0.043646398931741714,
0.03815273568034172,
-0.026839936152100563,
0.027128878980875015,
0.007249646354466677,
-0.07505029439926147,
-0.024... | 0.797249 | 0.74926 | 0.047989 |
Enhance the given Python code snippet for computing the greatest common divisor (GCD) of two integers 'a' and 'b', considering non-negative values and edge cases:
def greatest_common_divisor(a: int, b: int) -> int:
""" Return a greatest common divisor of two non-negative integers a and b
>>> greatest_common_di... | sharegpt | [
0.03635242581367493,
0.02575303241610527,
-0.022984184324741364,
-0.04409099370241165,
0.03892039135098457,
-0.02170000784099102,
-0.01791452430188656,
0.057561565190553665,
0.01891225203871727,
-0.02997099608182907,
0.0187826044857502,
0.020296849310398102,
-0.016346517950296402,
-0.00952... | 0.805401 | 0.778205 | 0.027196 |
Write a function to determine if two rectangles intersect. The rectangles are represented by their bottom-left coordinate, width, and height.
rect1 = (x1, y1, w1, h1)
rect2 = (x2, y2, w2, h2)
The function should return True if the rectangles intersect and False otherwise. The coordinates of the rectangles can be nega... | sharegpt | [
0.017643945291638374,
0.028550876304507256,
-0.018647722899913788,
-0.034868206828832626,
0.02299116924405098,
-0.011260228231549263,
-0.012916285544633865,
0.050967518240213394,
0.038136038929224014,
-0.011210409924387932,
0.020274188369512558,
0.02386857010424137,
-0.004622051492333412,
... | 0.792623 | 0.763942 | 0.02868 |
What is the most efficient algorithm to sort an array of numbers in descending order? | sharegpt | [
0.02266434207558632,
0.02150973491370678,
-0.029278485104441643,
-0.03648529201745987,
0.0268000066280365,
-0.020935676991939545,
-0.026967449113726616,
0.030464138835668564,
0.02781246043741703,
-0.028351670131087303,
0.014376523904502392,
0.019674640148878098,
-0.03831413760781288,
0.000... | 0.796727 | 0.762307 | 0.03442 |
Develop a program in Python for finding the longest common subsequence between two strings.
"ABCDF", "ABECD" | sharegpt | [
0.012207679450511932,
0.008590510115027428,
-0.03521210700273514,
-0.05614249035716057,
0.01886574737727642,
-0.022432828322052956,
-0.005592485424131155,
0.03140620142221451,
0.02950185164809227,
-0.033578112721443176,
0.01983427256345749,
0.015157151967287064,
-0.019784389063715935,
0.01... | 0.821974 | 0.792334 | 0.02964 |
Given a sequence of negative integers characterized as nonpositive, ascertain the least absolute quantity.
test_list = [-2, -5, -10, -15] | sharegpt | [
0.02226755954325199,
0.0197673998773098,
-0.016952654346823692,
-0.05910385400056839,
0.04835084453225136,
-0.02933495119214058,
-0.024088367819786072,
0.052721571177244186,
0.027798037976026535,
-0.020355118438601494,
0.0037722724955528975,
0.031900301575660706,
-0.022425945848226547,
-0.... | 0.818983 | 0.769393 | 0.04959 |
"Construct an algorithmic protocol that will effectively segregate an ordered list of decimal fracti(...TRUNCATED) | sharegpt | [0.020621106028556824,0.008117081597447395,-0.028227051720023155,-0.025369884446263313,0.03121898509(...TRUNCATED) | 0.820857 | 0.787073 | 0.033784 |
"Provided two numerical arrays recognized as \"a\" and \"b\", instead of simple numerical displaceme(...TRUNCATED) | sharegpt | [0.0018013621447607875,0.027666017413139343,-0.03682812675833702,-0.03073262795805931,0.044060081243(...TRUNCATED) | 0.808437 | 0.759926 | 0.048511 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 9