[PR #515] [CLOSED] Improve space complexity from O(n) to O(1) #933

New Issue

claunia · 2026-01-29T15:16:20Z

claunia commented

2026-01-29 15:16:20 +00:00

📋 Pull Request Information

Original PR: https://github.com/TheAlgorithms/C/pull/515
Author: @rcmarc
Created: 2/12/2020
Status: ❌ Closed

Base: master ← Head: patch-1

📝 Commits (1)

4931c87 Improve space complexity from O(n) to O(1)

📊 Changes

1 file changed (+4 additions, -2 deletions)

View changed files

📝 misc/Fibonacci_DP.c (+4 -2)

📄 Description

No description provided

_{🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.}

## 📋 Pull Request Information **Original PR:** https://github.com/TheAlgorithms/C/pull/515 **Author:** [@rcmarc](https://github.com/rcmarc) **Created:** 2/12/2020 **Status:** ❌ Closed **Base:** `master` ← **Head:** `patch-1` --- ### 📝 Commits (1) - [`4931c87`](https://github.com/TheAlgorithms/C/commit/4931c8759fd6afc3c4857d74f613c838a7a594d0) Improve space complexity from O(n) to O(1) ### 📊 Changes **1 file changed** (+4 additions, -2 deletions) <details> <summary>View changed files</summary> 📝 `misc/Fibonacci_DP.c` (+4 -2) </details> ### 📄 Description _No description provided_ --- <sub>🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.</sub>

claunia added the pull-request label 2026-01-29 15:16:20 +00:00

claunia referenced this issue

2026-01-29 15:21:06 +00:00

[PR #933] fix: update value at index and return `SUCCESS` (#932) #1471

Sign in to join this conversation.

1 Participants

Notifications

Due Date

No due date set.

Dependencies

No dependencies set.

Reference: starred/C#933