OOP Mini Project: In-Memory Database

Medium Applied OOP Mini Projects

Solve in Playground →

Problem Statement

Implement an OOP in-memory table storage system with a `Table` class that supports `insert(row)` and `select(condition_fn)` returning matching rows. Read N rows as key-value pairs (key:int, val:str), insert them, filter by value prefix, and print the count.

Input Format

Line 1: integer N. Next N lines: key and val separated by space. Last line: prefix string.

Output Format

Print the number of matching records found.

Constraints

0 <= N <= 50

Sample Input

3
1 apple
2 banana
3 apricot
a

Sample Output

Explanation

Records with keys 1 and 3 match the prefix 'a'.

Starter Code

class Table:
    def __init__(self):
        pass
    def insert(self, row):
        pass
    def select(self, cond):
        pass

if __name__ == '__main__':
    # Implement I/O logic here
    pass

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →