truthCoder2:


JavaScript
function consecutiveNumbers(numbers) {
const ranges = [];

let start = numbers[0];
let end = numbers[0];

for (let i = 1; i < numbers.length; i++) {
if (numbers[i] === end + 1) {

end = numbers[i];
} else {

ranges.push(start === end ? start.toString() : `${start}->${end}`);


start = numbers[i];
end = numbers[i];
}
}


ranges.push(start === end ? start.toString() : `${start}->${end}`);

return ranges;
}

Can u xplain the question for me?

LikeAking:
You won't find @greatigboman contributing to stuffs like this..

Wish u guys d best...

I can't solve any algo question wey no make sense.

Calculate the length n breath of a mosquito.

Lolz.

Yet to see your contribution.

GREATIGBOMAN:


Yet to see your contribution.

Dey wait.

namikaze:
found this interesting problem;

Given a sorted list of numbers, return a list of strings that
represent all of the consecutive numbers.
Example:
Input: [0, 1, 2, 5, 7, 8, 9, 9, 10, 11, 15]
Output: ['0->2', '5->5', '7->11', '15->15']
Assume that all numbers will be greater than or equal to 0, and
each element can repeat.

let's see what you guys come up with

Let me try.

namikaze:
found this interesting problem;

Given a sorted list of numbers, return a list of strings that
represent all of the consecutive numbers.
Example:
Input: [0, 1, 2, 5, 7, 8, 9, 9, 10, 11, 15]
Output: ['0->2', '5->5', '7->11', '15->15']
Assume that all numbers will be greater than or equal to 0, and
each element can repeat.

let's see what you guys come up with

function consecNumbers(input) {
var output = [];

var str = "";
for (var i = 0; i < input.length; i++) {
if (input[i] - input[i + 1] === -1 || input[i] - input[i + 1] === 0) {
str = str + input[i];
} else {
str = `${str.charAt(0) + "->" + input[i]}`;
if (str.substring(0, 2) === "->" ) {
output.push(`${input[i]}->${input[i]}`);
} else {
output.push(str);
}
str = "";
}
}
console.log(output);
return output;
}
consecNumbers([0, 1, 2, 5, 7, 8, 9, 9, 9, 9, 10, 11, 15]);

https://www.jdoodle.com/a/5Hm0

truthCoder2:


JavaScript
function consecutiveNumbers(numbers) {
const ranges = [];

let start = numbers[0];
let end = numbers[0];

for (let i = 1; i < numbers.length; i++) {
if (numbers[i] === end + 1) {

end = numbers[i];
} else {

ranges.push(start === end ? start.toString() : `${start}->${end}`);


start = numbers[i];
end = numbers[i];
}
}


ranges.push(start === end ? start.toString() : `${start}->${end}`);

return ranges;
}

wrong as usual.
Your Gf ChatGpt have failed u once again

namikaze:
found this interesting problem;

Given a sorted list of numbers, return a list of strings that
represent all of the consecutive numbers.
Example:
Input: [0, 1, 2, 5, 7, 8, 9, 9, 10, 11, 15]
Output: ['0->2', '5->5', '7->11', '15->15']
Assume that all numbers will be greater than or equal to 0, and
each element can repeat.

let's see what you guys come up with

function consecNumbers(input) {
var output = [];

//////// With comments.

var str = "";
//Empty string to join values that pass a specific test

for (var i = 0; i < input.length; i++) {

// Looping the sorted array.

if (input[i] - input[i + 1] === -1 || input[i] - input[i + 1] === 0) {

//Since the array is already sorted, if the current value in the loop minus the next
//value ===-1 then we know we've gotten a consecutive match
//If the current value minus the next value ===0 then we know they are identical (Also works for negaTive numbers)

str = str + input[i];

// If the first test passes join the string the values

} else {

//Else now we know we've reached the break point were our first test is no longer true
//that is, current value - next !=== -1 or 0

str = `${str.charAt(0) + "->" + input[i]}`;

// since we've stored the first test in varibale "str"
// per the question, we need only the start to the end of each consecutive number
//so we grab the first consec number we saved in the first test and add it to the break point

if (str.substring(0, 2) == "->" ) {

//But if the stored value doesn't have any consecutive sibling, we know the first 2 elements in the string will be "->" as per what is use as an arrow or whatever in the question.

output.push(`${input[i]}->${input[i]}`);

// We just grab that single runaway element and make it mattch the flow of the question, then push it into the output array

} else {


output.push(str);

// else we know it has consecutive siblings also push it to the output array.

}
str = "";

//Now we reset our "str variable for the next round of test"

}
}
console.log(output);
return output;

//return || print
}
consecNumbers([0, 1, 2, 5, 7, 8, 9, 9, 9, 9, 10, 11, 15]);

