What do you want to save?
Add Code snippet
New code examples
-
Other 2022-03-27 20:45:27
equivalent partition
Equivalence Partitioning is type of black box testing technique which can be applied to all levels of software testing like unit, integration, system, etc. In this technique, input data units are divided into equivalent partitions that can be used to deri... Add solution -
Java 2022-03-27 20:40:19
TreeSet headSet(E toElement) 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 -
Html 2022-03-27 20:40:18
https://www.codegrepper.com
"You are not paid to write code, You are paid to solve problems" Word to the wise. Basically - 99% of the problems you have someone have already encountered before and uploaded a working solution to the internet. Find that solution and 90% of... Add solution -
Python 2022-03-27 20:15:02
search
filetype: allows searching for specific filetype -<word>: excludes a word from results(type without <>) before:yyyy-mm-dd : only shows results from before a date after:yyyy-mm-dd : only shows results from after a date intitle:<word> : se... Add solution -
Other 2022-03-27 19:45:11
ReferenceError: require is not defined site:stackoverflow.com
const cors = require('cors'); const express = require('express'); const bodyParser = require('body-parser'); var http = require('http'); http.createServer(function (request, response) { response.writeHead(200, { 'Content-Type': 'text/plain' }); ... Add solution -
C++ 2022-03-27 19:20:39
lists occurrences of characters in the string c++
int d[27]={0}; for (int i = 0; i < str.length(); i++) //AABBCC d[str[i] - 'A']++; for (int i = 0; i < str.length(); i++) if (d[str[i] - 'A'] != 0) { cout << str[i] << " "<< d[str[i] - 'A'] << " "; /... Add solution
Best helpers
Ranking is empty