SoFi Interview Questions — 18 DSA Problems

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

Most frequently asked SoFi LeetCode questions for software engineering interviews.

• Minimum Number of Steps to Make Two Strings Anagram (MEDIUM) — Hash Table, String, Counting
• Minimum Window Substring (HARD) — Hash Table, String, Sliding Window
• Asteroid Collision (MEDIUM) — Array, Stack, Simulation
• Longest Mountain in Array (MEDIUM) — Array, Two Pointers, Dynamic Programming, Enumeration
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
• Roman to Integer (EASY) — Hash Table, Math, String
• Maximum Number of Non-overlapping Palindrome Substrings (HARD) — Two Pointers, String, Dynamic Programming, Greedy
• Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
• Two Sum (EASY) — Array, Hash Table
• Degree of an Array (EASY) — Array, Hash Table
• Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Flatten a Multilevel Doubly Linked List (MEDIUM) — Linked List, Depth-First Search, Doubly-Linked List
• Palindromic Substrings (MEDIUM) — Two Pointers, String, Dynamic Programming
• Subarray Product Less Than K (MEDIUM) — Array, Binary Search, Sliding Window, Prefix Sum
• Find the Winner of the Circular Game (MEDIUM) — Array, Math, Recursion, Queue, Simulation
• Top K Frequent Elements (MEDIUM) — Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect