Skip to content

Instantly share code, notes, and snippets.

Availbale for Hire

Oluka Denis OlukaDenis

Availbale for Hire
View GitHub Profile
OlukaDenis / AppSignatureHashHelper.kt
Last active Jan 6, 2023
A helper that generates an 11 alphanumeric hash for SMS Retriever API
View AppSignatureHashHelper.kt
import android.annotation.TargetApi
import android.content.Context
import android.content.ContextWrapper
import android.util.Base64.*
import timber.log.Timber
import java.nio.charset.StandardCharsets
View pseudo-class-6.css
.list-item::after {
background-image: url('data:image/svg+xml;charset=utf-8,<svg xmlns="" viewBox="0 0 16 16"><path fill="none" stroke="black" stroke-width="4" stroke-miterlimit="10" d="M4.75 1.5l6.5 6.5-6.5 6.5"/></svg>');
background-size: 8px 8px;
background-repeat: no-repeat;
content: '';
display: inline-block;
height: 8px;
margin-left: 4px;
width: 16px;
View pseudo-class-5.css
background-color: slategrey;
View pseudo-class-4.css
background-color: slategrey;
View pseudo-classes-3.css
.list-item:hover {
background-color: aliceblue;
.list a:link{
color: black;
.list a:active{
color: green;
View understanding-pseudo-classes-2.html
<div class="container">
<h1>Top 5 Languages </h1>
<p>In the last year, developers collaborated in more than 370 primary languages on GitHub. The following are the the top five languages with more contributions on GitHub</p>
<div class="list">
<li class="list-item"> <a href="#"> Javascript </a> </li>
<li class="list-item"> <a href="#"> Python </a> </li>
<li class="list-item"> <a href="#"> Java </a> </li>
<li class="list-item"> <a href="#"> PHP </a> </li>
<li class="list-item"> <a href="#"> C# </a> </li>
View pseudo-class-1.css
selector:pseudo-class {
OlukaDenis / palidnrome-checker.js
Created Aug 17, 2019
Checking for a palindrome using Javascript
View palidnrome-checker.js
function palindromeCheck(){
let word = prompt("Write a word:")
let collection = []
//adding letters from word to collection
for(let i = 0; i < word.length; i++ ){
this.front = function(){
return collection[0]
OlukaDenis / stair-case.js
Created Aug 17, 2019
A simplest method to solve Hackerrank stairCase problem.
View stair-case.js
function stairCase(n){
let arr = Array(n-1).fill(' ')
for (let i = n-1; i >= 0; i--) {
arr[i] = '#';
OlukaDenis / diagonal-difference.js
Created Aug 17, 2019
Solution for HackerRank > Algorithms > Warmup > Diagonal difference
View diagonal-difference.js
function diagonalDifference(arr) {
let left_diagonal = 0
let right_diagonal = 0
let total = 0
for (let i = 0; i < arr.length; i++){
left_diagonal += arr[i][i]
right_diagonal += arr[arr.length - 1 - i][i]