What do you want to save?
Add Code snippet
New code examples
-
Other 2021-08-30 05:45:01
maximum element in a window of size k
#include <bits/stdc++.h> using namespace std; // A Dequeue (Double ended queue) based method for printing maximum element of // all subarrays of size k void printKMax(int arr[], int n, int k) { // Create a Double Ended Queue, Qi that will s... Add solution -
Shell/Bash 2021-08-30 04:34:01
what is shell scripting
#!/bin/bash # Name: Check for domain name availability # linuxconfig.org # Please copy, share, redistribute and improve if [ "$#" == "0" ]; then echo "You need tu supply at least one argument!" exit 1 fi ... Add solution -
Shell/Bash 2021-08-30 03:08:02
how to expose docker api over tcp
## Use the command sudo systemctl edit docker.service ## to open an override file for docker.service in a text editor and ## add below lines(this is for testing purpose only, ##while PROD access or expose Docker api through tls or a proxy) $ sudo systemc... Add solution -
Python 2021-08-30 02:42:02
thread stop python
# Python program using # traces to kill threads import sys import trace import threading import time class thread_with_trace(threading.Thread): def __init__(self, *args, **keywords): threading.Thread.__init__(self, *args, **keywords) self.kil... Add solution -
Other 2021-08-30 02:30:02
what are the challenges in api
Some of the challenges we face while doing API testing are as follows • Selecting proper parameters and its combinations • Categorizing the parameters properly • Proper call sequencing is required as this may lead to inadequate coverage in... Add solution -
Java 2021-08-30 00:09:02
resultset methods in jdbc
next() -> moves to next row previous() -> moves to previous row getObject() -> reads data from column first() -> jumps to first row last() -> jumps to last row absolute(int row) -> go to specific row beforeFirst()-> jumps to row 0. ... Add solution -
C++ 2021-08-30 00:06:02
find all occurrences of a substring in a string c++
#include <string> #include <iostream> using namespace std; int main() { string s("hello hello"); int count = 0; size_t nPos = s.find("hello", 0); // first occurrence while(nPos != string::npos) { ... Add solution
Best helpers
Ranking is empty