Not Worth The Money
Not Worth The Money
Flexible PTO, decent pay. Always hiring new people.
Laid off tons of people. Management doesn’t care about contractors. Bad place for professional development and growth. Updates new policies for employees almost every month, and it gives employees a headache. Most people are quitting and looking for new jobs due to a toxic work environment and rude managers in most departments. Beware.
Additional Ratings
Was this helpful?
GEICO Interview Experiences
Software Engineer
Multiple technical interviews with coding, and it was not too bad to do them. They were all virtual and with a code pad-like system. I could use any language that I wanted, which was also a plus.
Software Engineer
The first application is standard. Once your resume, cover letter, and application are reviewed, a recruiter emails you a set of short answer questions and asks for transcripts. After all of that is reviewed, they will ask for projects you have worke
Software Engineer
Got it. Here’s a tight, high-yield prep pack for your GEICO Coding Round 1 (Codility, Wed Sep 10, 2025, 9:00–9:45 AM ET). Game plan (45 min): * 0–2 min: Read both problems; pick the one you can solve in O(n) first. * 2–25 min: Implement #1 with
Software Engineer
Chevy Chase, Maryland, United StatesOctober 1, 2023Multiple technical interviews with coding, and it was not too bad to do them. They were all virtual and with a code pad-like system. I could use any language that I wanted, which was also a plus.
Software Engineer
Chevy Chase, Maryland, United StatesOctober 1, 2021The first application is standard. Once your resume, cover letter, and application are reviewed, a recruiter emails you a set of short answer questions and asks for transcripts. After all of that is reviewed, they will ask for projects you have worke
Software Engineer
New York, New York, United StatesSeptember 6, 2025Got it. Here’s a tight, high-yield prep pack for your GEICO Coding Round 1 (Codility, Wed Sep 10, 2025, 9:00–9:45 AM ET). Game plan (45 min): * 0–2 min: Read both problems; pick the one you can solve in O(n) first. * 2–25 min: Implement #1 with
