What do you want to save?
Add Code snippet
New code examples
-
Python 2021-09-14 19:54:04
whatsapp spammer script
# Import Selenium module from selenium import webdriver # Paste the address of the chromedriver.exe file in webdriver.Chrome() driver = webdriver.Chrome('C:\\webdrivers\\chromedriver.exe') driver.implicitly_wait(15) # Enter the website in .get() driver.... Add solution -
-
Other 2021-09-14 13:26:02
java.lang.object[4]
List<Object> result = (List<Object>) LoadSource.list(); Iterator itr = result.iterator(); while(itr.hasNext()){ Object[] obj = (Object[]) itr.next(); //now you have one array of Object for each row String client = String.valueOf(obj[... Add solution -
C++ 2021-09-14 08:25:04
kosaraju algorithm
//By Soumyadeep Ghosh @soumyadepp on Instagram //Kosaraju's algorithm for Strongly Connected Components /*Kosaraju's algorithm for Finding the number of Strongly Connected Components of a graph works on the fact that on transposing a graph, i.e reversing ... Add solution -
Java 2021-09-13 19:53:04
TreeSet headSet() method in java
import java.util.Iterator; import java.util.TreeSet; public class TreeSetHeadSetEToElementMethodExample { public static void main(String[] args) { TreeSet<Integer> ts = new TreeSet<Integer>(); TreeSet<Integer> hs = new ... Add solution -
Other 2021-09-13 12:42:03
mirror a binary tree
//mirror a binary tree void mirror(Node root){ Queue<Node> q=new LinkedList<>(); q.add(root); while(!q.isEmpty()){ Node currnode=q.poll(); Node temp=currnode.left; currnode.left=currnode.right; currnode.right=temp; if(currnode.left!=null){ q... Add solution -
C 2021-09-13 08:38:04
c program for prims algorithm
#include<stdio.h> #include<conio.h> int a,b,u,v,n,i,j,ne=1; int visited[10]= { 0},min,mincost=0,cost[10][10]; void main() { clrscr(); printf("\n Enter the number of nodes:"); scanf("%d",&n); printf("\n Enter th... Add solution
Best helpers
Ranking is empty