namikaze:
let's all try this:

You are given a stream of numbers. Compute the median for
each new element .
Eg. Given [2, 1, 4, 7, 2, 0, 5], the algorithm should output [2, 1.5,
2, 3.0, 2, 2, 2]
Here's a starting point:

def running_median(stream):
  # Fill this in.
running_median([2, 1, 4, 7, 2, 0, 5])
# 2 1.5 2 3.0 2 2.0 2

remember, your solution could be in any language and should be from an online code editor like replit/onecompiler.

You never mentioned this should be a sorted array

GREATIGBOMAN:
https://www.jdoodle.com/a/5Hm0

nice

GREATIGBOMAN:

You never mentioned this should be a sorted array

no it's not sorted

GREATIGBOMAN:


wrong as usual.
Your Gf ChatGpt have failed u once again

Very dumb of you to say my response was wrong.

The only omission i made was not formatting the string to repeat if start === end.

You still dey get mouth in this arena?

You should be thanking your stars that the mods saved your tiny html ass.

LOL.

truthCoder:


Very dumb of you to say my response was wrong.

The only omission i made was not formatting the string to repeat if start === end.

You still dey get mouth in this arena?

You should be thanking your stars that the mods saved your tiny html ass.

LOL.

Small small u go get sense.

GREATIGBOMAN:


Small small u go get sense.

says the empty nothing who needs to call himself great.

How far? You finally converted your infected site to a honeypot abi? You want to harvest people's LinkedIn details?

No one really visits your site before.

You for put the site online back make i try the other vulnerabilities i didnt discuss here.

Your LiteSpeed account is wasting o..

And oh...the mail scripts you are sending to my mails and your feeble attempts through your other monikers. .

Wannabe Programmer Oshi

truthCoder2:


says the empty nothing who needs to call himself great.

How far? You finally converted your infected site to a honeypot abi? You want to harvest people's LinkedIn details?

No one really visits your site before.

You for put the site online back make i try the other vulnerabilities i didnt discuss here.

Your LiteSpeed account is wasting o..

And oh...the mail scripts you are sending to my mails and your feeble attempts through your other monikers. .

Wannabe Programmer Oshi

The thing really pain you.
Little by little you'll be able to solve basic Algorithms without ChatGPT.


301 redirect is now rocket science to you.

GREATIGBOMAN:


The thing really pain you.
Little by little you'll be able to solve basic Algorithms without ChatGPT.


301 redirect is now rocket science to you.

Your complete website has now turned to a honeypot to harvest LinkedIn profiles and you call yourself a developer?

I didn’t need chatGPT to bring down your website with effects up till today.

Now you dont have a functioning website.

Oga programmer whose website has been down since Christmas.

You are so engulfed with hate that you turned your whole website into a redirect to your LinkedIn profile.

You are also so incompetent that you could not fix your vulnerabilities in over 2 weeks.

Yet you are as opinionated as a perfumed donkey.

truthCoder:


Your complete website has now turned to a honeypot to harvest LinkedIn profiles and you call yourself a developer?

I didn’t need chatGPT to bring down your website with effects up till today.

Now you dont have a functioning website.

Oga programmer whose website has been down since Christmas.

You are so engulfed with hate that you turned your whole website into a redirect to your LinkedIn profile.

You are also so incompetent that you could not fix your vulnerabilities in over 2 weeks.

Yet you are as opinionated as a perfumed donkey.

Na me get website.

Na me use my hand redirect my website to my LinkedIn profile.

Yet you're wailing up and down

You that have a functioning portfolio site can we see it?

GREATIGBOMAN:


Na me get website.

Na me use my hand redirect my website to my LinkedIn profile.

