Skip to content

Instantly share code, notes, and snippets.

View lifeparticle's full-sized avatar
🥥
0, 1, 2, 3…

Mahbub Zaman lifeparticle

🥥
0, 1, 2, 3…
View GitHub Profile
public static int binarySearch (int values[], int target) {
int left = 0;
int mid = 0;
int right = values.length - 1;
while (left <= right) {
mid = (left + right) / 2;
if (target == values[mid])
return mid;
{
"title": "An Introduction to Ruby Hashes",
"url": "https://towardsdatascience.com/an-introduction-to-ruby-hash-1c1c4b2dd905"
}
vs.
{
"title": "An Introduction to Ruby Hashes",
"link": "https://towardsdatascience.com/an-introduction-to-ruby-hash-1c1c4b2dd905",
posts = []
Array.prototype.forEach.call(document.getElementsByClassName("nd rk rd x"), function(post) {
postObj = {};
postObj.title = post.getElementsByTagName("a")[0].innerText;
postObj.link = post.getElementsByTagName("a")[0].href;
postObj.pubDate = post.getElementsByClassName("dv")[1].innerText;
posts.unshift(postObj);
});
import os
import re
import sys
import json
import pathlib
import requests
def compare_data(oldData, newData):
data = []
last_pub_date = oldData[-1]['pubDate']
public static boolean isPrime(int number) {
if (number < 2)
return false;
if (number == 2 || number == 3)
return true;
if(number % 2 == 0 || number % 3 == 0)
return false;
public static boolean isPrime(int number) {
if (number < 2)
return false;
if (number == 2)
return true;
if(number % 2 == 0)
return false;
public static boolean isPrime(int number) {
if (number < 2)
return false;
if (number == 2)
return true;
if(number % 2 == 0)
return false;
public static boolean isPrime(int number) {
int factorCount = 0;
for (int i = 1; i <= number; i++) {
if (number % i == 0)
factorCount++;
}
return factorCount == 2 ? true : false;
}
import os
import re
import sys
import json
import pathlib
import requests
import fuzzywuzzy
from fuzzywuzzy import fuzz
from fuzzywuzzy import process