Current Events > Another day, another rejection from a software developer position. Time to grind

Topic List	Page List: 1, 2, 3
BIueJay 12/03/21 8:26:07 AM #1:	I think I'm just slow. Got to the final round, and as usual they state that my soft skills are great, but my technical skills are lacking. If you don't perfect the technical side, you ain't getting the position. I thought I was pretty damn close, only failed in the super edge cases, and I explained my thought process well. So I'm just going to grind more. This topic is to keep me in track. Right now I'm just going to do 2 Leetcode questions per day, and stick with easy/medium for now (because hard honestly isn't worth it unless it's a super common question, no interviewer asks hard questions since they always take too long). Then I'll review more system design. And then finally possibly work on a game concept I was thinking about (maybe). If you want to join the journey and add your own, you're more than welcome. Confidence is shot, time to build it back up again. <cite>BIueJay posted [p:960580199] in Another da... [t:79792753]...</cite> <quote>I think I'm just slow. Got to the final round, and as usual they state that my soft skills are great, but my technical skills are lacking. If you don't perfect the technical side, you ain't getting the position. I thought I was pretty damn close, only failed in the super edge cases, and I explained my thought process well. So I'm just going to grind more. This topic is to keep me in track. Right now I'm just going to do 2 Leetcode questions per day, and stick with easy/medium for now (because hard honestly isn't worth it unless it's a super common question, no interviewer asks hard questions since they always take too long). Then I'll review more system design. And then finally possibly work on a game concept I was thinking about (maybe). If you want to join the journey and add your own, you're more than welcome. Confidence is shot, time to build it back up again. </quote> ... Copied to Clipboard!
emblem boy 12/03/21 8:31:36 AM #2:	Good luck man. Had a failure of an interview last week that's I'm personally embarrassed about. Was my first interview in over a year. Truly is a skill I have to practice before hand. What kind of software jobs are you looking for? I'm electrical engineering but I've been thinking of trying to transfer into more of a software engineer type role. I just don't know the best way to do it. I mean, I know the basics of outstanding, but not enough to get a job as a developer --- http://avatar.xboxlive.com/avatar/emblem%20boy/avatar-body.png haters gonna hate <cite>emblem boy posted [p:960580290] in Another da... [t:79792753]...</cite> <quote>Good luck man. Had a failure of an interview last week that's I'm personally embarrassed about. Was my first interview in over a year. Truly is a skill I have to practice before hand. What kind of software jobs are you looking for? I'm electrical engineering but I've been thinking of trying to transfer into more of a software engineer type role. I just don't know the best way to do it. I mean, I know the basics of outstanding, but not enough to get a job as a developer</quote> ... Copied to Clipboard!
BIueJay 12/03/21 9:00:30 AM #3:	emblem boy posted... Good luck man. Had a failure of an interview last week that's I'm personally embarrassed about. Was my first interview in over a year. Truly is a skill I have to practice before hand. What kind of software jobs are you looking for? I'm electrical engineering but I've been thinking of trying to transfer into more of a software engineer type role. I just don't know the best way to do it. I mean, I know the basics of outstanding, but not enough to get a job as a developer Thanks bro. I'm trying to get into one of the bigger companies. My resume is really lacking. Fortunately I have about 4 years of experience so now more recruiters are hitting me up. I didn't have any internships from school, so I just have this one current position. I'm focusing on getting one of those larger companies. Amazon is out of the question just because I hear so many bad things about it, and I'm not sure if I'm ready to hit any FAANGs yet. I'll do that after my grind is over. But I was focusing on companies just below FAANG. I hear you need to hit at least 300-400 leetcode questions, and get lucky during the interviews. If you're starting from scratch, I'd just pick a very common object-oriented language. There was a python topic on this board, I'd suggest that. I'm using Java since I'm used to it, and am using it in my current position. But Java takes way too long to code at times. I'd also suggest creating simple applications, focusing on good coding practices. Clean Code is a decent book to use. Create simple CRUD apps (fetch data from a database and display it on a website), maybe try creating a simple ecommerce website, and tackle fixing bugs in open-source projects to get a feel of how you would work in a company. Do leetcode easy question first. TeamBlind's 75 questions is useful. CodeWars is also a great website to get a feel of the programming language you're using. Then it's all about grind. Pair your learning with Anki so you don't forget concepts. I always hate giving advice though since I haven't gotten another job yet, it's like who am I to talk. But this is what I've gathered. <cite>BIueJay posted [p:960580798] in Another da... [t:79792753]...</cite> <quote>emblem boy posted... </cite> <quote>Good luck man. Had a failure of an interview last week that's I'm personally embarrassed about. Was my first interview in over a year. Truly is a skill I have to practice before hand. What kind of software jobs are you looking for? I'm electrical engineering but I've been thinking of trying to transfer into more of a software engineer type role. I just don't know the best way to do it. I mean, I know the basics of outstanding, but not enough to get a job as a developer</quote>Thanks bro. I'm trying to get into one of the bigger companies. My resume is really lacking. Fortunately I have about 4 years of experience so now more recruiters are hitting me up. I didn't have any internships from school, so I just have this one current position. I'm focusing on getting one of those larger companies. Amazon is out of the question just because I hear so many bad things about it, and I'm not sure if I'm ready to hit any FAANGs yet. I'll do that after my grind is over. But I was focusing on companies just below FAANG. I hear you need to hit at least 300-400 leetcode questions, and get lucky during the interviews. If you're starting from scratch, I'd just pick a very common object-oriented language. There was a python topic on this board, I'd suggest that. I'm using Java since I'm used to it, and am using it in my current position. But Java takes way too long to code at times. I'd also suggest creating simple applications, focusing on good coding practices. Clean Code is a decent book to use. Create simple CRUD apps (fetch data from a database and display it on a website), maybe try creating a simple ecommerce website, and tackle fixing bugs in open-source projects to get a feel of how you would work in a company. Do leetcode easy question first. TeamBlind's 75 questions is useful. CodeWars is also a great website to get a feel of the programming language you're using. Then it's all about grind. Pair your learning with Anki so you don't forget concepts. I always hate giving advice though since I haven't gotten another job yet, it's like who am I to talk. But this is what I've gathered. </quote> ... Copied to Clipboard!
warlock7735 12/03/21 9:02:44 AM #4:	Apply somewhere that will appreciate you, not somewhere that you esteem. Invert the balance of power is you want to be happy. --- CE Mafia Archive https://www.dropbox.com/sh/u3gaka98zsp3m0e/AADYBrilDyGYhlAbpEnac5d_a?dl=0 <cite>warlock7735 posted [p:960580826] in Another da... [t:79792753]...</cite> <quote>Apply somewhere that will appreciate you, not somewhere that you esteem. Invert the balance of power is you want to be happy. </quote> ... Copied to Clipboard!
BIueJay 12/03/21 6:35:54 PM #5:	warlock7735 posted... Apply somewhere that will appreciate you, not somewhere that you esteem. Invert the balance of power is you want to be happy. They can appreciate me by paying me the monies. I'm hitting random on Leetcode. I already have 200 problems done, and I'm hoping to hit 300. I'm also adding all these problems on Anki so I can quickly remember the process. I briefly remember the concept of the LRU Cache problem and the data structures needed, but I haven't actually implemented. You always need to implement the problems to see first-hand what road blocks you might run into. https://leetcode.com/problems/lru-cache/submissions/ This is the first problem I did today using Java. The key here for me is to use a HashMap and a doubly linked list, but just have a dummy head and a dummy tail. This means I don't have to do so many null checks in case the head or tail is null, since they will always exist. It makes this question so much easier. Second question is the unique email combinations you can produce. A leetcode easy question. Admittedly my regex isn't the greatest. But you can kinda cheat here by replacing the "." and "+" and surrounding them with some random symbol like "~", so it becomes "~.~". Then call split on that based on "~". Finally iterate through that split, following the instructions. Use a HashMap to only get the unique emails. Not too bad. Another way is to just serch for the first index of + in the domain and remove the end. The split the rest of the domain by . and append them all. https://leetcode.com/problems/unique-email-addresses/submissions/ For system design, I kind of already know the basic components from https://github.com/donnemartin/system-design-primer. I'll be looking for more resources, and more specific cases that companies actually use. Also will be devouring youtube channels. I learned about the publisher/subscriber pattern. The journey continues. <cite>BIueJay posted [p:960595869] in Another da... [t:79792753]...</cite> <quote>warlock7735 posted... </cite> <quote>Apply somewhere that will appreciate you, not somewhere that you esteem. Invert the balance of power is you want to be happy.</quote>They can appreciate me by paying me the monies. I'm hitting random on Leetcode. I already have 200 problems done, and I'm hoping to hit 300. I'm also adding all these problems on Anki so I can quickly remember the process. I briefly remember the concept of the LRU Cache problem and the data structures needed, but I haven't actually implemented. You always need to implement the problems to see first-hand what road blocks you might run into. https://leetcode.com/problems/lru-cache/submissions/ This is the first problem I did today using Java. The key here for me is to use a HashMap and a doubly linked list, but just have a dummy head and a dummy tail. This means I don't have to do so many null checks in case the head or tail is null, since they will always exist. It makes this question so much easier. Second question is the unique email combinations you can produce. A leetcode easy question. Admittedly my regex isn't the greatest. But you can kinda cheat here by replacing the "." and "+" and surrounding them with some random symbol like "~", so it becomes "~.~". Then call split on that based on "~". Finally iterate through that split, following the instructions. Use a HashMap to only get the unique emails. Not too bad. Another way is to just serch for the first index of + in the domain and remove the end. The split the rest of the domain by . and append them all. https://leetcode.com/problems/unique-email-addresses/submissions/ For system design, I kind of already know the basic components from https://github.com/donnemartin/system-design-primer. I'll be looking for more resources, and more specific cases that companies actually use. Also will be devouring youtube channels. I learned about the publisher/subscriber pattern. The journey continues. </quote> ... Copied to Clipboard!
BIueJay 12/04/21 8:05:34 PM #6:	Day 2 Completed https://leetcode.com/problems/delete-columns-to-make-sorted-ii/. This took way too long. I definitely need to just throw up my hands and look at the solution, instead of wasting more hours trying to figure it out. I eventually got it but the effort is wasted. Could have spent that time understanding the solution and moving on. Completed https://leetcode.com/problems/split-linked-list-in-parts/. This was much easier than the previous one. Just need to know how to split the list. Each part gets at least "size of list" / k. Get the remainder of "size of list" / k, so each part gets a single remainder until the remainder runs out. 10/3 is 3 remainder 1. Each part has at least 3. First part gets an extra 1. If it were 11/3, then each part gets 3 but part 1 and part 2 gets a remainder, as the remainder is 2. I may ramp up the number of daily leetcode questions depending on how I'm feeling. In terms of system design. It's hard to choose a starting point, but I'll stick with this free PDF. http://ce.sharif.edu/courses/96-97/1/ce924-1/resources/root/Books/building-microservices-designing-fine-grained-systems.pdf <cite>BIueJay posted [p:960626832] in Another da... [t:79792753]...</cite> <quote>Day 2 Completed https://leetcode.com/problems/delete-columns-to-make-sorted-ii/. This took way too long. I definitely need to just throw up my hands and look at the solution, instead of wasting more hours trying to figure it out. I eventually got it but the effort is wasted. Could have spent that time understanding the solution and moving on. Completed https://leetcode.com/problems/split-linked-list-in-parts/. This was much easier than the previous one. Just need to know how to split the list. Each part gets at least "size of list" / k. Get the remainder of "size of list" / k, so each part gets a single remainder until the remainder runs out. 10/3 is 3 remainder 1. Each part has at least 3. First part gets an extra 1. If it were 11/3, then each part gets 3 but part 1 and part 2 gets a remainder, as the remainder is 2. I may ramp up the number of daily leetcode questions depending on how I'm feeling. In terms of system design. It's hard to choose a starting point, but I'll stick with this free PDF. http://ce.sharif.edu/courses/96-97/1/ce924-1/resources/root/Books/building-microservices-designing-fine-grained-systems.pdf </quote> ... Copied to Clipboard!
BIueJay 12/05/21 7:41:28 PM #7:	Day 3 Struggle day. Did 1 and a half questions. First question was https://leetcode.com/problems/house-robber-iii/. Shouldn't have been that hard but I was too stuck on my own solution. Had to look for hints by briefly scanning over the submitted solutions, so I don't get the full picture. Took way to long. Second question is https://leetcode.com/problems/corporate-flight-bookings/. Simple solution is obviously the longest one. I tried it and it said my answer was inefficient. I'm thinking of using intervals and intersections, but that may involve sorting and might not be fast enough. But I'll give it a shot next time. If I don't get the answer immediately I'm just going to look it up. The next day might be 3 problems. Today was a short day, still reading through the microservices book, and trying to digest anything that I didn't know before. <cite>BIueJay posted [p:960654387] in Another da... [t:79792753]...</cite> <quote>Day 3 Struggle day. Did 1 and a half questions. First question was https://leetcode.com/problems/house-robber-iii/. Shouldn't have been that hard but I was too stuck on my own solution. Had to look for hints by briefly scanning over the submitted solutions, so I don't get the full picture. Took way to long. Second question is https://leetcode.com/problems/corporate-flight-bookings/. Simple solution is obviously the longest one. I tried it and it said my answer was inefficient. I'm thinking of using intervals and intersections, but that may involve sorting and might not be fast enough. But I'll give it a shot next time. If I don't get the answer immediately I'm just going to look it up. The next day might be 3 problems. Today was a short day, still reading through the microservices book, and trying to digest anything that I didn't know before. </quote> ... Copied to Clipboard!
BIueJay 12/06/21 9:06:49 PM #8:	Day 4 Finished the second problem that I was stuck on yesterday. I had to get some heavy hints. Sorting definitely wasn't the way to go. Answer was pretty interesting. It feels so obvious now after I complete it, but that's just the way it goes. Second question is https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/. Took my longer than I'd like, but I'm okay with it since it is about bit manipulation and I suck at it. Got the answer without help, so that's neat I guess. Third question is a leetcode easy. https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/. Very coincidental, since I just practiced this in the second question. Pretty easy. No system design today, but I'll make up for it by reading a bunch tomorrow. <cite>BIueJay posted [p:960686033] in Another da... [t:79792753]...</cite> <quote>Day 4 Finished the second problem that I was stuck on yesterday. I had to get some heavy hints. Sorting definitely wasn't the way to go. Answer was pretty interesting. It feels so obvious now after I complete it, but that's just the way it goes. Second question is https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/. Took my longer than I'd like, but I'm okay with it since it is about bit manipulation and I suck at it. Got the answer without help, so that's neat I guess. Third question is a leetcode easy. https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/. Very coincidental, since I just practiced this in the second question. Pretty easy. No system design today, but I'll make up for it by reading a bunch tomorrow. </quote> ... Copied to Clipboard!
AABLMD82 12/06/21 9:08:16 PM #9:	What's your education/training like? What's your area? I just got a job after 2.5 years of searching (lul) --- What ever happened to Mad Stalker? <cite>AABLMD82 posted [p:960686076] in Another da... [t:79792753]...</cite> <quote>What's your education/training like? What's your area? I just got a job after 2.5 years of searching (lul) </quote> ... Copied to Clipboard!
samurai bandit 12/06/21 9:19:52 PM #10:	BIueJay posted... I'm not sure if I'm ready to hit any FAANGs yet. Just apply. 99% of interviews is luck into having the interviewers actually know what they are doing. I also would say it is actually easier to apply for the top companies as they have to care more about fair hiring, diversity, no racism and all that jazz. A smaller company doesnt care about that and also typically has even less open positions to fill. Keep practicing interviews and not only problems, it is important to be able to communicate what you are doing (during an interview) instead of sitting in silence 10 minutes while you code. --- Go and watch Ef ~ A tale of memories now! <cite>samurai bandit posted [p:960686408] in Another da... [t:79792753]...</cite> <quote>BIueJay posted... </cite> <quote>I'm not sure if I'm ready to hit any FAANGs yet.</quote> Just apply. 99% of interviews is luck into having the interviewers actually know what they are doing. I also would say it is actually easier to apply for the top companies as they have to care more about fair hiring, diversity, no racism and all that jazz. A smaller company doesnt care about that and also typically has even less open positions to fill. Keep practicing interviews and not only problems, it is important to be able to communicate what you are doing (during an interview) instead of sitting in silence 10 minutes while you code. </quote> ... Copied to Clipboard!
BIueJay 12/07/21 8:07:15 PM #11:	AablMind posted... What's your education/training like? What's your area? I just got a job after 2.5 years of searching (lul) Just a bachelor of science in computer science, and around 3-4 years of experience. My current job is my only developer job, so I need to improve my resume. samurai bandit posted... Just apply. 99% of interviews is luck into having the interviewers actually know what they are doing. I also would say it is actually easier to apply for the top companies as they have to care more about fair hiring, diversity, no racism and all that jazz. A smaller company doesnt care about that and also typically has even less open positions to fill. Keep practicing interviews and not only problems, it is important to be able to communicate what you are doing (during an interview) instead of sitting in silence 10 minutes while you code. O definitely it is all about luck. I had some interviews that I should have gotten tbh if it weren't for that one terrible interviewer. I want to hit my bench mark at least before I start applying. My feedback in terms of communication has always been great, I just need to focus on the technical part. <cite>BIueJay posted [p:960713800] in Another da... [t:79792753]...</cite> <quote>AablMind posted... </cite> <quote>What's your education/training like? What's your area? I just got a job after 2.5 years of searching (lul)</quote>Just a bachelor of science in computer science, and around 3-4 years of experience. My current job is my only developer job, so I need to improve my resume. samurai bandit posted... </cite> <quote>Just apply. 99% of interviews is luck into having the interviewers actually know what they are doing. I also would say it is actually easier to apply for the top companies as they have to care more about fair hiring, diversity, no racism and all that jazz. A smaller company doesnt care about that and also typically has even less open positions to fill. Keep practicing interviews and not only problems, it is important to be able to communicate what you are doing (during an interview) instead of sitting in silence 10 minutes while you code.</quote>O definitely it is all about luck. I had some interviews that I should have gotten tbh if it weren't for that one terrible interviewer. I want to hit my bench mark at least before I start applying. My feedback in terms of communication has always been great, I just need to focus on the technical part. </quote> ... Copied to Clipboard!
BIueJay 12/07/21 8:16:40 PM #12:	Day 5 First problem is https://leetcode.com/problems/unique-paths-ii/. Worked on a similar problem before when I prepped for some company, so this was pretty straight forward. Second problem is https://leetcode.ca/2021-06-17-1826-Faulty-Sensor/, but it's behind a paywall of course. I simply googled the problem and found it. Too bad I can't run it on Leetcode, but I'll still tally it up as Leetcode questions answered. Took a minute to figure out what it was trying to ask. Doing more microservices reading, since system design interviews are mostly designed around distributed systems. I find it pretty interesting tbh, it's like becomming an architect, just with code and not with building designs <cite>BIueJay posted [p:960714017] in Another da... [t:79792753]...</cite> <quote>Day 5 First problem is https://leetcode.com/problems/unique-paths-ii/. Worked on a similar problem before when I prepped for some company, so this was pretty straight forward. Second problem is https://leetcode.ca/2021-06-17-1826-Faulty-Sensor/, but it's behind a paywall of course. I simply googled the problem and found it. Too bad I can't run it on Leetcode, but I'll still tally it up as Leetcode questions answered. Took a minute to figure out what it was trying to ask. Doing more microservices reading, since system design interviews are mostly designed around distributed systems. I find it pretty interesting tbh, it's like becomming an architect, just with code and not with building designs </quote> ... Copied to Clipboard!
SparkClark 12/07/21 8:30:12 PM #13:	seeing all of this "leetcode" stuff you guys gotta go through has me terrified to ever interview for a SE position again. i hope i never get laid off <_< not all companies require that kinda stuff, TC. i sometimes help my boss interview candidates and she / we never ask about that kinda stuff. being able to solve an algorithm quickly and under pressure is not what makes for a good team engineer, IMO. it's more about your ability to learn and how well you communicate and work with others, at least at the junior level. unfortunately not all employers feel this way. good luck! also, if you reddit check out /r/cscareerquestions for advice and information --- {;(~) otherwise known as Giant_Aspirin <cite>SparkClark posted [p:960714374] in Another da... [t:79792753]...</cite> <quote>seeing all of this "leetcode" stuff you guys gotta go through has me terrified to ever interview for a SE position again. i hope i never get laid off <_< not all companies require that kinda stuff, TC. i sometimes help my boss interview candidates and she / we never ask about that kinda stuff. being able to solve an algorithm quickly and under pressure is not what makes for a good team engineer, IMO. it's more about your ability to learn and how well you communicate and work with others, at least at the junior level. unfortunately not all employers feel this way. good luck! also, if you reddit check out /r/cscareerquestions for advice and information </quote> ... Copied to Clipboard!
_____Cait 12/07/21 8:33:43 PM #14:	Why not apply somewhere small and learn there? People too often aim for the top right away (there is no top, only invisible status and money), and forget why they do anything. i will say right now, if your goal is to just get rich, you wont be satisfied, and you better learn coping skills rather than coding. But if you like what you do, then just start small, and you will learn for sure. There is no shame in not knowing everything. Enjoy the journey. --- ORAS secret base: https://imgur.com/V9nAVrd 3DS friend code: 0173-1465-1236 <cite>_____Cait posted [p:960714469] in Another da... [t:79792753]...</cite> <quote>Why not apply somewhere small and learn there? People too often aim for the top right away (there is no top, only invisible status and money), and forget why they do anything. i will say right now, if your goal is to just get rich, you wont be satisfied, and you better learn coping skills rather than coding. But if you like what you do, then just start small, and you will learn for sure. There is no shame in not knowing everything. Enjoy the journey. </quote> ... Copied to Clipboard!
AzurexNightmare 12/07/21 8:46:02 PM #15:	SparkClark posted... seeing all of this "leetcode" stuff you guys gotta go through has me terrified to ever interview for a SE position again. i hope i never get laid off <_< not all companies require that kinda stuff, TC. i sometimes help my boss interview candidates and she / we never ask about that kinda stuff. being able to solve an algorithm quickly and under pressure is not what makes for a good team engineer, IMO. it's more about your ability to learn and how well you communicate and work with others, at least at the junior level. unfortunately not all employers feel this way. good luck! also, if you reddit check out /r/cscareerquestions for advice and information What the fuck are you talking about? Just become a plumber. --- Latest Game Completed 100% Resident Evil VII <cite>AzurexNightmare posted [p:960714736] in Another da... [t:79792753]...</cite> <quote>SparkClark posted... </cite> <quote>seeing all of this "leetcode" stuff you guys gotta go through has me terrified to ever interview for a SE position again. i hope i never get laid off <_< not all companies require that kinda stuff, TC. i sometimes help my boss interview candidates and she / we never ask about that kinda stuff. being able to solve an algorithm quickly and under pressure is not what makes for a good team engineer, IMO. it's more about your ability to learn and how well you communicate and work with others, at least at the junior level. unfortunately not all employers feel this way. good luck! also, if you reddit check out /r/cscareerquestions for advice and information</quote>What the fuck are you talking about? Just become a plumber. </quote> ... Copied to Clipboard!
BIueJay 12/07/21 8:54:38 PM #16:	SparkClark posted... seeing all of this "leetcode" stuff you guys gotta go through has me terrified to ever interview for a SE position again. i hope i never get laid off <_< not all companies require that kinda stuff, TC. i sometimes help my boss interview candidates and she / we never ask about that kinda stuff. being able to solve an algorithm quickly and under pressure is not what makes for a good team engineer, IMO. it's more about your ability to learn and how well you communicate and work with others, at least at the junior level. unfortunately not all employers feel this way. good luck! also, if you reddit check out /r/cscareerquestions for advice and information Trust me, I know all about how bullshit leetcode is. And I definitely know that there are some companies that don't put an emphasis on them. My goal here is to make sure my future and career path looks good. The company I'm at right now is small. I'm looking for a medium to well known company for resume purposes, such that when it's time to leave, I don't have to worry about companies not choosing me. And I can settle wherever Iwant. My end goal is to get a comfortable job, make decent money, and live life. This doesn't have to be at a large company. Also appreciate the reddit link, I scour that subreddit anyways lol. <cite>BIueJay posted [p:960714942] in Another da... [t:79792753]...</cite> <quote>SparkClark posted... </cite> <quote>seeing all of this "leetcode" stuff you guys gotta go through has me terrified to ever interview for a SE position again. i hope i never get laid off <_< not all companies require that kinda stuff, TC. i sometimes help my boss interview candidates and she / we never ask about that kinda stuff. being able to solve an algorithm quickly and under pressure is not what makes for a good team engineer, IMO. it's more about your ability to learn and how well you communicate and work with others, at least at the junior level. unfortunately not all employers feel this way. good luck! also, if you reddit check out /r/cscareerquestions for advice and information</quote>Trust me, I know all about how bullshit leetcode is. And I definitely know that there are some companies that don't put an emphasis on them. My goal here is to make sure my future and career path looks good. The company I'm at right now is small. I'm looking for a medium to well known company for resume purposes, such that when it's time to leave, I don't have to worry about companies not choosing me. And I can settle wherever Iwant. My end goal is to get a comfortable job, make decent money, and live life. This doesn't have to be at a large company. Also appreciate the reddit link, I scour that subreddit anyways lol. </quote> ... Copied to Clipboard!
IllegalAlien 12/07/21 9:00:35 PM #17:	Here's my stats prior to my last job hop: `Totals` `Easy: 96` `Medium: 261` `Hard: 29` `Total: 386` I took a practice interview at my current company and they offered 160k remote so I took it. I was also aiming for FAANG & adjacent, but it can wait for another year or two. --- "Never argue with an idiot, they drag you down to their level, then beat you with experience." <cite>IllegalAlien posted [p:960715069] in Another da... [t:79792753]...</cite> <quote>Here's my stats prior to my last job hop: Totals Easy: 96Medium: 261Hard: 29Total: 386I took a practice interview at my current company and they offered 160k remote so I took it. I was also aiming for FAANG & adjacent, but it can wait for another year or two. </quote> ... Copied to Clipboard!
IllegalAlien 12/07/21 9:03:00 PM #18:	those are with repetition btw... I highly recommend you at least do common Hard questions or you'll only crack the luckiest, easiest FAANG level interviews IMO --- "Never argue with an idiot, they drag you down to their level, then beat you with experience." <cite>IllegalAlien posted [p:960715128] in Another da... [t:79792753]...</cite> <quote>those are with repetition btw... I highly recommend you at least do common Hard questions or you'll only crack the luckiest, easiest FAANG level interviews IMO </quote> ... Copied to Clipboard!
BIueJay 12/08/21 10:00:43 PM #19:	IllegalAlien posted... Here's my stats prior to my last job hop: `Totals` * `Easy: 96` * `Medium: 261` * `Hard: 29` * `Total: 386` I took a practice interview at my current company and they offered 160k remote so I took it. I was also aiming for FAANG & adjacent, but it can wait for another year or two. Damn, dems some good numbers. Yeah, I definitely will be doing the more common Hard Questions. My stats right now are 60 easy, 145 medium, and 11 hard. Hard might be 15 in actuality, just never did them on the website. I actually got asked one hard question from some random company during a phone screen of all things. Very odd when I looked it up afterwards and found out it was hard. I think I can reach there, I just need to be more committed. Hopefully this topic keeps me on track. <cite>BIueJay posted [p:960745058] in Another da... [t:79792753]...</cite> <quote>IllegalAlien posted... </cite> <quote>Here's my stats prior to my last job hop: Totals * Easy: 96 * Medium: 261 * Hard: 29 * Total: 386 I took a practice interview at my current company and they offered 160k remote so I took it. I was also aiming for FAANG & adjacent, but it can wait for another year or two.</quote>Damn, dems some good numbers. Yeah, I definitely will be doing the more common Hard Questions. My stats right now are 60 easy, 145 medium, and 11 hard. Hard might be 15 in actuality, just never did them on the website. I actually got asked one hard question from some random company during a phone screen of all things. Very odd when I looked it up afterwards and found out it was hard. I think I can reach there, I just need to be more committed. Hopefully this topic keeps me on track. </quote> ... Copied to Clipboard!
#20	Post #20 was unavailable or deleted.
BIueJay 12/08/21 10:04:09 PM #21:	Day 6 So like I mentioned before, I focused less on leetcode and more on system design today, since my current company doesn't teach me shit about it. Easy was https://leetcode.com/problems/binary-tree-tilt/. I can see why it got more dislikes than likes; the question was a bit confusing to understand what it was asking. Read more from the microservices book. Lot's of fluff so far, although it's still important. Just not very tangible. I want to get to the nitty gritty. Tomorrow will be a balanced diet of both, and hopefully some stuff I can put on Anki for system design. <cite>BIueJay posted [p:960745154] in Another da... [t:79792753]...</cite> <quote>Day 6 So like I mentioned before, I focused less on leetcode and more on system design today, since my current company doesn't teach me shit about it. Easy was https://leetcode.com/problems/binary-tree-tilt/. I can see why it got more dislikes than likes; the question was a bit confusing to understand what it was asking. Read more from the microservices book. Lot's of fluff so far, although it's still important. Just not very tangible. I want to get to the nitty gritty. Tomorrow will be a balanced diet of both, and hopefully some stuff I can put on Anki for system design. </quote> ... Copied to Clipboard!
BIueJay 12/08/21 10:04:40 PM #22:	Cpt_Pineapple posted... learn to code i'm trying, sir <cite>BIueJay posted [p:960745167] in Another da... [t:79792753]...</cite> <quote>Cpt_Pineapple posted... </cite> <quote>learn to code</quote>i'm trying, sir </quote> ... Copied to Clipboard!
BIueJay 12/09/21 11:44:46 PM #23:	Day 7 Easier questions for me today. Did https://leetcode.com/problems/jump-game-iii/. Very similar to a question I answered before. Straight forward BFS. Second question was https://leetcode.com/problems/pancake-sorting/submissions/. I always get curious when I see more dislikes than likes. But it just seems like very similar way of doing bubble sort. Straight forward. I was surprised my time and space complexity was really good. Read more system design. Read things like technical debt, principles, and practices. Stay need to get to the details. But oh god technical debt. A core part of my current job. <cite>BIueJay posted [p:960781450] in Another da... [t:79792753]...</cite> <quote>Day 7 Easier questions for me today. Did https://leetcode.com/problems/jump-game-iii/. Very similar to a question I answered before. Straight forward BFS. Second question was https://leetcode.com/problems/pancake-sorting/submissions/. I always get curious when I see more dislikes than likes. But it just seems like very similar way of doing bubble sort. Straight forward. I was surprised my time and space complexity was really good. Read more system design. Read things like technical debt, principles, and practices. Stay need to get to the details. But oh god technical debt. A core part of my current job. </quote> ... Copied to Clipboard!
BIueJay 12/10/21 6:30:21 PM #24:	Day 8 Did this during work because fuck it. First problem was https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/. I had to use one of those hints at the bottom, but it didn't help. Obviously there is sorting involved. Completed it but it took me a while. Second problem was the daily Leetcode problem https://leetcode.com/problems/domino-and-tromino-tiling/. I could not figure it out. I'm not sure why it's listed as medium. A coworker showed me his solution which was very short, but he said he kinda guessed into it by looking at the pattern. I'll have to go back to this problem to really understand what the dynamic programming function means. <cite>BIueJay posted [p:960804164] in Another da... [t:79792753]...</cite> <quote>Day 8 Did this during work because fuck it. First problem was https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/. I had to use one of those hints at the bottom, but it didn't help. Obviously there is sorting involved. Completed it but it took me a while. Second problem was the daily Leetcode problem https://leetcode.com/problems/domino-and-tromino-tiling/. I could not figure it out. I'm not sure why it's listed as medium. A coworker showed me his solution which was very short, but he said he kinda guessed into it by looking at the pattern. I'll have to go back to this problem to really understand what the dynamic programming function means. </quote> ... Copied to Clipboard!
BIueJay 12/11/21 9:43:06 PM #25:	Day 9 Only answered one leetcode easy question today, which was https://leetcode.com/problems/find-the-middle-index-in-array/. No problems there. Saturdays is when I usually take it easy. <cite>BIueJay posted [p:960834793] in Another da... [t:79792753]...</cite> <quote>Day 9 Only answered one leetcode easy question today, which was https://leetcode.com/problems/find-the-middle-index-in-array/. No problems there. Saturdays is when I usually take it easy. </quote> ... Copied to Clipboard!
BIueJay 12/12/21 8:19:42 PM #26:	Day 10 Weekends are required, but less pressure to do 2 plus system design. I did https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/ was was just sort and get the difference. Question two is https://leetcode.com/problems/largest-submatrix-with-rearrangements/. Currently struggling with this. Looked at the hint and it says to sort, which is what I suspected, but I think the running time would still be long. I assume it's referring to sort each row in decreasing order, so that you have all the 1s close together. But then you'll have to puck and choose which of the 1s need to be arranged to get the largest submatrix. I'm thinking you would have to sort them again based on the 1s above and below the row. Taking a break from this for now, and will tackle it tomorrow. <cite>BIueJay posted [p:960861796] in Another da... [t:79792753]...</cite> <quote>Day 10 Weekends are required, but less pressure to do 2 plus system design. I did https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/ was was just sort and get the difference. Question two is https://leetcode.com/problems/largest-submatrix-with-rearrangements/. Currently struggling with this. Looked at the hint and it says to sort, which is what I suspected, but I think the running time would still be long. I assume it's referring to sort each row in decreasing order, so that you have all the 1s close together. But then you'll have to puck and choose which of the 1s need to be arranged to get the largest submatrix. I'm thinking you would have to sort them again based on the 1s above and below the row. Taking a break from this for now, and will tackle it tomorrow. </quote> ... Copied to Clipboard!
Makeveli_lives 12/12/21 8:42:26 PM #27:	[LFAQs-redacted-quote] Give me one book or website that goes over literally every aspect of it like I'm 5 years old. --- Switch FC: SW-3917-4425-6106 PSN: PiKappaPhi769 <cite>Makeveli_lives posted [p:960862406] in Another da... [t:79792753]...</cite> <quote><cite>[LFAQs-redacted-quote]</cite> Give me one book or website that goes over literally every aspect of it like I'm 5 years old. </quote> ... Copied to Clipboard!
BIueJay 12/13/21 8:36:53 PM #28:	Day 11 fffffffffffffffffffffff This damn matrix question https://leetcode.com/problems/largest-submatrix-with-rearrangements/ that I was struggling with earlier. I spent like hours and a half trying to figure out how Java sorts a row in a matrix. Apparently it shits the bed if it is primitive array. I've spent too much time on this question today. My eyes are burning. Time to copy and paste the answer, understand it, and move on. Why do I continously get trapped on these questions that I know that I should just let go? Just let it go man it's okay, we can't get it all. What a wasted day. fuck this <cite>BIueJay posted [p:960890667] in Another da... [t:79792753]...</cite> <quote>Day 11 fffffffffffffffffffffff This damn matrix question https://leetcode.com/problems/largest-submatrix-with-rearrangements/ that I was struggling with earlier. I spent like hours and a half trying to figure out how Java sorts a row in a matrix. Apparently it shits the bed if it is primitive array. I've spent too much time on this question today. My eyes are burning. Time to copy and paste the answer, understand it, and move on. Why do I continously get trapped on these questions that I know that I should just let go? Just let it go man it's okay, we can't get it all. What a wasted day. fuck this </quote> ... Copied to Clipboard!
#29	Post #29 was unavailable or deleted.
BIueJay 12/13/21 9:19:06 PM #30:	[LFAQs-redacted-quote] Thanks bruh. Some of those rejections hurt. I thought I was really close. I won't give in. Makeveli_lives posted... Give me one book or website that goes over literally every aspect of it like I'm 5 years old. That's tough, not sure where to start. I would suggest going to the Python topic that was floating around here. Sometimes I wish I focused more on Python when I started coding, it's so much easier. I stuck around for 10 more minutes and compared my answer to the ones in the discussions. Apparently Java doesn't keep the columns intact when sorting them. If you had a 2D matrix of `2,8,5` `1,4,6` `8,9,2` And you wanted to sort the matrix by the third row, you'd expect `5,2,8` `6,1,4` `2,8,9` With it conserving the rows. Instead, Java would just sort the bottom row and keep the rest the same, breaking the columns. Writing this for myself since obv no one else cares, but I'll be adding it to Anki so I don't forget. <cite>BIueJay posted [p:960891862] in Another da... [t:79792753]...</cite> <quote><cite>[LFAQs-redacted-quote]</cite> Thanks bruh. Some of those rejections hurt. I thought I was really close. I won't give in. Makeveli_lives posted... </cite> <quote>Give me one book or website that goes over literally every aspect of it like I'm 5 years old.</quote>That's tough, not sure where to start. I would suggest going to the Python topic that was floating around here. Sometimes I wish I focused more on Python when I started coding, it's so much easier. I stuck around for 10 more minutes and compared my answer to the ones in the discussions. Apparently Java doesn't keep the columns intact when sorting them. If you had a 2D matrix of 2,8,5 1,4,6 8,9,2 And you wanted to sort the matrix by the third row, you'd expect 5,2,8 6,1,4 2,8,9 With it conserving the rows. Instead, Java would just sort the bottom row and keep the rest the same, breaking the columns. Writing this for myself since obv no one else cares, but I'll be adding it to Anki so I don't forget. </quote> ... Copied to Clipboard!
BIueJay 12/14/21 9:20:57 PM #31:	Day 12 Questions were a bit easier today. First was https://leetcode.com/problems/design-linked-list/. Thanks to the power of question patterns (fuck leetcode), this problem was extremely similar to the LRU Cache question, where creating a doubly linked list with a dummy head and dummy tail helped me with not dealing with null pointers and edge cases. Second questions was https://leetcode.com/problems/path-with-maximum-gold/. I kinda hate these questions because I never knoew if my proposed solution is the quickest. So I kinda took a hint where I thought of a potentially slow algorithm, and looked at the hint to see if it would be fast enough. Seemed like it was fast enough. I'll do a bit more reading of system design in bed. <cite>BIueJay posted [p:960922573] in Another da... [t:79792753]...</cite> <quote>Day 12 Questions were a bit easier today. First was https://leetcode.com/problems/design-linked-list/. Thanks to the power of question patterns (fuck leetcode), this problem was extremely similar to the LRU Cache question, where creating a doubly linked list with a dummy head and dummy tail helped me with not dealing with null pointers and edge cases. Second questions was https://leetcode.com/problems/path-with-maximum-gold/. I kinda hate these questions because I never knoew if my proposed solution is the quickest. So I kinda took a hint where I thought of a potentially slow algorithm, and looked at the hint to see if it would be fast enough. Seemed like it was fast enough. I'll do a bit more reading of system design in bed. </quote> ... Copied to Clipboard!
BIueJay 12/15/21 9:38:03 PM #32:	Day 13 One question and a bunch of reading today. Did Leetcode's question of the day https://leetcode.com/problems/insertion-sort-list/. My algorithm is kinda slow, but I think I'm going to stay with it since it's still in O(n^2) for insertion sort, and logically it makes sense. I might get a referral to another company by a friend. I'm in that "don't really care" sort of mood, if they do contact me I expect nothing. The grind must continue. I must not relent. <cite>BIueJay posted [p:960953002] in Another da... [t:79792753]...</cite> <quote>Day 13 One question and a bunch of reading today. Did Leetcode's question of the day https://leetcode.com/problems/insertion-sort-list/. My algorithm is kinda slow, but I think I'm going to stay with it since it's still in O(n^2) for insertion sort, and logically it makes sense. I might get a referral to another company by a friend. I'm in that "don't really care" sort of mood, if they do contact me I expect nothing. The grind must continue. I must not relent. </quote> ... Copied to Clipboard!
BIueJay 12/16/21 9:59:20 PM #33:	Day 14 Two questions today. One kinda interesting. First is https://leetcode.com/problems/valid-square/. This is bringing me back to elemntary/highschool days. I was trying to remember how to determine if 3 coordinates forms a 90 degree angle. But I realized that, if I get the distance from one point to every other point, I'd get 6 distances. 4 distances would have the same length, i.e. the perimeter, and two distances will have the same length, i.e. the diagonal across the square. So I just need to validate that, grabing the distances using the pythagorean theorem that i still remember. Second was https://leetcode.com/problems/maximum-binary-tree-ii/. I was wondering why there were more dislikes than likes. After completing it and checking the comments, people just can't read. Append means place the number at the end of the array. <cite>BIueJay posted [p:960982160] in Another da... [t:79792753]...</cite> <quote>Day 14 Two questions today. One kinda interesting. First is https://leetcode.com/problems/valid-square/. This is bringing me back to elemntary/highschool days. I was trying to remember how to determine if 3 coordinates forms a 90 degree angle. But I realized that, if I get the distance from one point to every other point, I'd get 6 distances. 4 distances would have the same length, i.e. the perimeter, and two distances will have the same length, i.e. the diagonal across the square. So I just need to validate that, grabing the distances using the pythagorean theorem that i still remember. Second was https://leetcode.com/problems/maximum-binary-tree-ii/. I was wondering why there were more dislikes than likes. After completing it and checking the comments, people just can't read. Append means place the number at the end of the array. </quote> ... Copied to Clipboard!
BIueJay 12/17/21 8:37:08 PM #34:	Day 15 On to week 3. I might need to continue this even when I get a job, just to be sure that I'm ready to move on if need be. Ehh... probably pushing it. Anyways, first question today was the question of the day. https://leetcode.com/problems/maximal-square/. And just I mentioned before, because I answered a similar question, in fact the largest submatrix questions from before, I used the patterns there to answer this. Moral of the story, do more leetcode questions to pick up patterns faster. Second question was a leetcode easy. I use the random button on the site to pick a random question for me. Super easy. https://leetcode.com/problems/n-th-tribonacci-number/ <cite>BIueJay posted [p:961007108] in Another da... [t:79792753]...</cite> <quote>Day 15 On to week 3. I might need to continue this even when I get a job, just to be sure that I'm ready to move on if need be. Ehh... probably pushing it. Anyways, first question today was the question of the day. https://leetcode.com/problems/maximal-square/. And just I mentioned before, because I answered a similar question, in fact the largest submatrix questions from before, I used the patterns there to answer this. Moral of the story, do more leetcode questions to pick up patterns faster. Second question was a leetcode easy. I use the random button on the site to pick a random question for me. Super easy. https://leetcode.com/problems/n-th-tribonacci-number/ </quote> ... Copied to Clipboard!
BIueJay 12/18/21 8:15:01 PM #35:	Day 16 Weekend is here, so today and tomorrow I'll be having shorter reviews. Only did question https://leetcode.com/problems/contiguous-array/ today. Some reason this stumped me. When I took a small peek at the solution, trying to read as little as possible, I face palmed. I immediately when back to complete it. Very similar to those continuous sum problems using a HashMap. <cite>BIueJay posted [p:961031814] in Another da... [t:79792753]...</cite> <quote>Day 16 Weekend is here, so today and tomorrow I'll be having shorter reviews. Only did question https://leetcode.com/problems/contiguous-array/ today. Some reason this stumped me. When I took a small peek at the solution, trying to read as little as possible, I face palmed. I immediately when back to complete it. Very similar to those continuous sum problems using a HashMap. </quote> ... Copied to Clipboard!
BIueJay 12/19/21 3:25:45 PM #36:	Day 17 Much easier than yesterday. Simply teaching how to extract numbers from a string (which I need to commit to memory, I can't be googling these small things), and using recursion. https://leetcode.com/problems/decode-string/. I might do another one later today... <cite>BIueJay posted [p:961050941] in Another da... [t:79792753]...</cite> <quote>Day 17 Much easier than yesterday. Simply teaching how to extract numbers from a string (which I need to commit to memory, I can't be googling these small things), and using recursion. https://leetcode.com/problems/decode-string/. I might do another one later today... </quote> ... Copied to Clipboard!
BIueJay 12/20/21 8:12:19 PM #37:	Day 18 Did 3 questions today, because the first two they gave me were Leetcode easy. First is https://leetcode.com/problems/check-array-formation-through-concatenation/. I misread this question and thought were were asking for a harder solution. I made use of a HashMap to store the first item of a large piece, and iterated through the list to see if the array contained the remainder. Second is https://leetcode.com/problems/minimum-absolute-difference/. Sorting it first makes it trivial. Third is https://leetcode.com/problems/minimum-increment-to-make-array-unique/. It was kinda similar to another question I answered. Once again, sorting it makes it much easier to workout. When in doubt, sort it out. Unless of course the questions wants you to keep the array intact. <cite>BIueJay posted [p:961086686] in Another da... [t:79792753]...</cite> <quote>Day 18 Did 3 questions today, because the first two they gave me were Leetcode easy. First is https://leetcode.com/problems/check-array-formation-through-concatenation/. I misread this question and thought were were asking for a harder solution. I made use of a HashMap to store the first item of a large piece, and iterated through the list to see if the array contained the remainder. Second is https://leetcode.com/problems/minimum-absolute-difference/. Sorting it first makes it trivial. Third is https://leetcode.com/problems/minimum-increment-to-make-array-unique/. It was kinda similar to another question I answered. Once again, sorting it makes it much easier to workout. When in doubt, sort it out. Unless of course the questions wants you to keep the array intact. </quote> ... Copied to Clipboard!
BIueJay 12/21/21 7:53:07 PM #38:	Day 19 Two questions today. Question was a leetcode easy https://leetcode.com/problems/power-of-two/, and it reminded me how logs worked in high school, because I completely forgot. The "programming method" is to create a loop that continuously divides the number by 2, and check if there are any decimal places. The short way is the use log2, but Java doesn't support that. So I had to look up how to do log2 in Java, and if you remember your math, it's the same as log10(n) / log10(2). I'll keep that in mind. Question 2 was a struggle. https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store/. I am extremely close to answering it, but I'm forcing myself to stop and to look up the answer. I cannot waste time. Frustrating, but fuck my ego. I need to do the right thing. <cite>BIueJay posted [p:961114427] in Another da... [t:79792753]...</cite> <quote>Day 19 Two questions today. Question was a leetcode easy https://leetcode.com/problems/power-of-two/, and it reminded me how logs worked in high school, because I completely forgot. The "programming method" is to create a loop that continuously divides the number by 2, and check if there are any decimal places. The short way is the use log2, but Java doesn't support that. So I had to look up how to do log2 in Java, and if you remember your math, it's the same as log10(n) / log10(2). I'll keep that in mind. Question 2 was a struggle. https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store/. I am extremely close to answering it, but I'm forcing myself to stop and to look up the answer. I cannot waste time. Frustrating, but fuck my ego. I need to do the right thing. </quote> ... Copied to Clipboard!
BIueJay 12/22/21 5:28:44 PM #39:	Day 20 Went back to complete the last question I struggled with yesterday. I had to look it up, and it turns out it's similar to a question I also had to look up long ago. I fully understand the solution now, but I guess I need to figure out when to apply this pattern. Because normally I'd be looking for some greedy solution from the way it's described. This answer is basically just find the best possible one by one by slowly moving to the correct solution. Hmm... Second question is https://leetcode.com/problems/the-k-strongest-values-in-an-array/. Very straight forward using sorting and two pointers. Answered a bunch of these before. Third question is https://leetcode.com/problems/most-frequent-subtree-sum/. Also very straight forward. I kinda yolo'd and submitted the solution once I finished coding it. Usually I'd do my own test cases. I was expecting at least a compile error, but I got it right. I'm definitely not doing that again, else I'll start to form bad habits. <cite>BIueJay posted [p:961137049] in Another da... [t:79792753]...</cite> <quote>Day 20 Went back to complete the last question I struggled with yesterday. I had to look it up, and it turns out it's similar to a question I also had to look up long ago. I fully understand the solution now, but I guess I need to figure out when to apply this pattern. Because normally I'd be looking for some greedy solution from the way it's described. This answer is basically just find the best possible one by one by slowly moving to the correct solution. Hmm... Second question is https://leetcode.com/problems/the-k-strongest-values-in-an-array/. Very straight forward using sorting and two pointers. Answered a bunch of these before. Third question is https://leetcode.com/problems/most-frequent-subtree-sum/. Also very straight forward. I kinda yolo'd and submitted the solution once I finished coding it. Usually I'd do my own test cases. I was expecting at least a compile error, but I got it right. I'm definitely not doing that again, else I'll start to form bad habits. </quote> ... Copied to Clipboard!
BIueJay 12/23/21 8:38:56 PM #40:	Day 21 3 weeks complete. When will I stop? Maybe when I get a new job.I did 2 questions today. First is https://leetcode.com/problems/magic-squares-in-grid/. Looked like a boring validation type of question. Once I completed it, I looked at the community solutions, and one was just a little crazy. No way in hell an interviewer would be expecting those sort of answers. Second question is https://leetcode.com/problems/number-of-longest-increasing-subsequence/. This took me a while. Had to constantly change things up but finally got it. I swear I thought I've read this question before, but Leetcode says I never answered it. I have two leftover interviews next year. One said they'll be asking a system design question, so I switched it up a bit and am just going over the most popular system design questions asked that I never did before. <cite>BIueJay posted [p:961166742] in Another da... [t:79792753]...</cite> <quote>Day 21 3 weeks complete. When will I stop? Maybe when I get a new job.I did 2 questions today. First is https://leetcode.com/problems/magic-squares-in-grid/. Looked like a boring validation type of question. Once I completed it, I looked at the community solutions, and one was just a little crazy. No way in hell an interviewer would be expecting those sort of answers. Second question is https://leetcode.com/problems/number-of-longest-increasing-subsequence/. This took me a while. Had to constantly change things up but finally got it. I swear I thought I've read this question before, but Leetcode says I never answered it. I have two leftover interviews next year. One said they'll be asking a system design question, so I switched it up a bit and am just going over the most popular system design questions asked that I never did before. </quote> ... Copied to Clipboard!
BIueJay 12/24/21 7:50:42 PM #41:	Day 22 Christmas eve. Today and tomorrow I'll be taking it easy, and try not to stress over the job hunt. Planning on solving https://leetcode.com/problems/number-of-boomerangs/. I took a peek at the expected running time, which is O(n^2), so I'm a bit stumped (have an idea now that I think about it as I'm writing this). But I'll leave this for Sunday. I might try and complete it earlier if I feel like it. Next week I need to focus less on Leetcode and more on system design for my upcoming interviews. <cite>BIueJay posted [p:961190241] in Another da... [t:79792753]...</cite> <quote>Day 22 Christmas eve. Today and tomorrow I'll be taking it easy, and try not to stress over the job hunt. Planning on solving https://leetcode.com/problems/number-of-boomerangs/. I took a peek at the expected running time, which is O(n^2), so I'm a bit stumped (have an idea now that I think about it as I'm writing this). But I'll leave this for Sunday. I might try and complete it earlier if I feel like it. Next week I need to focus less on Leetcode and more on system design for my upcoming interviews. </quote> ... Copied to Clipboard!
CoorsLight 12/24/21 8:25:06 PM #42:	Sorry, I'm kind of just skimming over this especially when it comes to problem details, so you might have said this, but are you just doing these for practice, or are you putting the numbers on your resume? Do employers actually care about that at all? I think it's generally looked more highly upon to have some kind of side project, and you would probably get more personal enjoyment out of that too. I'm in a similar boat, about three years of experience full time (though I have other job experience, and have programmed for 10+ years but not regularly) and am looking for that next job. I have decided that I hate programming outside of work though; I'm not even sure if I like it anymore at all, but that's the career path I feel stuck in. IMO it's kind of a toxic part of the industry that you're expected to live and breathe it. I think it also causes people to put a burden on themselves to always find it fun, having that on my shoulders lately makes work miserable. I guess it would be miserable either way but eh. The interview process sucks ass too, real work is nothing like "reverse every other vowel in a string" or whatever. I'd rather just hold out for a place that doesn't do these kind of problems and hope I get lucky, because they do exist, but if you want to spend your time on all these problems that's your prerogative. I don't think someone at the four-year level is expected to know a ton about the complexities of software inside and out though. <cite>CoorsLight posted [p:961190925] in Another da... [t:79792753]...</cite> <quote>Sorry, I'm kind of just skimming over this especially when it comes to problem details, so you might have said this, but are you just doing these for practice, or are you putting the numbers on your resume? Do employers actually care about that at all? I think it's generally looked more highly upon to have some kind of side project, and you would probably get more personal enjoyment out of that too. I'm in a similar boat, about three years of experience full time (though I have other job experience, and have programmed for 10+ years but not regularly) and am looking for that next job. I have decided that I hate programming outside of work though; I'm not even sure if I like it anymore at all, but that's the career path I feel stuck in. IMO it's kind of a toxic part of the industry that you're expected to live and breathe it. I think it also causes people to put a burden on themselves to always find it fun, having that on my shoulders lately makes work miserable. I guess it would be miserable either way but eh. The interview process sucks ass too, real work is nothing like "reverse every other vowel in a string" or whatever. I'd rather just hold out for a place that doesn't do these kind of problems and hope I get lucky, because they do exist, but if you want to spend your time on all these problems that's your prerogative. I don't think someone at the four-year level is expected to know a ton about the complexities of software inside and out though. </quote> ... Copied to Clipboard!
BIueJay 12/25/21 9:19:27 PM #43:	CoorsLight posted... Sorry, I'm kind of just skimming over this especially when it comes to problem details, so you might have said this, but are you just doing these for practice, or are you putting the numbers on your resume? Do employers actually care about that at all? I think it's generally looked more highly upon to have some kind of side project, and you would probably get more personal enjoyment out of that too. I'm in a similar boat, about three years of experience full time (though I have other job experience, and have programmed for 10+ years but not regularly) and am looking for that next job. I have decided that I hate programming outside of work though; I'm not even sure if I like it anymore at all, but that's the career path I feel stuck in. IMO it's kind of a toxic part of the industry that you're expected to live and breathe it. I think it also causes people to put a burden on themselves to always find it fun, having that on my shoulders lately makes work miserable. I guess it would be miserable either way but eh. The interview process sucks ass too, real work is nothing like "reverse every other vowel in a string" or whatever. I'd rather just hold out for a place that doesn't do these kind of problems and hope I get lucky, because they do exist, but if you want to spend your time on all these problems that's your prerogative. I don't think someone at the four-year level is expected to know a ton about the complexities of software inside and out though. It's all for practice, and it's because most places ask these type of questions. On a balance of probabilities, if a lot of places are asking leetcode style questions then you definitely need study them. The key thing, at least for me, is recognizing patterns and answering questions quicker. And you simply get better at that by doing more questions. There are definitely companies that don't ask leetcode questions. Some of the smaller companies do. But every interview I've done throughout my entire dev career (except one) had them asking me some sort of algorithm question. Most are straight up copy-and-paste leetcode question. The one exception gave me a takehome assignment to create some random simple app. It sucks, trust me I hate the process, but it's just what you gotta do. And if this is what it takes, then honestly it isn't too bad. At least there are clear goals and a process in order to get the next job. I don't program outside of work either. I'm thinking about making a game but that's purely just a side project. <cite>BIueJay posted [p:961214695] in Another da... [t:79792753]...</cite> <quote>CoorsLight posted... </cite> <quote>Sorry, I'm kind of just skimming over this especially when it comes to problem details, so you might have said this, but are you just doing these for practice, or are you putting the numbers on your resume? Do employers actually care about that at all? I think it's generally looked more highly upon to have some kind of side project, and you would probably get more personal enjoyment out of that too. I'm in a similar boat, about three years of experience full time (though I have other job experience, and have programmed for 10+ years but not regularly) and am looking for that next job. I have decided that I hate programming outside of work though; I'm not even sure if I like it anymore at all, but that's the career path I feel stuck in. IMO it's kind of a toxic part of the industry that you're expected to live and breathe it. I think it also causes people to put a burden on themselves to always find it fun, having that on my shoulders lately makes work miserable. I guess it would be miserable either way but eh. The interview process sucks ass too, real work is nothing like "reverse every other vowel in a string" or whatever. I'd rather just hold out for a place that doesn't do these kind of problems and hope I get lucky, because they do exist, but if you want to spend your time on all these problems that's your prerogative. I don't think someone at the four-year level is expected to know a ton about the complexities of software inside and out though.</quote>It's all for practice, and it's because most places ask these type of questions. On a balance of probabilities, if a lot of places are asking leetcode style questions then you definitely need study them. The key thing, at least for me, is recognizing patterns and answering questions quicker. And you simply get better at that by doing more questions. There are definitely companies that don't ask leetcode questions. Some of the smaller companies do. But every interview I've done throughout my entire dev career (except one) had them asking me some sort of algorithm question. Most are straight up copy-and-paste leetcode question. The one exception gave me a takehome assignment to create some random simple app. It sucks, trust me I hate the process, but it's just what you gotta do. And if this is what it takes, then honestly it isn't too bad. At least there are clear goals and a process in order to get the next job. I don't program outside of work either. I'm thinking about making a game but that's purely just a side project. </quote> ... Copied to Clipboard!
BIueJay 12/25/21 9:21:05 PM #44:	Day 23 I wouldn't really call this day 23. Christmas day, so I got fat today. The process continues. I'm technically still answering questions I've put on Anki, since that is a daily thing, but nothing new. <cite>BIueJay posted [p:961214731] in Another da... [t:79792753]...</cite> <quote>Day 23 I wouldn't really call this day 23. Christmas day, so I got fat today. The process continues. I'm technically still answering questions I've put on Anki, since that is a daily thing, but nothing new. </quote> ... Copied to Clipboard!
Flauros 12/25/21 9:26:28 PM #45:	https://gamefaqs.gamespot.com/a/user_image/4/3/5/AATz36AACvZj.jpg You on stage 2 homie. Dont stop till you make it. You got this King. --- https://i.imgur.com/EX6Md7k.gif https://i.imgur.com/ygAzHKB.mp4 https://i.imgur.com/c84omp7.gif https://i.imgur.com/Hj9RrC6.mp4 <cite>Flauros posted [p:961214845] in Another da... [t:79792753]...</cite> <quote>https://gamefaqs.gamespot.com/a/user_image/4/3/5/AATz36AACvZj.jpg You on stage 2 homie. Dont stop till you make it. You got this King. </quote> ... Copied to Clipboard!
BIueJay 12/25/21 10:08:05 PM #46:	Flauros posted... https://gamefaqs.gamespot.com/a/user_image/4/3/5/AATz36AACvZj.jpg You on stage 2 homie. Dont stop till you make it. You got this King. Thanks man I won't let you down. This topic will be my legacy. <cite>BIueJay posted [p:961215756] in Another da... [t:79792753]...</cite> <quote>Flauros posted... </cite> <quote>https://gamefaqs.gamespot.com/a/user_image/4/3/5/AATz36AACvZj.jpg You on stage 2 homie. Dont stop till you make it. You got this King.</quote>Thanks man I won't let you down. This topic will be my legacy. </quote> ... Copied to Clipboard!
BIueJay 12/26/21 11:02:18 PM #47:	Day 24 Changing it up to one leetcode per day, and more time spent on system design. First question was the one from yesterday. https://leetcode.com/problems/number-of-boomerangs/. I figured it out, but my answer is slow according to the running times. Still, it's O(n^2) and it makes sense to me. Most likely I'd be going with my method since it logically follows to go in that direction. I'll stick with what I have. Learned the high level about designing a chat system, like what you see with facebook or whatsapp. A lot of the topics I already covered before, but I've added new information now. Now it's all about reviewing the concepts. <cite>BIueJay posted [p:961240766] in Another da... [t:79792753]...</cite> <quote>Day 24 Changing it up to one leetcode per day, and more time spent on system design. First question was the one from yesterday. https://leetcode.com/problems/number-of-boomerangs/. I figured it out, but my answer is slow according to the running times. Still, it's O(n^2) and it makes sense to me. Most likely I'd be going with my method since it logically follows to go in that direction. I'll stick with what I have. Learned the high level about designing a chat system, like what you see with facebook or whatsapp. A lot of the topics I already covered before, but I've added new information now. Now it's all about reviewing the concepts. </quote> ... Copied to Clipboard!
BIueJay 12/27/21 10:57:35 PM #48:	Day 25 Completed the leetcode question of the day. It was an easy bit manipulation question https://leetcode.com/problems/number-complement/. Just need to check if it's odd or even, divide the parameter number, and add it to the result. The video I watched for designing a chat system still had most of the stuff I've read before. I think I might move on to designing a video sharing website like Youtube. Curious how one would design the streaming part and housing millions of videos. <cite>BIueJay posted [p:961266699] in Another da... [t:79792753]...</cite> <quote>Day 25 Completed the leetcode question of the day. It was an easy bit manipulation question https://leetcode.com/problems/number-complement/. Just need to check if it's odd or even, divide the parameter number, and add it to the result. The video I watched for designing a chat system still had most of the stuff I've read before. I think I might move on to designing a video sharing website like Youtube. Curious how one would design the streaming part and housing millions of videos. </quote> ... Copied to Clipboard!
BIueJay 12/28/21 8:40:38 PM #49:	Day 26 If I was doing two questions, or if this question was the last of the the day, I would have stopped and looked up the answer since I passed my time limit. But I stuck with it. Mediums still fucking me up at times... The question is https://leetcode.com/problems/shortest-unsorted-continuous-subarray/. I'm curious how those who don't program would logically and step-by-step answer some of these leetcode questions. I think those who enjoy puzzles would love leetcode. Anyways it took me a minute but I answered the O(n) solution, the solution with sorting is super obvious. I was watching some interviews on youtube of how people go through system design questions, and I think one of my issues is that I'm not really organzied. I definitely ask clarifying questions, but I should next time write all the interviewer's answers down (on screen so the interview can see I'm doing stuff). I need to go through their answers and accordingly pick applications that match their criteria. For example, if they are telling me to design a system like Netflix, and they care more about responsiveness than consistency, then I should note and explain that I went with some NoSQL storage system because of what they specifically mentioned. I also see that the dudes on youtube just sound so much more articulate. Fuck. I need to practice these questions out loud. <cite>BIueJay posted [p:961291179] in Another da... [t:79792753]...</cite> <quote>Day 26 If I was doing two questions, or if this question was the last of the the day, I would have stopped and looked up the answer since I passed my time limit. But I stuck with it. Mediums still fucking me up at times... The question is https://leetcode.com/problems/shortest-unsorted-continuous-subarray/. I'm curious how those who don't program would logically and step-by-step answer some of these leetcode questions. I think those who enjoy puzzles would love leetcode. Anyways it took me a minute but I answered the O(n) solution, the solution with sorting is super obvious. I was watching some interviews on youtube of how people go through system design questions, and I think one of my issues is that I'm not really organzied. I definitely ask clarifying questions, but I should next time write all the interviewer's answers down (on screen so the interview can see I'm doing stuff). I need to go through their answers and accordingly pick applications that match their criteria. For example, if they are telling me to design a system like Netflix, and they care more about responsiveness than consistency, then I should note and explain that I went with some NoSQL storage system because of what they specifically mentioned. I also see that the dudes on youtube just sound so much more articulate. Fuck. I need to practice these questions out loud. </quote> ... Copied to Clipboard!
BIueJay 12/29/21 10:11:15 PM #50:	Day 27 Kind of a short day. Did a leetcode easy question https://leetcode.com/problems/binary-prefix-divisible-by-5/. Had to deal with integer overflows and change up my code. Otherwise, straight forward. Watched more youtube system design interviews. Tomorrow I have those damn online tests to do, so that will be fun. <cite>BIueJay posted [p:961318809] in Another da... [t:79792753]...</cite> <quote>Day 27 Kind of a short day. Did a leetcode easy question https://leetcode.com/problems/binary-prefix-divisible-by-5/. Had to deal with integer overflows and change up my code. Otherwise, straight forward. Watched more youtube system design interviews. Tomorrow I have those damn online tests to do, so that will be fun. </quote> ... Copied to Clipboard!
Topic List	Page List: 1, 2, 3

Current Events > Another day, another rejection from a software developer position. Time to grind (+) Yeah! (+)

Current Events > Another day, another rejection from a software developer position. Time to grind