Efficient data structures in Blockchain / Solidity - Time & Space Complexity

Time Complexity: Efficient data structures

O(1)

Understanding Time Complexity

When working with blockchain, choosing the right data structure helps your program run faster. We want to see how the time to do tasks changes as the data grows.

How does the choice of data structure affect the speed of common operations?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

// Simple mapping to store balances
mapping(address => uint) balances;

function updateBalance(address user, uint amount) public {
  balances[user] = amount;
}

function getBalance(address user) public view returns (uint) {
  return balances[user];
}
    

This code stores and retrieves user balances using a mapping, which is like a fast lookup table.

Identify Repeating Operations

• Primary operation: Direct access to mapping entries (no loops)
• How many times: Each access happens once per call, no repeated scanning

How Execution Grows With Input

Looking up or updating a balance takes about the same time no matter how many users there are.

Input Size (n)	Approx. Operations
10	1
100	1
1000	1

Pattern observation: The time stays constant even as the number of users grows.

Final Time Complexity

Time Complexity: O(1)

This means each balance update or lookup takes the same short time, no matter how many users exist.

Common Mistake

[X] Wrong: "Looking up a user's balance takes longer as more users are added because the data grows."

[OK] Correct: Mappings in blockchain work like a direct address book, so each lookup is quick and does not slow down with more users.

Interview Connect

Understanding how data structures affect speed shows you can write smart, efficient blockchain code. This skill helps you build apps that work well even as they grow.

Self-Check

"What if we replaced the mapping with an array and searched for the user's balance each time? How would the time complexity change?"

Practice

1. Which data structure is best for quickly finding a user's balance by their blockchain address?

easy

A. Array

B. Mapping (key-value pairs)

C. Struct

D. Linked list

Solution

1. Step 1: Understand the need for quick lookup

   We want to find a balance by address fast, so we need a structure that supports direct access by key.

2. Step 2: Identify the best data structure

   Mappings provide key-value pairs allowing O(1) access by address, unlike arrays or structs which require searching.

3. Final Answer:

   Mapping (key-value pairs) -> Option B

4. Quick Check:

   Fast key-based lookup = Mapping [OK]

Hint: Use mappings for direct key lookups in blockchain [OK]

Common Mistakes:

• Choosing arrays which require looping to find an address
• Using structs alone without a key for lookup
• Thinking linked lists are efficient for random access

2. Which of the following is the correct syntax to declare a mapping from address to uint in Solidity?

easy

A. mapping(address => uint) balances;

B. mapping(address, uint) balances;

C. mapping[address] uint balances;

D. mapping{address: uint} balances;

Solution

1. Step 1: Recall Solidity mapping syntax

   Mappings use the syntax mapping(keyType => valueType) variableName;

2. Step 2: Match the correct syntax

   mapping(address => uint) balances; matches this exactly: mapping(address => uint) balances;

3. Final Answer:

   mapping(address => uint) balances; -> Option A

4. Quick Check:

   Correct mapping syntax uses '=>' [OK]

Hint: Remember mapping uses '=>' between key and value types [OK]

Common Mistakes:

• Using commas instead of '=>' in mapping
• Using square brackets or curly braces incorrectly
• Omitting the semicolon at the end

3. What will be the output of this Solidity code snippet?

struct User { uint id; string name; }
User[] users;
users.push(User(1, "Alice"));
users.push(User(2, "Bob"));
string memory name = users[1].name;

medium

A. "Alice"

B. Empty string

C. Compilation error

D. "Bob"

Solution

1. Step 1: Understand array indexing

   Arrays start at index 0, so users[0] is Alice, users[1] is Bob.

2. Step 2: Identify the accessed element

   The code accesses users[1].name, which is "Bob".

3. Final Answer:

   "Bob" -> Option D

4. Quick Check:

   Index 1 in array = "Bob" [OK]

Hint: Remember arrays start at zero index [OK]

Common Mistakes:

• Confusing index 1 with index 0
• Assuming structs print as variable names
• Expecting compilation error due to string usage

4. Identify the error in this Solidity code snippet:

mapping(address => uint) balances;
function addBalance(address user, uint amount) public {
  balances[user] += amount;
}

medium

A. Cannot use '+=' on mapping values

B. Function lacks visibility modifier

C. No initialization needed for mapping values

D. Mapping keys must be uint, not address

Solution

1. Step 1: Check mapping usage

   Mappings default to zero for uint values if key not set, so no initialization needed.

2. Step 2: Verify function and operation

   Using '+=' on balances[user] is valid; function has public visibility.

3. Final Answer:

   No initialization needed for mapping values -> Option C

4. Quick Check:

   Mapping uint defaults to 0, so '+=' works [OK]

Hint: Mapping values default to zero, no init needed [OK]

Common Mistakes:

• Thinking mapping values must be initialized before use
• Confusing visibility modifiers
• Assuming keys must be uint instead of address

5. You want to store user profiles with id, name, and balance, and quickly find a profile by id. Which data structure combination is most efficient in Solidity?

hard

A. Mapping from id to struct

B. Array of structs only

C. Struct with embedded array

D. Linked list of structs

Solution

1. Step 1: Analyze the need for quick lookup by id

   Quick lookup by id requires direct access, which arrays or linked lists cannot provide efficiently.

2. Step 2: Choose the best data structure

   Mapping from id to struct allows O(1) access to user profiles by id, combining grouping (struct) and fast lookup (mapping).

3. Final Answer:

   Mapping from id to struct -> Option A

4. Quick Check:

   Fast key access + grouped data = mapping to struct [OK]

Hint: Use mapping from id to struct for fast profile lookup [OK]

Common Mistakes:

• Using arrays which require looping to find id
• Using linked lists which are slow for random access
• Embedding arrays inside structs without mapping