ademidun

Node* Reverse(Node *head)
{
    Node* trail=0;
    while (head){
        Node* next= head->next;
        head->next = trail;
        trail=head;
        head=next;
    }
    return trail;

ademidun

void Inorder(node *root) {
	if (root) {
		Inorder(root->left);
		cout << to_string(root->data) + " ";
		Inorder(root->right);
	}

}

ademidun

int main() {
	/* Enter your code here. Read input from STDIN. Print output to STDOUT */
	
    int cases, x;
    
    //first, we find how many numbers we have, we use scanf on the input from STDIN, to return the number
    //of cases we have to cases variable
    
    scanf("%u", &cases);
    

ademidun

public int lengthOfLongestSubstring(String s) {
      if(s==null || s.length()==0){
        return 0;
      }
 
    HashSet<Character> set = new HashSet<Character>();
 
    int max=0;
 
    int i=0;

ademidun

public class MyStack<T extends Comparable<T>>{

	private static class StackNode<T extends Comparable<T>> {
		private Comparable<T> data;
		private StackNode<T> next;

		public StackNode(Comparable<T> item){
			this.data =item;
		}

ademidun

public boolean canFinish(int numCourses, int[][] prerequisites) {
	    if(prerequisites == null){
	        throw new IllegalArgumentException("Invalid Prerequisites");
	    }
	 
	    int p_len = prerequisites.length;
	 
	    if(p_len == 0||numCourses == 0){
	        return true;
	    }

ademidun

# Lavar Ball is looking for scholarships to help pay for school.
# He has 2 lists, A and B. 
# A is a cache of Lavar's scholarships as an array of primary keys.
# B is an array of scholarship objects matching Lavar's profile.
# Lavar needs to sort the objects in B based on the PKs of A, to get a new B (B_2).
# Lavar needs it done in less than O(n^2) time so he doesn't get bored and starts browsing Reddit.

# e.g. 
A = [3,139,47] # arbitrary order
B = [{pk:139,name:'Scholarship X'},{pk:47,name:'Scholarship Y'},{pk:3,name:'Scholarship Z'}]

ademidun

from botocore.exceptions import ClientError


def dict_to_dynamo(data):
# if you try to save an empty string to dynamo you will get the following error:

# 'An error occurred (ValidationException) when calling the BatchWriteItem operation: One or more parameter values were invalid: An AttributeValue may not contain an empty string'
# This function recursively converts all empty string to valid None/Null type values that dynamo accepts
# https://gist.github.com/JamieCressey/a3a75a397db092d7a70bbe876a6fb817

ademidun

// src/main.ts
import { enableProdMode } from '@angular/core';
import { platformBrowserDynamic } from '@angular/platform-browser-dynamic';

import { AppModule } from './app/app.module';
import { environment } from './environments/environment';

if (environment.production) {
  enableProdMode();
}

ademidun

# Rename File Extensions
# https://www.maketecheasier.com/rename-files-in-linux/
brew install rename;
rename 's/.m4a/.mp3/' * # rename all .m4a files to .mp3 (don't forget to include the asteriks '*')

# delete all files with a certain extension
# https://askubuntu.com/questions/377438/how-can-i-recursively-delete-all-files-of-a-specific-extension-in-the-current-di
find . -name "*.bak" -type f #first check the files that will be deleted
find . -name "*.bak" -type f -delete # then you can delete them