[PR #861] Create 14.Longest Common Prefix.c #1368

Closed
opened 2026-01-29 15:19:48 +00:00 by claunia · 0 comments
Owner

Original Pull Request: https://github.com/TheAlgorithms/C/pull/861

State: closed
Merged: No


Description of Change

I have added my solution of leet code problem Longest Common Prefix.

References

Checklist

  • [x ] Added description of change
  • [x ] Added file name matches File name guidelines
  • [x ] Added tests and example, test must pass
  • [x ] Relevant documentation/comments is changed or added
  • [x ] PR title follows semantic commit guidelines
  • [x ] Search previous suggestions before making a new one, as yours may be a duplicate.
  • [ x] I acknowledge that all my contributions will be made under the project's license.

Notes:
As per the question, we will be given an array of some strings which can be of varying lengths. We only have to find first n characters which appear in each string between the indices 0 and n - 1.

**Original Pull Request:** https://github.com/TheAlgorithms/C/pull/861 **State:** closed **Merged:** No --- #### Description of Change I have added my solution of leet code problem Longest Common Prefix. <!-- Thank you for your Pull Request. Please provide a description above and review the requirements below. Contributors guide: https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md --> #### References <!-- Add any reference to previous pull-request or issue --> #### Checklist <!-- Remove items that do not apply. For completed items, change [ ] to [x]. --> - [x ] Added description of change - [x ] Added file name matches [File name guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#File-Name-guidelines) - [x ] Added tests and example, test must pass - [x ] Relevant documentation/comments is changed or added - [x ] PR title follows semantic [commit guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#Commit-Guidelines) - [x ] Search previous suggestions before making a new one, as yours may be a duplicate. - [ x] I acknowledge that all my contributions will be made under the project's license. Notes: <!-- Please add a one-line description for developers or pull request viewers --> As per the question, we will be given an array of some strings which can be of varying lengths. We only have to find first n characters which appear in each string between the indices 0 and n - 1. <a href="https://gitpod.io/#https://github.com/TheAlgorithms/C/pull/861"><img src="https://gitpod.io/button/open-in-gitpod.svg"/></a>
claunia added the pull-request label 2026-01-29 15:19:48 +00:00
Sign in to join this conversation.
1 Participants
Notifications
Due Date
No due date set.
Dependencies

No dependencies set.

Reference: starred/C#1368