Skip to content

Instantly share code, notes, and snippets.

@stoyanovsh
stoyanovsh / ArraySort.java
Created March 19, 2021 16:48
Sorting Array
public class ArraySort {
public static void main(String[] args) {
int[] array = {1, 3, 1, 2, 5, 2, 1, 3};
sort(array);
for (int i : array) {
System.out.print(i + " ");
}
import java.util.HashMap;
import java.util.Map;
public class MatchingChars {
public static void main(String[] args) {
String firstStr = "abca";
String secondStr = "deaf";
String rslt = matchingChar(firstStr, secondStr);
public class Numbers {
public static void main(String[] args) {
for (int i = 1; i <= 100 ; i++) {
if(i % 3 == 0){
System.out.println("git");
}else if(i % 5 == 0){
System.out.println("hub");
}else {
System.out.println(i);
@stoyanovsh
stoyanovsh / gist:95692bb4e08618b3516df97fa46c9a88
Created March 12, 2021 21:39 — forked from psayre23/gist:c30a821239f4818b0709
Runtime Complexity of Java Collections
Below are the Big O performance of common functions of different Java Collections.
List | Add | Remove | Get | Contains | Next | Data Structure
---------------------|------|--------|------|----------|------|---------------
ArrayList | O(1) | O(n) | O(1) | O(n) | O(1) | Array
LinkedList | O(1) | O(1) | O(n) | O(n) | O(1) | Linked List
CopyOnWriteArrayList | O(n) | O(n) | O(1) | O(n) | O(1) | Array