Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Markdown & Git #1

Open
wants to merge 7 commits into
base: main
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
@@ -1 +1 @@
# rsschool-cv
https://Freemason-12.github.io/rsschool-cv
67 changes: 67 additions & 0 deletions cv.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,67 @@
#Maksat Rsymbetov

##Contact me:
* *Email:* [email protected]
* *Main GitHub Account:* https://github.com/Freemason-12
* *Second GitHub Account:* https://github.com/Maksat-Rsymbetov

##About me
Hobbyist, Linux power user, likes drawing, 3D modelling, design, coding and solving problems.

##Skills
* Java
* Go
* JavaScript
* Python (basic)
* HTML
* CSS
* Blender
* Linux, Vim

##Code Example
example of Java code
```
class Solution {
public String longestPalindrome(String s) {
int l = s.length();
ArrayList<String> ans = new ArrayList<String>();

ans.add(s.substring(0,1));

for(int i = 0; i < l - 1; i++){
if(s.charAt(i) == s.charAt(i + 1)){
for(int st = i, en = i + 1; st >= 0 && en < l; st--, en++){
if(s.charAt(st) != s.charAt(en)) {ans.add(s.substring(st + 1, en)); break;}
else if(st == 0 || en == l - 1){ans.add(s.substring(st, en + 1)); break;}
}
}
}

for(int i = 0; i < l - 2; i++){
if(s.charAt(i) == s.charAt(i + 2)){
for(int st = i, en = i + 2; st >= 0 && en < l; st--, en++){
if(s.charAt(st) != s.charAt(en)) {ans.add(s.substring(st + 1, en)); break;}
else if(st == 0 || en == l - 1){ans.add(s.substring(st, en + 1)); break;}
}
}
}

String answer = "";
for(String p: ans) if(p.length() > answer.length()) answer = p;
return answer;

}
}
```

##Work Experience
Currently working as a teacher at CRTL+A School

###Projects
* *Minesweeper game:* a traditional minesweeper 8x8 game written in JavaScript
_GitHub source code: https://github.com/Maksat-Rsymbetov/SENSEI_

##Education
Student of Suleyman Demirel Unviersity

*English level:* B2
15 changes: 15 additions & 0 deletions index.html
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
<!DOCTYPE html>
<html lang="en">

<head>
<title>RSSchool CV</title>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1">
<link href="css/style.css" rel="stylesheet">
</head>

<body>

</body>

</html>
Empty file added style.css
Empty file.