qtguru:


Dude that is some sick text based ui, what is window manager is this ? na pcguru1

cixak95211:
Question:

1. Design an algorithm(s) for the following array operations: "push, pop, shift, unshift" using object oriented programming practices.
2. Design an algorithm that will find the longest common subsequence between two arrays, plus the time complexity for your solution.

Deicide:
.

Donpre:

I am unable to read C++, could you explain your solution

Deicide:
Lol, what language can you read then?

Well first of all I have to say that the main solution is suppose to run in O(N) time but because of the extra input I have to deal with that is the while(n--) it makes it O(N²)

Now for the inner loop it's simple let's say you have the number 1234 if you find the modular of that number using 10 that is 1234 mod 10 you would get 4. After that you divide 1234 by 10 again then you get 123 and then you find the mod, this process goes on in a loop till that inner condition in the loop is met while(n >=1).

cixak95211:
Question:

1. Design an algorithm(s) for the following array operations: "push, pop, shift, unshift" using object oriented programming practices.
2. Design an algorithm that will find the longest common subsequence between two arrays, plus the time complexity for your solution.

qtguru:


I'll share soon

https://www.linkedin.com/groups/8873861

cbrass:


Thanks bro , it has been awhile. never knew you changed your moniker. There a lot of old-time-coders i don't see here anymore. i hope they are all doing fine sha

qtguru:


Yeah qtguru is my name on twitter so this was an opportunity to delete that moniker and focus on tech mostly. We are still here do you do Node because there is a project on ground.

Karleb:


For question 1, are slice and splice functions allowed?

cixak95211:


Nope

Donpre:


I get this part.

But does your solution solve the scenario where the first digit to be inversed is '0'?

e.g 09787 becomes 78790

cixak95211:
Question:

1. Design an algorithm(s) for the following array operations: "push, pop, shift, unshift" using object oriented programming practices.
2. Design an algorithm that will find the longest common subsequence between two arrays, plus the time complexity for your solution.

Deicide:
That's not a number in any programming language I know of.....numbers don't start with zero....if you think am lying create a variable and assign it 09787 and see if it'll compile

Jummate:


For number 1

Phelumie300:

well this is my entry.
As for the time complexity

Jummate:


For number 1

Karleb:



Look at how sexy Java is.

cbrass:
Write a function Priority Queue that priotizies node target
eg

function prioritize_nodes($tree, $target_val) {
}

Hint: The target node will move up even if is in a child node.

Karleb:


Hey man, I love your input but when you make an array item null, or undefined or you delete it using the delete keyword it does not remove the item.

If you print out the array, you'd still see undefined/null in the array and the array length is still will still include the missing values.

Trying printing out the array to understand what I'm talking about.

Karleb:


Hey man, I love your input but when you make an array item null, or undefined or you delete it using the delete keyword it does not remove the item.

If you print out the array, you'd still see undefined/null in the array and the array length is still will still include the missing values.

Trying printing out the array to understand what I'm talking about.

cixak95211:


Very nice.
The push method will always return the new length . . so there is no need put it inside in a branch
thus causing you to have multiple return statements which do exactly the same thing. You could do your conditionals
and then return the increased length at the end of the ops.

Plus it's perfectly okay to have [undefined, 3, undefined] in an array, exactly as Karleb as pointed out. Doesn't make the array house 1 item as you might have thought but rather 3.

I would use your codes anyday anytime. It's clean.

Jummate:


Sorry for quoting you twice bro, I wish I knew how I could upload images stacked on each other here.


Here is the second image:

Phelumie300:


well this is my entry.

As for the time complexity

Jummate:


Sorry for quoting you twice bro, I wish I knew how I could upload images stacked on each other here.


Here is the second image:

cixak95211:


1 2 3 4 images

lahp:


i like wat u did with for loop the conditons are perfect

have u tried how much time it will take

Karleb:
Question. Write a function that determines if a word is a palindrome.

Hint: Palindromes are words that has same spelling backward and forward.

E.g madam, racecar.

cixak95211:
Question:

1. Design an algorithm(s) for the following array operations: "push, pop, shift, unshift" using object oriented programming practices.
2. Design an algorithm that will find the longest common subsequence between two arrays, plus the time complexity for your solution.

naijasensei:


Question 1 only:
1. Kotlin
2. Kotlin (continued)
3. Javascript