File tree Expand file tree Collapse file tree 2 files changed +5
-2
lines changed
Searching/KMP algorithm for pattern searching Expand file tree Collapse file tree 2 files changed +5
-2
lines changed Original file line number Diff line number Diff line change 1
1
# Implement KMP algorithm for pattern search
2
2
3
- ## Time Complexity O(N) which best possible time we can get in any pattern serching algorithm
3
+ ##
4
+
5
+ #### Time Complexity O(N) which best possible time we can get in any pattern serching algorithm
4
6
5
7
This Function return indext of first element of match pattern elements as output.
6
8
7
9
10
+
8
11
9
12
### Example 1:
10
13
```
Original file line number Diff line number Diff line change @@ -12,7 +12,7 @@ export default function Categories(props) {
12
12
axios . get ( 'https://api.github.com/repos/skully-coder/competitiveprogramming/contents' )
13
13
. then ( response => {
14
14
response . data . forEach ( content => {
15
- if ( content . name !== "website" && ! content . name . startsWith ( '.' ) && content . type === "dir" ) {
15
+ if ( ! content . name . startsWith ( '.' ) && content . type === "dir" ) {
16
16
setCategories ( categories => categories . concat ( { name : content . name , url : content . git_url } ) )
17
17
}
18
18
} )
You can’t perform that action at this time.
0 commit comments