SIG Software Engineer Interview Questions

Need some suggestions for onsite SWE interview. What can I expect for the tech and system design rounds? Recruiter told there will be 2hr algorithmic focused interview and 1hr design round. Really app

LeetCode #2817: Minimum Absolute Difference Between Elements With Constraint. Difficulty: Medium. Topics: Array, Binary Search, Ordered Set. Asked at SIG in the last 6 months.

LeetCode #1743: Restore the Array From Adjacent Pairs. Difficulty: Medium. Topics: Array, Hash Table, Depth-First Search. Asked at SIG in the last 6 months.

LeetCode #48: Rotate Image. Difficulty: Medium. Topics: Array, Math, Matrix. Asked at SIG in the last 6 months.

Any idea on what to expect for the CodeSignal assessment for SIG Summer 2024 SWE Internship?

For the SIG SWE Internship Online Technical Assessment (for undergrads), does anyone know on what basis they score your code? Eg runtime, time it took to write the program, etc?

## Problem Given a block of unstructured text (e.g., a financial news article), extract all valid US stock ticker symbols. A ticker is 1-5 uppercase letters. However, not every sequence of uppercase letters is a ticker — you must filter using a provided set of known valid tickers. ```python def find_tickers( text: str, valid_tickers: set[str] ) -> list[str]: """Return list of tickers found, in order of first appearance, deduplicated.""" ... ``` ``` text = "Investors are watching AAPL and GOOGL closely. The FDA approved MRNA." valid_tickers = {"AAPL", "GOOGL", "MRNA", "TSLA"} Output: ["AAPL", "GOOGL", "MRNA"] ``` ## Follow-ups 1. How do you distinguish the ticker `I` (Intelsat) from the word "I" in normal English text? What heuristics help? 2. Tickers can appear with punctuation around them (e.g., "(AAPL)", "AAPL,"). How does your regex handle this? 3. The valid_tickers set has 10,000 entries. Does set lookup remain O(1) in Python? How does this affect overall complexity? 4. A new ticker was listed today and is not yet in `valid_tickers`. How would you keep your ticker list fresh without manual updates?

## Problem Design and implement a hashmap from scratch with custom hashing for a new programming language, supporting insert, delete, and lookup operations. ## Likely LeetCode equivalent No direct match. ## Tags hash_table, design, coding, oa

## Problem You have a movie catalog as a list of movie objects. Implement a filter and ranking engine: - `filter_movies(genre=None, min_rating=None, max_year=None, director=None)` — return movies matching ALL provided criteria. - `rank_by(field, descending=True)` — sort the filtered results by a given field. - `top_n(n)` — return the top N results after filtering and ranking. ```python from dataclasses import dataclass @dataclass class Movie: title: str genre: str year: int rating: float director: str class MovieFilter: def __init__(self, catalog: list[Movie]): ... def filter_movies(self, **criteria) -> 'MovieFilter': ... def rank_by(self, field: str, descending: bool = True) -> 'MovieFilter': ... def top_n(self, n: int) -> list[Movie]: ... ``` ``` catalog = [Movie("Inception","Sci-Fi",2010,8.8,"Nolan"), ...] result = ( MovieFilter(catalog) .filter_movies(genre="Sci-Fi", min_rating=7.0) .rank_by("rating") .top_n(5) ) ``` ## Follow-ups 1. Your `filter_movies` returns a new `MovieFilter` for chaining. How does lazy evaluation help when the catalog has 1 million entries? 2. Add a `search(query)` method that does fuzzy title matching. What algorithm do you use (Levenshtein, trigram)? 3. How would you support OR conditions (e.g., genre=Sci-Fi OR genre=Action)? 4. Persist the catalog in a SQLite database. Rewrite `filter_movies` to generate a SQL `WHERE` clause instead.

## Problem Simulate a battleship-style sea battle game on a grid, detecting hits and misses or computing game state after a sequence of moves. ## Likely LeetCode equivalent No direct match. ## Tags matrix, simulation, coding, oa