Yet you're wailing up and down

You that have a functioning portfolio site can we see it?

LOL.

I have a functional portfolio.

You have tried all the skills in your skull to get an access but nah. Not for you. You even used your little yahoo yahoo email scripts on my disposable emails but nah. You are too micro.

I know one of these days, i will have you at the other side of the table where you would be explaining how good you are with react. LOL

As I always tell you, dont rush.

truthCoder:


LOL.

I have a functional portfolio.

You have tried all the skills in your skull to get an access but nah. Not for you. You even used your little yahoo yahoo email scripts on my disposable emails but nah. You are too micro.

I know one of these days, i will have you at the other side of the table where you would be explaining how good you are with react. LOL

As I always tell you, dont rush.

You have been heard.

Shift...

GREATIGBOMAN:


You have been heard.

Shift...

Redacted

truthCoder:


Anytime you apply for any role this year, ask yourself this simple question?

Who is going to review my application?

You never know. You just never know.

I own you Andrew.

Take your own advice.

No one is bigger than a rejection in any Job application.

When you're done you can go back to stalking my portfolio website.... We know things are hard these days and Jobs are hard to come by.

With enough pleading I may remove the redirect so you can masturbate on the website once again.

This thread is so inspiring
Imagine what it could have been if nairaland was open to new features, we could have a code writing feature where people can write code live while on the site.......especially those guys that are always battling for superiority on this section

namikaze:
let's all try this:

You are given a stream of numbers. Compute the median for
each new element .
Eg. Given [2, 1, 4, 7, 2, 0, 5], the algorithm should output [2, 1.5,
2, 3.0, 2, 2, 2]
Here's a starting point:

def running_median(stream):
  # Fill this in.
running_median([2, 1, 4, 7, 2, 0, 5])
# 2 1.5 2 3.0 2 2.0 2

remember, your solution could be in any language and should be from an online code editor like replit/onecompiler.

import sys
import math

class Node:
def __init__(self, value, color, left=None, right=None, parent=None):
self.value = value
self.color = color
self.left = left
self.right = right
self.parent = parent

class RedBlackTree:
def __init__(self):
self.root = None

