Poorvak

def populate_incr_subseq_list(arr: list) -> list:
    len_of_inp = len(arr)
    temp_list = [1] * len_of_inp
    for i in range(1, len_of_inp):
        for j in range(0, i):
            if arr[j] < arr[i]:
                temp_list[i] = max(temp_list[1], temp_list[j] + 1)
    return temp_list

Poorvak

' '.join(input().split(' ')[::-1])

Poorvak

class Node:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None


def get_height(root: Node) -> int:
    if root is None:
        return 0

Poorvak

"""
Copies all keys from the source Redis host to the destination Redis host.
Useful to migrate Redis instances where commands like SLAVEOF and MIGRATE are
restricted (e.g. on Amazon ElastiCache).

The script scans through the keyspace of the given database number and uses
a pipeline of DUMP and RESTORE commands to migrate the keys.

Requires Redis 2.8.0 or higher.

Poorvak

# Configuration file for runtime kernel parameters.
# See sysctl.conf(5) for more information.

# See also http://www.nateware.com/linux-network-tuning-for-2013.html for
# an explanation about some of these parameters, and instructions for
# a few other tweaks outside this file.

# Protection from SYN flood attack.
net.ipv4.tcp_syncookies = 1

Poorvak

#!/bin/sh

# Make sure to:
# 1) Name this file `backup.sh` and place it in /home/ubuntu
# 2) Run sudo apt-get install awscli to install the AWSCLI
# 3) Run aws configure (enter s3-authorized IAM user and specify region)
# 4) Fill in DB host + name
# 5) Create S3 bucket for the backups and fill it in below (set a lifecycle rule to expire files older than X days in the bucket)
# 6) Run chmod +x backup.sh
# 7) Test it out via ./backup.sh

Poorvak

#!/usr/bin/python

import math
import argparse
import traceback

import psycopg2
import psycopg2.extras

import elasticsearch

Poorvak

#include <iostream>
#include <vector>
using namespace std;

void generatePrime(int N) {
    vector <int> arrayList;
    vector <int> :: iterator i;
    arrayList.push_back(2);
    for( int i=3; i<=N; i+=2 ) {
        bool isPrime = true;

Poorvak

Poorvak