What do you want to save?
Add Code snippet
New code examples
-
C 2021-09-25 15:51:04
BlockChain in c
int hash(); void printStruct(); void printChain(); void printWallet(); void setLocation(); int Random(); int rand(); int getBlock(); void printNewChain(); struct Block{ int locationBefore; int machineID; int locationCurrent; }; int Random(int lower, int u... Add solution -
Javascript 2021-09-25 14:42:05
download non downloadable pdf google drive
let jspdf = document.createElement("script"); jspdf.onload = function () { let pdf = new jsPDF(); let elements = document.getElementsByTagName("img"); &nbs... Add solution -
Javascript 2021-09-24 17:47:05
sleeping in js
const sleep = (milliseconds) => { return new Promise(resolve => setTimeout(resolve, milliseconds)) } /*Use like so*/ async function timeSensativeAction(){ //must be async func //do something here await sleep(5000) //wait 5 seconds //contin... Add solution -
Java 2021-09-24 09:07:02
api process flow
I HAVE FOUR DIFFERENT PROCESS TO IMPLEMENT 1. Checking API contract 2. Creating test cases 3. Executing test cases 4. Implementing different test flows 1. Checking API Contract An API is essentially a contract between the client and the server or betwee... Add solution -
Python 2021-09-23 22:53:05
hand cricket game in python
import random lst1= [1,2,3,4,5,6,7,8,9,10] chances_1= 20 no_of_chances_1= 0 your_runs= 0 print ("-----------------------------------------------\nYour Batting\n") while no_of_chances_1 < chances_1: runs= int(input("Enter Run... Add solution -
Other 2021-09-23 16:34:03
What is your career aspiration
My immediate goal is to secure a position at a company like this one where I can continue to grow and improve myself both personally and professionally. I enjoy challenges and look forward to opportunities where I will be able to assume more responsibilit... Add solution -
Python 2021-09-23 16:25:05
dijkstra implementation with the help of priority queue in python
import heapq def calculate_distances(graph, starting_vertex): distances = {vertex: float('infinity') for vertex in graph} distances[starting_vertex] = 0 pq = [(0, starting_vertex)] while len(pq) > 0: current_distance, current... Add solution