IsaacCisneros

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int steps = scanner.nextInt();

        for(int x=0; x<steps; x++){
            System.out.println(reverse(reverse(scanner.nextInt()) + reverse(scanner.nextInt())));

IsaacCisneros

public class Weekly02 {
    
    public static void main (String args[]){
        Scanner scanner = new Scanner(System.in);
        int arraySize = scanner.nextInt();
        int mask = 1;
        for(int x=0; x<arraySize; x++){
            int i = scanner.nextInt();
            int counter = 0;
            do {

IsaacCisneros

>	Regular Expressions Cheat Sheet
>		A regular expression specifies a set of strings that matches it. This cheat sheet is based off Python 3's Regular Expressions (http://docs.python.org/3/library/re.html) but is designed for searches within Sublime Text.

>	Special Characters
\				Escapes special characters or signals a special sequence.
.				Matches any single character except a newline.
^				Matches the start of the string.
$				Matches the end of the string.
*				Greedily matches 0 or more repetitions of the preceding RE.
*?				Matches 0 or more repetitions of the preceding RE.

IsaacCisneros

#include <stdio.h>
#include <glib.h>

void __print(char *data, char *user_data){
    printf("DATA: [%s] ADRESS: [%d]\n", data, &(*data));
}

gboolean __print_hash_table(gpointer key, gpointer data, gpointer user_data){
    printf("HASH ITEM: %d\n", GPOINTER_TO_INT(key));
    g_list_foreach((GList *)data, (GFunc)__print, NULL);

IsaacCisneros

$user = 'user'
$pass = 'pass'

$pair = "$($user):$($pass)"

$encodedCreds = [System.Convert]::ToBase64String([System.Text.Encoding]::ASCII.GetBytes($pair))

$basicAuthValue = "Basic $encodedCreds"

$Headers = @{

IsaacCisneros

/*Queue - Linked List implementation*/
#include<stdio.h>
#include<stdlib.h>
struct Node {
	int data;
	struct Node* next;
};
// Two glboal variables to store address of front and rear nodes. 
struct Node* front = NULL;
struct Node* rear = NULL;

IsaacCisneros

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

---

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

---