Geico Interview Questions — 20 DSA Problems

17 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Geico LeetCode questions for software engineering interviews.

• Maximum Number of Potholes That Can Be Fixed (MEDIUM) — String, Greedy, Sorting
• Largest Palindromic Number (MEDIUM) — Hash Table, String, Greedy, Counting
• Number of Steps to Reduce a Number in Binary Representation to One (MEDIUM) — String, Bit Manipulation, Simulation
• Integer to Roman (MEDIUM) — Hash Table, Math, String
• Valid Sudoku (MEDIUM) — Array, Hash Table, Matrix
• Coin Change (MEDIUM) — Array, Dynamic Programming, Breadth-First Search
• Best Time to Buy and Sell Stock with Cooldown (MEDIUM) — Array, Dynamic Programming
• First Missing Positive (HARD) — Array, Hash Table
• Number of Spaces Cleaning Robot Cleaned (MEDIUM) — Array, Matrix, Simulation
• Path with Maximum Gold (MEDIUM) — Array, Backtracking, Matrix
• Longest Happy String (MEDIUM) — String, Greedy, Heap (Priority Queue)
• Boundary of Binary Tree (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Minimum Number of Food Buckets to Feed the Hamsters (MEDIUM) — String, Dynamic Programming, Greedy
• Count of Smaller Numbers After Self (HARD) — Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
• Decode String (MEDIUM) — String, Stack, Recursion
• Roman to Integer (EASY) — Hash Table, Math, String
• Minimum Moves to Spread Stones Over Grid (MEDIUM) — Array, Dynamic Programming, Breadth-First Search, Matrix
• Best Time to Buy and Sell Stock II (MEDIUM) — Array, Dynamic Programming, Greedy
• Cinema Seat Allocation (MEDIUM) — Array, Hash Table, Greedy, Bit Manipulation
• Remove All Adjacent Duplicates In String (EASY) — String, Stack