---
title: "Discussion on \"Solving 1920: how to store 2 numbers in 1\" | Hashnode"
description: "Discussion on \"Solving 1920: how to store 2 numbers in 1\". For LeetCode 1920, an O(n) solution wasn't good enough. It wanted O(1) space. Here's the math trick (quotients & remainders) that makes it work."
url: "https://hashnode.com/posts/solving-1920-how-to-store-2-numbers-in-1/6a78721e1c5680ecc81f7d54"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Solving 1920: how to store 2 numbers in 1](https://fortunatus-notes.hashnode.dev/solving-1920-how-to-store-2-numbers-in-1?utm_source=hashnode&utm_medium=feed)

For LeetCode 1920, an O(n) solution wasn't good enough. It wanted O(1) space. Here's the math trick (quotients & remainders) that makes it work.

Aug 9 · 10 min read · fortunatus-notes.hashnode.dev  
Updated Nov 8  
Read the article

-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#leetcode-solution](https://hashnode.com/tag/leetcode-solution)
-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#problemsolving](https://hashnode.com/tag/problemsolving)
-   [#programming-blogs](https://hashnode.com/tag/programming-blogs)

## Written by

[Fortunatus Olorunsola](https://hashnode.com/@whatisnatus27)

@whatisnatus27 · Lagos

  
[View profile](https://hashnode.com/@whatisnatus27)

a nODE TO enJOY. welcome.

I'm a Computer Science graduate and Full-Stack Developer in training. I'm trying to come out of my bubble by sharing what I'm learning—documenting my journey into software development through builds, confusion, and reflection.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
