Yeah , i read on https://www.reddit.com/r/cscareerquestions/
how after having a few years of experience ....recruiters are the ones chasing you down for interviews and such.
how people are able to double their salary just by job hopping.
Software Development and Programming Careers (Official Discussion Thread)
- Thread starter Blackking
- Start date
-
- Tags
- careers programming
how after having a few years of experience ....recruiters are the ones chasing you down for interviews and such.
how people are able to double their salary just by job hopping.
Yeah, just keep your LinkedIn up to date and they'll come for you. After 2 years I was getting increased interest. Now I get a bunch - it's not always relevant, but it's a steady flow. Also the FANG companies will eventually reach out to you if you've applied to them in the past. Amazon, for example, comes knocking around 6 months after your last interview. I've had like 4, 5 Amazon recruiters reach out within 2 days before.
Rev Leon Lonnie Love
damned mine eyes, DAMNED mine eyes!!
CD-drive already been bushed first day I got it. Got me a 12.7 caddy and slapped a 1TB hdd on it and used an SSD on the main drive for the OS and then upped the RAM to 16GB. Only thing left to replace is the shytty 736p panelCD drive
We going back into the caveman era around here @Obreh Winfrey
And as far more space. I got a couple portable 2tb flash drives.@DEAD7
But, no cap though, I feel you on being able to tweak and customize shyt.
, but im not in a rush since this machine is connected to an external IPS 27" monitor.I refuse to buy a non-upgradable laptop after having 2 useless laptops now taking up space because their stock hardware couldnt keep up with the times.
Neo. The Only. The One.
THE ONE
@Obreh Winfrey 
I'm not going to look at your solution just yet, because I have to solve it myself. I'm going to knock it out between tonight and tomorrow. My solution will be in Javascript.
I'm not going to look at your solution just yet, because I have to solve it myself. I'm going to knock it out between tonight and tomorrow. My solution will be in Javascript.
Mines in Java, I didn't run it though. Probably 1 or 2 spots that are wrong.@Obreh Winfrey
I'm not going to look at your solution just yet, because I have to solve it myself. I'm going to knock it out between tonight and tomorrow. My solution will be in Javascript.
Neo. The Only. The One.
THE ONE
Bump tomorrow. You got me excited. Imma do it tonight.
Already solved the 1st part. Gotta make a run but when I get back tonight, I'll finish it up.
Neo. The Only. The One.
THE ONE
Yo this is way harder than I thought it would be
. Got me over here like
Neo. The Only. The One.
THE ONE
yoooooo @Obreh Winfrey @dontreadthis I solved it, y'all
I'm over here celebrating like I won the Super Bowl or something. This is the hardest coding problem I've ran into in a MINUTE. Had me worried for a sec since I told @Obreh Winfrey that I was gonna solve it before I went to bed and I didn't want breh to think I'm a liar
Anyway, here's my solution in Javascript. It looks like crap, I'm not refactoring this tonight so it is what it is. It works perfectly tho.
Code:
function SubtractSum(n){
function valueOfN(n) {
if (n >= 10 && n < 10000) {
let hold = 0;
let b = n.toString().split('').map(Number);
for(let i = 0; i < b.length; i++) {
hold += b[i];
}
return n = n - hold;
}
} let x = valueOfN(n);
let b = returnWord(x);
return b;
function returnWord(n) {
if (n === 1 || n === 3 || n === 24 || n === 26 || n === 47 || n === 49 || n === 68 || n === 70 || n === 91 || n === 93) {
return 'kiwi';
} else if (n === 2 || n === 21 || n === 23 || n === 42 || n === 44 || n === 46 || n === 65 || n === 67 || n === 69 || n === 88 ) {
return 'pear';
} else if (n === 4 || n === 6 || n === 25 || n === 29 || n === 48 || n === 50 || n === 71 || n === 73 || n === 92 || n === 94 || n === 96) {
return 'banana';
} else if (n === 5 || n === 7 || n === 28 || n === 30 || n === 32 || n === 51 || n === 53 || n === 74 || n === 76 || n === 95 || n === 97) {
return 'melon';
} else if (n === 8 || n === 10 || n === 12 || n === 31 || n === 33 || n === 52 || n === 56 || n === 75 || n === 77 || n === 79 || n === 98 || n === 100) {
return 'pineapple';
} else if (n === 9 || n === 18 || n === 27 || n === 36 || n === 45 || n === 54 || n === 63 || n === 72 || n === 81 || n === 90 || n === 99) {
return 'apple';
} else if (n === 11 || n === 13 || n === 34 || n === 55 || n === 57 || n === 59 || n === 78 || n === 80) {
return 'cucumber';
} else if (n === 14 || n === 16 || n === 35 || n === 37 || n === 39 || n === 58 || n === 60 || n === 83) {
return 'orange';
} else if (n === 15 || n === 17 || n === 19 || n === 38 || n === 40 || n === 61 || n === 82 || n === 84 || n === 86) {
return 'grape';
} else if (n === 20 || n === 22 || n === 41 || n === 43 || n === 62 || n === 64 || n === 66 || n === 85 || n === 87 || n === 89) {
return 'cherry';
} else {
for(i = n; i > 100; i--) {
let x = valueOfN(n);
let b = returnWord(x);
return b;
}
}
}
}That was some good code cardio. Imma sleep good tonight like
Neo. The Only. The One.
THE ONE
Now I'm looking at it like
Imma refactor it tomorrow
Imma refactor it tomorrow
Neo. The Only. The One.
THE ONE
Had to make a couple of changes, missing semi colon, static/non-static issues. My main issue was having to change from a while to a do/while. Didn't catch that you had to do the digit sum then check. Initially I was checking if n was in the map and exiting early. I just thought they fed you a bad initial test case.
Same link: Subtract the Sum Kata ($2221689) · Snippets · Snippets · GitLab
Neo. The Only. The One.
THE ONE
It is? I didn't recognize anything extra about it. Where's the trick?Did you get that it's a trick problem?
I didn't realize it till I finished