What do you want to save?
Add Code snippet
New code examples
-
TypeScript 2021-10-17 01:36:07
concatenate lists c++
// list::merge #include <iostream> #include <list> // compare only integral part: bool mycomparison (double first, double second) { return ( int(first)<int(second) ); } int main () { std::list<double> first, second; first.push_... Add solution -
Java 2021-10-07 19:08:15
how to quicksort a string array in java
package com.javacodegeeks.sorting.quicksort; public class QuicksortStringExample { private static String []a; public static void main(String[] args) { ... Add solution -
Other 2021-10-06 16:42:05
Given an array of integers, find the one that appears an odd number of times. There will always be only one integer that appears an odd number of times
function findOdd(A) { var countOccurencesOfInt = 0; for (let i = 0; i < A.length; i++) { var currentIterationInt = A[i]; for (let j = 0; j < A.length; j++) { if (currentIterationInt == A[j]) { coun... Add solution -
TypeScript 2021-09-30 21:55:04
merge lists c++
// list::merge #include <iostream> #include <list> // compare only integral part: bool mycomparison (double first, double second) { return ( int(first)<int(second) ); } int main () { std::list<double> first, second; first.push_... Add solution
Best helpers
Ranking is empty