omonimus1/HackerRank-Solutions

My own HackerRank coding interview solutions

What you can find in this repository

Here you will be able to find my HackerRank solutions to many challenghes, using C++, JavaScript, Python and SQL

Correlated Materials

Visit my Competitive programming guide and see also my HackerRank, GeeksForGeeks, Leetcode and other online judges solutions

Index

• SQL
• Python
• C++
• Problem Solving
• 30 days of code
• 10 days of Javascript
• Problem Solving
• Interview Preparation Kit

🔗 Links - Get my Linktree

Apply for a mentorship session with me (get a 7 days free trial)

Support me

Paypal Me

SQL

Category	Name	Database	Solution
Aggregation -Count	Revising aggregations the count	MYSQL	SQL
SELECT	Weather Observation Station 16	MYSQL	SQL
SELECT	Weather Observation Station 2	MYSQL	SQL
SELECT	Weather Observation Station 13	MYSQL	SQL
SELECT	Weather Observation Station 14	MYSQL	SQL
Basic select	Revising-Select 1	ORACLE	SQL
Basic select	Revising-Select 2	ORACLE	SQL
Basic select	Weather observation	ORACLE	SQL
Basic select	Weather observation-6	MySQL	SQL
Basic select	Weather observation-8	MySQL	SQL
Basic select	Weather observation-9	MySQL	SQL
Basic select	Weather observation-11	MySQL	SQL
Aggregation	Sum function	ORACLE	SQL
Aggregation	Japanese population	ORACLE	SQL
Basic Join	Average Continent Population	MYSQL	SQL
Basic Join	Asian Population	MYSQL	SQL
Basic Join	African Cities	MYSQL	SQL

30 Days Of Code

Name	C++	Python	Java
Hello World	C++	PYTHON	Java
Loops	C++	PYTHON	Java
DataTypes		PYTHON
Operators	C++	N/A	JAVA
Array			Python
LinkedList		C++	Python
30-dictionaries-and-maps	C++
30-dictionaries-and-maps	C++

Problem Solving

Name	C++	Python
Plus Minus		Python
HackerRank tweets		Python
Diagonal Difference	C++
Time conversion	C++
Insert not in double linkedln list	C++
Min max sum	PY
Array-DS	C++	Python
Print Linked List	C++	Python
Preorder Traversal Tree	C++	Python
PostOrder Traversal Tree	C++
Insert Node at the head of Linked List	C++	Python
Print reverse of a linked list	C++
Plus Minus	C++	Python
Get the value of thenode at a specific position from the tail	C++
Reverse Linked list	C++
Compare two list	C++
Detect Loop in a Linked List	C++	Python
Insert node in a specific position	C++
Insert at the tail of a linked list	C++
Tree Inorder	C++
Tree level traversal	C++
Binary search insertion	C++
Delete ndoe from a linked list	C++
Strong passsword	C++
CamelCase	C++
Find the media	C++
Beautiful binary string(substring search)	C++
cats and a mouse	C++
Level order traverse of a Binary Tree	C++
30-Sorting	C++
Divisible sum pair	C++
Apple and orange	PYTHON
FInd digits	C++
Angry professor	C++
Tutorial Intro	C++
Bon Appetit	C++
Sock Merchant	C++
Circular array rotation	C++
Equality in a array	C++
Grading	C++
Kangooro	C++
Panagrams	C++
Alternating characters	C++
ice Cream Parlor	C++
Lonely-integer	C++
Cpmpare tripletes	C++

| |C++||

Python

Category	Name	Solution
String	String validation	Python
Introduction	Hello World	Python
I/O	Python-print	Python
Data Structure	List	Python
Python Loops	Loops	Python
Split and join	Strings	Python
Swap case	Python
Python mutations	Python
Capitalize	Python
Validating phone number	Python
Find the percentage	Python

| |Python||

10 Days Javascript

Day	Name	Solution
0	Hello world	JS
1	Data types	JS
1	Arithmetic Operators	JS
1	Function	JS
1	If-else	JS
1	Let and Cost	JS
2	Loops	JS
2	Conditional switch	JS
4	Recatangle Object (Tutorial)	JS
4	Count Objects (Tutorial)
		JS

C++

Name	Solution
Data Types	C++
Array left shift	C++
Min Max sum	C++
Preoder Traversal Tree	C++
Struct	C++
Vector Sort	C++
Vector Erase	C++
SET	C++
Map	C++
Vector-Erase 2	C++
C-tutorial pointer	C++

| |C++|

Interview preparation kit

Name	Solution
Detect Cycle in Linked List	C++
Pairs	C++
Height of a tree	C++

How to contribute?

1. Fork the repository
2. Do the desired changes (add/delete/modify)
3. Make a pull request

When to contribute?

1. If there is no solution to a problem in the main branch.
2. If your solution is asymptotically faster than the one in the main branch.
3. If your algorithm is of the same time complexity but with reduced code size. In this case, comment out the original solution and make a pull request with your solution.
4. If you have another method of solving the problem which is asymptotically slower than the original method then, comment your solution in the main file and make a pull request.

Mind that

Constructive criticisms or code reviews of any kind are very much welcome.

If you have any questions about the solutions you can find here, feel free to contact me at: davidepollicino2015@gmail.com

Support

Support me to get more material like this. PAYPAL ME

Apply for a mentorship session with me (get a 7 days free trial)