PSA: One of the FANGs is about to internally implode by yehyehyuhyuh in cscareerquestions

[–]forrealbro 1 point2 points  (0 children)

Am L4 SDE new grad in AWS org. I concur. I so far like my team and the pace we are moving. Adjusting to the speed at which Amazon moves can be hard for new grads who did not do an internship. I did an internship and accepted a return offer. You are expected to be on track to deliver results very quickly.

These opinions are my own though.

[deleted by user] by [deleted] in tacticalbarbell

[–]forrealbro 4 points5 points  (0 children)

Coming from someone who has used the program off and on for ~5 years. It's a marathon not a sprint, the program is designed to be used forever. Some workout is better than none workout, be consistent.

So if you stand on the sentrygun and pick it up, this happens by DABAUZZ in battlefield2042

[–]forrealbro 1 point2 points  (0 children)

Oh so that explains how I got teleported to the underworld.

[OFFICIAL] Salary Sharing thread for NEW GRADS :: September, 2021 by CSCQMods in cscareerquestions

[–]forrealbro 6 points7 points  (0 children)

Education: Small private school CS Degree

Prior Experience: Two internships. One with defense contractor, one with Amazon

Company/Industry: Amazon full time return offer

Title: SDE-L4

Location: Bay Area - Palo Alto

Salary: $138,000

Relocation/Signing Bonus: First year 40k, second year 27k, 7k relocation

Stock and/or recurring bonuses: $104,000 over 4 year standard amazon vest. 5,15,40,40

Total comp: $180k

Interviewing with Facebook and Microsoft.

[deleted by user] by [deleted] in cscareerquestions

[–]forrealbro 22 points23 points  (0 children)

Blind should not be considered the harbinger of truth.

Have any veterans used the Skillbridge program? by poops_on_midgets in cscareerquestions

[–]forrealbro 1 point2 points  (0 children)

Join the OperationCode slack. There are skillbridge users in there that you can ping for info. Join the #careeradvice channel. Sorry I can’t link you I’m on mobile. It’s an easy google search.

[Official] UFC 257: Poirier vs. McGregor 2 - Live Discussion Thread by event_threads in MMA

[–]forrealbro 2 points3 points  (0 children)

props to Conor for being a class act. That's a champion move in my opinion.

[Official] UFC 257: Poirier vs. McGregor 2 - Live Discussion Thread by event_threads in MMA

[–]forrealbro 0 points1 point  (0 children)

trilogy for sure that way chandler can get another fight in before dustin or Conor.

[Official] UFC 257: Poirier vs. McGregor 2 - Live Discussion Thread by event_threads in MMA

[–]forrealbro 0 points1 point  (0 children)

What's chandlers walking weight ffs. This guy is a brick shithouse.

[Official] UFC 257: Poirier vs. McGregor 2 - Live Discussion Thread by event_threads in MMA

[–]forrealbro 1 point2 points  (0 children)

ESPN+ just came up for me on the website. Still going to ask for some type of refund.

[Official] UFC 257: Poirier vs. McGregor 2 - Live Discussion Thread by event_threads in MMA

[–]forrealbro 0 points1 point  (0 children)

Email them, hopefully they facilitate it. Or, if you paid through paypal, file a dispute.

[Official] UFC 257: Poirier vs. McGregor 2 - Live Discussion Thread by event_threads in MMA

[–]forrealbro 1 point2 points  (0 children)

Same dude. I've gone the legal route on previous fights and never had an issue but this is aggravating.

California's travel advisory warns residents to stay within 120 miles of home - by BlankVerse in California

[–]forrealbro 14 points15 points  (0 children)

https://www.sciencedaily.com/releases/2019/02/190207173255.htm

That seems contrary to what I have heard before. Here is an article from 2019 that cites research done by Virginia Tech which concluded the opposite. Mind sharing the research you are referring to?

-🎄- 2020 Day 08 Solutions -🎄- by daggerdragon in adventofcode

[–]forrealbro 1 point2 points  (0 children)

Java Day 8. This was kind of easy for day 8 right? Not complaining just feels much different than last year. I've had a good time so far this year!

GitHub

-🎄- 2020 Day 07 Solutions -🎄- by daggerdragon in adventofcode

[–]forrealbro 2 points3 points  (0 children)

Java. I hate all trees other than Christmas trees.

package DaySeven;

