forked from mre/the-coding-interview
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request mre#87 from abm9838/AddMoreSol
Add more sol
- Loading branch information
Showing
2 changed files
with
39 additions
and
0 deletions.
There are no files selected for viewing
This file contains 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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,22 @@ | ||
#include <stdio.h> | ||
|
||
int main() { | ||
char string[100] = "Hello hello asdsa"; //Enter your string here | ||
|
||
|
||
int i, letters, longest = 0, longest_pos = 0; | ||
|
||
for (i = 0; string[i] != '\0'; i++) { | ||
for (letters = 0; string[i] != '\0' && string[i] != ' '; i++) { | ||
letters++; | ||
} | ||
if (letters > longest) { | ||
longest = letters; | ||
longest_pos = i - longest; | ||
} | ||
} | ||
printf("longest word: %d letters, '%.*s'\n", | ||
longest, longest, string + longest_pos); | ||
|
||
return 0; | ||
} |
This file contains 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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,17 @@ | ||
#include<stdio.h> | ||
int sum(int arr[], int n) | ||
{ | ||
int sum = 0; | ||
for (int i = 0; i < n; i++) | ||
sum += arr[i]; | ||
|
||
return sum+n; | ||
} | ||
|
||
int main() | ||
{ | ||
int arr[] = {1,2,3,4}; | ||
int n = sizeof(arr) / sizeof(arr[0]); | ||
printf("%d",sum(arr, n)); | ||
return 0; | ||
} |