Repository navigation
Solution for 28th problem - #562
Closed
ViIsNotDev wants to merge 4 commits into
Closed
ViIsNotDev wants to merge 4 commits into
ViIsNotDev wants to merge 4 commits into
Conversation
…n_a_string to correct the speaking of the occurrence word
|
I can tell this is your first pull request! Thank you I'm so honored. 🎉🎉🎉 I'll take a look at it ASAP! |
…the current name of the solution file
Contributor
Author
|
what even happened with .github/scripts/validate_pr.py |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
this PR adds a LeetCode problem solution with an implementation of the algorithm for the 28th LeetCode problem
Problem 28 : Find the First Occurrence
info about the problem:
difficulty : easy
approach : a built-in std::string find function
feature : one of the fastest way to find the substring in the substring, and available for everyone with available std::string class
time complexity : O(1)
space complexity : O(2)
dependencies
no external dependencies required. everything used is in C++ STL
checklist
[x] added problem and solution under correct topic
[x] specified time and space complexity
[x] added test cases
[x] tested locally and passes all test cases