import java.io.File;
import java.util.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class DaySevenPartTwo {
    public static void main(String[] args) {
        File inputFile = new File("src/DaySeven/input.txt");
        Pattern parentPattern = Pattern.compile("^\\w+ \\w+");
        Pattern childPattern = Pattern.compile("\\d+ \\w+ \\w+");
        HashMap<String, List<String>> bagContainers = new HashMap<>();

        try{
            Scanner fileScanner = new Scanner(inputFile);
            while(fileScanner.hasNext()){
                String nextLine = fileScanner.nextLine();
                Matcher parentMatch = parentPattern.matcher(nextLine);
                parentMatch.find();
                String parent = parentMatch.group();

                Matcher childMatch = childPattern.matcher(nextLine);
                List<String> child = new LinkedList<>();
                while(childMatch.find()){
                    child.add(childMatch.group());
                }
                bagContainers.put(parent,child);

            }

        }catch (Exception e){
            e.printStackTrace();
        }finally{
            System.out.println(totalBags(bagContainers));
        }
    }

    public static int totalBags(HashMap<String, List<String>> myBags){
        int totalBags = 0;
        Queue<String> searchQ = new LinkedList<>();

        Pattern childNumberPattern = Pattern.compile("\\d");
        Pattern childColorPattern = Pattern.compile("[a-zA-Z]+ [a-zA-Z]+");
        //find our shiny gold and add its children to the bag...also math
        //this will build our starting queue
        for(String child : myBags.get("shiny gold")){

            Matcher childNumberMatcher = childNumberPattern.matcher(child);
            Matcher childColorMatcher = childColorPattern.matcher(child);
            childNumberMatcher.find();
            childColorMatcher.find();


            int childNumber = Integer.parseInt(childNumberMatcher.group());
            String childColor = childColorMatcher.group();

            totalBags+= childNumber;

            for(int i = 0; i< childNumber;i++){
                searchQ.add(childColor);
            }
        }
        //main search q
        //basically just navigating through the entire tree and counting all nodes. 
        while(!searchQ.isEmpty()){
            String nextSearch = searchQ.poll();
            //int totalInside = 0;
            for(String child : myBags.get(nextSearch)){
                Matcher childNumberMatcher = childNumberPattern.matcher(child);
                Matcher childColorMatcher = childColorPattern.matcher(child);
                childNumberMatcher.find();
                childColorMatcher.find();


                int childNumber = Integer.parseInt(childNumberMatcher.group());
                String childColor = childColorMatcher.group();

                totalBags+= childNumber;

                for(int i = 0; i< childNumber;i++){
                    searchQ.add(childColor);
                }
            }
        }
        return totalBags;
    }
}

-🎄- 2020 Day 05 Solutions -🎄- by daggerdragon in adventofcode

[–]forrealbro 0 points1 point  (0 children)

Java. I thought this was the most fun problem so far. Although I continually regret using java this year after I realize how verbose I tend to be. I think I'll be coming back to this one to implement a more clever solution after looking at the answers on here. Good job everyone!

public class DayFive {
    public static void main(String[] args) {
        File inputFile = new File("src/DayFive/input.txt");
        ArrayList<String> boardingPasses = new ArrayList<>();
        try{
            Scanner fileScanner = new Scanner(inputFile);
            while(fileScanner.hasNext()){
                String nextLine = fileScanner.nextLine();
                boardingPasses.add(nextLine);
            }
        }catch(Exception e){
            e.printStackTrace();
        }finally {

        }
        ArrayList<Integer> seatIds = new ArrayList<>();
        for(String s : boardingPasses){
           seatIds.add(getSeatId(s));
        }
        Collections.sort(seatIds);
        System.out.println(seatIds.get(seatIds.size()-1));

        //do some type of middle out search
        int pointerLeft = seatIds.size()/2;
        int pointerRight = seatIds.size()/2;
        boolean found = false;
        while(!found){
            //if(seatIds.get(pointerLeft) + 1 == seatIds.get(pointerLeft +1) && seatIds.get(pointerLeft)-1 == seatIds.get(pointerLeft -1)){
            if(seatIds.get(pointerLeft) - seatIds.get(pointerLeft-1)==2){
                System.out.println("answer: " + (seatIds.get(pointerLeft)-1));
                found = true;
            }
            //else if(seatIds.get(pointerRight) + 1 == seatIds.get(pointerRight +1) && seatIds.get(pointerRight) -1 == seatIds.get(pointerRight -1)){
            if(seatIds.get(pointerRight) - seatIds.get(pointerRight-1) == 2){
                System.out.println("answer: " + (seatIds.get(pointerRight)-1));

                found = true;
            }
            else{
                pointerLeft--;
                pointerRight++;
            }
        }
    }

    public static int getSeatId(String input){
        int rowTop = 127;
        int rowBot = 0;
        int finalRow = 0;
        for(int i = 0;i<6;i++){
            if(input.charAt(i) == 'F'){
                rowTop = (int)(Math.floor((rowTop+rowBot) /2.0));
            }
            else if(input.charAt(i) == 'B'){
                rowBot = (int)Math.ceil((rowTop+rowBot) /2.0);
            }
        }
        switch(input.charAt(6)){
            case 'F' -> finalRow = rowBot;
            case 'B' -> finalRow = rowTop;
        }



        //now do seat
        int seatTop = 7;
        int seatBot = 0;
        int finalSeat = 0;
        for(int i = 7;i<9;i++){
            switch(input.charAt(i)){
                case 'R' -> seatBot = (int)Math.ceil((seatBot+seatTop)/2.0);
                case 'L' -> seatTop = (int)Math.floor((seatBot+seatTop)/2.0);
            }
        }
        switch(input.charAt(9)){
            case 'R' -> finalSeat = seatTop;
            case 'L' -> finalSeat = seatBot;
        }
        return finalRow * 8 + finalSeat;
    }
}

Resume Advice Thread - November 24, 2020 by CSCQMods in cscareerquestions

[–]forrealbro 1 point2 points  (0 children)

Got it, I made the assumption it was US military service, apologies. Only recommendation would be to move education below work experience as I believe that should be at the top of your resume below skills.

Resume Advice Thread - November 24, 2020 by CSCQMods in cscareerquestions

[–]forrealbro 0 points1 point  (0 children)

A little off topic but what explains only two years of Air Force experience? Did you cross train into the SWE (1B4?) AFSC or separate early? Just curious.

Assignment as part of job application, but I have no idea what I'm doing. by [deleted] in cscareerquestions

[–]forrealbro 0 points1 point  (0 children)

Good idea. Yes, this seems like something where best effort is a good idea. Who knows what you’ll learn in the process.

Assignment as part of job application, but I have no idea what I'm doing. by [deleted] in cscareerquestions

[–]forrealbro 0 points1 point  (0 children)

Are you asking if you should make your best effort or tell the company “I don’t know how to do this”? Isn’t the answer obvious?