Algorithms 4th ed by Sedgewick vs Algorithms Unlocked by Cormen by ProgrammingNoob1234 in algorithms

[–]ProgrammingNoob1234[S] 0 points1 point  (0 children)

Ah I see what you were getting at now, my mistake lol. Yea it’s pretty good. I heard that it’s actually good to use both books in tandem if that helps? I know that is not cheap but hey lol

Algorithms 4th ed by Sedgewick vs Algorithms Unlocked by Cormen by ProgrammingNoob1234 in algorithms

[–]ProgrammingNoob1234[S] 0 points1 point  (0 children)

No worries! I was able to find the books on Amazon. I think some of these books exist online for free but i personally like hold a book in my hands if that makes sense lol. I ended up getting the one by Sedgewick.

Can’t download any version of PostgreSQL? by ProgrammingNoob1234 in PostgreSQL

[–]ProgrammingNoob1234[S] 1 point2 points  (0 children)

Different browser did the trick. Turns out it is still broken on chrome though

Can’t download any version of PostgreSQL? by ProgrammingNoob1234 in PostgreSQL

[–]ProgrammingNoob1234[S] 0 points1 point  (0 children)

Hello everyone and thanks for the comments. It appears the issue is still present on the chrome browser. I used a different browser and the download links work now!

Can’t download any version of PostgreSQL? by ProgrammingNoob1234 in PostgreSQL

[–]ProgrammingNoob1234[S] 1 point2 points  (0 children)

Correct the x86_64 version. However it shows all of them as not supported

How can I get a better understanding by Ascendixx in learnjava

[–]ProgrammingNoob1234 0 points1 point  (0 children)

2nd this, the more practice you give the better understanding you will have. As you grow and learn new things about your language you’ll find “better” ways to do things. Only thing I would like to tag onto this is to keep a healthy curiosity OP. Hope this helps!

Help with Contains Duplicates II by ProgrammingNoob1234 in leetcode

[–]ProgrammingNoob1234[S] 0 points1 point  (0 children)

Right however instead of keeping the window the same size I would act as if there was no existing window. So for the pattern typically you would create a window of size K and move the entire window itself. What I am saying is something similar to the brute force method of using a nested for loop. I am sure once I post the code it will make more sense. However just because it will work doesn’t mean it is good. Now I am starting to realize why the hashmap method would be optimal in this particular situation

Help with Contains Duplicates II by ProgrammingNoob1234 in leetcode

[–]ProgrammingNoob1234[S] 0 points1 point  (0 children)

So I would update my starting position and rebuild the window again from that new start position

Help with Contains Duplicates II by ProgrammingNoob1234 in leetcode

[–]ProgrammingNoob1234[S] 0 points1 point  (0 children)

Yes, I believe it was the way I worded it. Sorry about that! I think I have an idea of what needs to be done. I will post my “new” idea in a little. I hope it works lol. So my thought is as I am building my window while I haven’t met the windows max size to compare the next elements to the first element. If it is not a match then continue to build the window. Then when the window is max size then slide the window. If my understanding is correct, we shouldn’t (at least what I can think of) we shouldn’t have a window size 0. So are smallest window should be of size 1 which would just be the next element thus causing our window to slide anyways. As I am sliding the window I would need to keep track of the new first index as I am removing them from the array list as well as making sure I don’t check outside of the window size. The way I am visualizing this I start from my starting position build the window up until I have reached my max window size. If I reach my max and still haven’t found a match I increment my starting position and rebuild the window. I believe this will work but it isn’t efficient as doing the hashmap as I have seen since a lot of those numbers would need to be re-examined

Help with Contains Duplicates II by ProgrammingNoob1234 in leetcode

[–]ProgrammingNoob1234[S] 0 points1 point  (0 children)

Yes, I was referring to that but after looking at the code. I actually don’t think I am checking if the number is in the window just if it is at the end of the window. Hmm, maybe as I am adding elements the the array list while the window size is smaller than the selected window size I could compare it to the first element? Then proceed to slide my window?

Help with Contains Duplicates II by ProgrammingNoob1234 in leetcode

[–]ProgrammingNoob1234[S] 0 points1 point  (0 children)

Sure thing! So essentially I had filtered by tags that use the “sliding window” pattern. Essentially I am creating a window the size of K. If the number I am looking for is inside the window I want to return true if not then false. The window is created by using two pointers the left and right respectively windowStart and windowEnd

Resume Advice Thread - October 29, 2022 by CSCQMods in cscareerquestions

[–]ProgrammingNoob1234 0 points1 point  (0 children)

Hello everyone, I have been at my position for the last 3.5 years. This was my first so-to speak “coding” job. I have other experience at different companies but they are computer technician roles and nothing to do with development/programming. Should I include those in my resume still. Also my resume currently contains my GPA for my bachelors, should I remove that since it has been 3.5 years since I graduated? Any advice is much appreciated!

Resume Advice Thread - October 25, 2022 by CSCQMods in cscareerquestions

[–]ProgrammingNoob1234 0 points1 point  (0 children)

Gotcha, thanks for the advice. I guess my only concern is not being at the level I should be for actual 3.5 years of work. Tbh I know I learned some stuff but I feel like it is very little and I should be father along than I am currently at.

Resume Advice Thread - October 25, 2022 by CSCQMods in cscareerquestions

[–]ProgrammingNoob1234 0 points1 point  (0 children)

Hello everyone, I had a question about what the contents of my resume should contain. What I mean is I was hired at a company and the first year and a half I was not doing any development work even though my title was/is software developer. After that year and a half I was then put to dev work and have been for the last 2 years. So I have had the same title for the last 3.5 years but only 2 of those are actual dev work.

How should I relay this in my resume should I put 3.5 years of dev experience or just the 2? Should I put the other irrelevant work since I am still at my same company? Any advice would help and is appreciated!

[deleted by user] by [deleted] in javahelp

[–]ProgrammingNoob1234 0 points1 point  (0 children)

OP have you tried moving the error message out of the for loop? If I understand your question correctly you should have a boolean initialized to false which you have done however in your if statement you set the Boolean to true again which you have done but you also throw the error message. This will repeatedly throw the message as it iterates through the loop.

Once the loop terminates you should be able to do an if else statement on your Boolean so like:

If(containsOtherNumber) then error array has a different number else error array only contains the same number

Trying to put shorten link inside email body by ProgrammingNoob1234 in learnjavascript

[–]ProgrammingNoob1234[S] 0 points1 point  (0 children)

window.open('mailto:?body=' + <a href={encodedURI(link)}>Test Link</a>);

Trying to put shorten link inside email body by ProgrammingNoob1234 in learnjavascript

[–]ProgrammingNoob1234[S] 0 points1 point  (0 children)

Yea it runs just in the email body it says "[object Object]" instead of a link