def insert(self, value):
new_node = Node(value, "RED"
self.insert_node(new_node)

def insert_node(self, new_node):
if self.root is None:
# the tree is empty, the new node is the root
self.root = new_node
else:
current_node = self.root
while True:
if new_node.value < current_node.value:
# the new node goes in the left subtree
if current_node.left is None:
# the current node has no left child, the new node becomes its left child
current_node.left = new_node
new_node.parent = current_node
self.rebalance(new_node)
break
else:
# the current node has a left child, we continue the search in the left subtree
current_node = current_node.left
else:
# the new node goes in the right subtree
if current_node.right is None:
# the current node has no right child, the new node becomes its right child
current_node.right = new_node
new_node.parent = current_node
self.rebalance(new_node)
break
else:
# the current node has a right child, we continue the search in the right subtree
current_node = current_node.right

def find_node(self, value):
current_node = self.root
while current_node is not None:
if value == current_node.value:
# we found the node, return it
return current_node
elif value < current_node.value:
# the value we are looking for is in the left subtree
current_node = current_node.left
else:
# the value we are looking for is in the right subtree
current_node = current_node.right
# we didn't find the node, return None
return None

def count(self, node):
if node is None:
return 0
else:
return 1 + self.count(node.left) + self.count(node.right)

def find_median(self):
# get the total number of nodes in the tree
total_count = self.count(self.root)
HENCE I USED chatGPT

engrAAS:


import sys
import math

class Node:
def __init__(self, value, color, left=None, right=None, parent=None):
self.value = value
self.color = color
self.left = left
self.right = right
self.parent = parent

class RedBlackTree:
def __init__(self):
self.root = None

def insert(self, value):
new_node = Node(value, "RED"
self.insert_node(new_node)

def insert_node(self, new_node):
if self.root is None:
# the tree is empty, the new node is the root
self.root = new_node
else:
current_node = self.root
while True:
if new_node.value < current_node.value:
# the new node goes in the left subtree
if current_node.left is None:
# the current node has no left child, the new node becomes its left child
current_node.left = new_node
new_node.parent = current_node
self.rebalance(new_node)
break
else:
# the current node has a left child, we continue the search in the left subtree
current_node = current_node.left
else:
# the new node goes in the right subtree
if current_node.right is None:
# the current node has no right child, the new node becomes its right child
current_node.right = new_node
new_node.parent = current_node
self.rebalance(new_node)
break
else:
# the current node has a right child, we continue the search in the right subtree
current_node = current_node.right

def find_node(self, value):
current_node = self.root
while current_node is not None:
if value == current_node.value:
# we found the node, return it
return current_node
elif value < current_node.value:
# the value we are looking for is in the left subtree
current_node = current_node.left
else:
# the value we are looking for is in the right subtree
current_node = current_node.right
# we didn't find the node, return None
return None

def count(self, node):
if node is None:
return 0
else:
return 1 + self.count(node.left) + self.count(node.right)

def find_median(self):
# get the total number of nodes in the tree
total_count = self.count(self.root)
HENCE I USED chatGPT

Using ChatGpt is just annoying.
You can use it to get insights or how to solve the problem perhaps... But not to solve the entire thing for you and you just copy and paste it.

What did you learn now?

GREATIGBOMAN:

Take your own advice.

No one is bigger than a rejection in any Job application.

When you're done you can go back to stalking my portfolio website.... We know things are hard these days and Jobs are hard to come by.

With enough pleading I may remove the redirect so you can masturbate on the website once again.

You had a rethink overnight and edited this post abi?

Christmas is over.

I am back to normal grind. I wont mind using you to relax once in a while. ..you know, the occasional shafting.

You can put your website back. Dont be afraid, i dont bite deep.

You should be proud, i am your one and only traffic.

Jokes aside, dont take down your site because you were washed with bleach. There were learning points and it should have made you a better programmer.

Put it up and I would let you know privately (through one of your numerous emails that i now have) any issue i notice.

Cheers sleekcode greatigboman and the two other monikers you have used in contacting me.

GREATIGBOMAN:


Using ChatGpt is just annoying.
You can use it to get insights or how to solve the problem perhaps... But not to solve the entire thing for you and you just copy and paste it.

What did you learn now?

Using chatGPT assists in learning. Don’t fight existing realities.

Not everyone has the luxury of time to learn every bit of a process.

At least, the person was forthright and declared where the solution came from.

If you are not comfortable with his option, then you present yours or move on to other things.

You sound like someone from the 80s saying ‘dont use a calculator’

truthCoder:


Using chatGPT assists in learning. Don’t fight existing realities.

Not everyone has the luxury of time to learn every bit of a process.

At least, the person was forthright and declared where the solution came from.

If you are not comfortable with his option, then you present yours or move on to other things.

You sound like someone from the 80s saying ‘dont use a calculator’

I said it can be used to get insights on how to solve a problem. Which is exactly what it was meant to do... Assist humans in solving problems by providing elucidated context.

Pasting problems there and copying the solutions verbatim only shows how lazy you are and doesn't improve your learning in anyway.

No point explaining these things to you sha... You're so hooked to this ChatGpt because that's the only way you can provide any correct solution to anything.

engrAAS:


import sys
import math

class Node:
def __init__(self, value, color, left=None, right=None, parent=None):
self.value = value
self.color = color
self.left = left
self.right = right
self.parent = parent

class RedBlackTree:
def __init__(self):
self.root = None

def insert(self, value):
new_node = Node(value, "RED"
self.insert_node(new_node)

def insert_node(self, new_node):
if self.root is None:
# the tree is empty, the new node is the root
self.root = new_node
else:
current_node = self.root
while True:
if new_node.value < current_node.value:
# the new node goes in the left subtree
if current_node.left is None:
# the current node has no left child, the new node becomes its left child
current_node.left = new_node
new_node.parent = current_node
self.rebalance(new_node)
break
else:
# the current node has a left child, we continue the search in the left subtree
current_node = current_node.left
else:
# the new node goes in the right subtree
if current_node.right is None:
# the current node has no right child, the new node becomes its right child
current_node.right = new_node
new_node.parent = current_node
self.rebalance(new_node)
break
else:
# the current node has a right child, we continue the search in the right subtree
current_node = current_node.right

def find_node(self, value):
current_node = self.root
while current_node is not None:
if value == current_node.value:
# we found the node, return it
return current_node
elif value < current_node.value:
# the value we are looking for is in the left subtree
current_node = current_node.left
else:
# the value we are looking for is in the right subtree
current_node = current_node.right
# we didn't find the node, return None
return None

def count(self, node):
if node is None:
return 0
else:
return 1 + self.count(node.left) + self.count(node.right)

def find_median(self):
# get the total number of nodes in the tree
total_count = self.count(self.root)
HENCE I USED chatGPT

wrong answer, solved a completely different problem (it implemented a red black tree, which I'm guessing is still buggy).
I've tried chatGPT before, it always gives wrong solutions except for the most basic and generic problems, you'd be better of solving a problem from scratch than debugging it's solutions.

truthCoder:


You had a rethink overnight and edited this post abi?

Christmas is over.

I am back to normal grind. I wont mind using you to relax once in a while. ..you know, the occasional shafting.

You can put your website back. Dont be afraid, i dont bite deep.

You should be proud, i am your one and only traffic.

Jokes aside, dont take down your site because you were washed with bleach. There were learning points and it should have made you a better programmer.

Put it up and I would let you know privately (through one of your numerous emails that i now have) any issue i notice.

Cheers sleekcode greatigboman and the two other monikers you have used in contacting me.

You need help!

You're so addicted to this my website Mr Stalker

I've gotten more than 10,000 visits from your smelling IP alone.

Are you that jobless?

I thought you specialized in selling 10 years old laptops as side hustle....? Why not use that one to hold body before your normal 5k-10k projects comes around.


Don't worry yourself sha... Before you choke in your addiction and die from not seeing my wonderful website online.


I'll soon bring in back live so you may practice your kindergarten Pen-testing skills and baby hacks.

namikaze:
let's all try this:

You are given a stream of numbers. Compute the median for
each new element .
Eg. Given [2, 1, 4, 7, 2, 0, 5], the algorithm should output [2, 1.5,
2, 3.0, 2, 2, 2]
Here's a starting point:

def running_median(stream):
  # Fill this in.
running_median([2, 1, 4, 7, 2, 0, 5])
# 2 1.5 2 3.0 2 2.0 2

remember, your solution could be in any language and should be from an online code editor like replit/onecompiler.

Javascript.

function medianStreams() {
var input = [2, 1, 4, 7, 2, 0, 5];
var joiner = [];
var output = [];
for (let num of input) {
joiner.push(num);
if (joiner.length === 1) {
output.push(joiner[0]);
} else {
if (joiner.length % 2 === 0) {
let evenMiddle = joiner.sort().length / 2;
let average = joiner[evenMiddle] + joiner[evenMiddle - 1];
output.push(average/2);
} else {
let oddMiddle = joiner.sort().length - 1;
output.push(joiner[oddMiddle / 2]);
}
}
}
console.log(output);
return output;
}
medianStreams();

https://www.jdoodle.com/ia/BWD

namikaze:

wrong answer, solved a completely different problem (it implemented a red black tree, which I'm guessing is still buggy).
I've tried chatGPT before, it always gives wrong solutions except for the most basic and generic problems, you'd be better of solving a problem from scratch than debugging it's solutions.

Noted, thanks for the correction

GREATIGBOMAN:

Javascript.
function medianStreams() { var input = [2, 1, 4, 7, 2, 0, 5]; var joiner = []; var output = []; for (let num of input) { joiner.push(num); if (joiner.length === 1) { output.push(joiner[0]); } else { if (joiner.length % 2 === 0) { let evenMiddle = joiner.sort().length / 2; let average = joiner[evenMiddle] + joiner[evenMiddle - 1]; output.push(average/2); } else { let oddMiddle = joiner.sort().length - 1; output.push(joiner[oddMiddle / 2]); } } } console.log(output); return output; } medianStreams();
https://www.jdoodle.com/ia/BWD

fails some test cases, for example, arr = [2,6,10,1,0]; correct answer should be [2,4,6,4,2], yours:

namikaze:

fails some test cases, for example,
arr = [2,6,10,1,0];
correct answer should be [2,4,6,4,2], yours:

Ok