slzdevsnp

example of a spark-submit command

Create a bash script to defin a main class a job jar and assemple all necessary jars for a claspath

#!/bin/bash
echo "sumitting xxx.yyy.zzz.SparkKafkaReadWrite"

/usr/bin/spark-submit  --class xxx.yyy.zzz.SparkKafkaReadWrite  \
 --master yarn  --deploy-mode cluster \

slzdevsnp

see project dependencies

mvn dependency:tree

compile project with a specified profile

mvn clean package -P exclude-spark-libs

package with skipped tests

slzdevsnp

prereq java

sudo apt update
sudo apt install -y default-jdk

java --version

expect openjdk version "11.0.5" 2019-10-15

slzdevsnp

installing grafana with an rpm package

applicable to redhat, centos, aws linux

via downloaded rpm package

on aws host:

sudo yum update

slzdevsnp

##tested on cygwin : gnu date
##osx: has different version of date

ctimestamp=`date '+%s' #ok on osx

#get just the day  precision date
today=`date +%Y-%m-%d` #2020-02-19
 
 

slzdevsnp

Implement a Deque

A deque is a doubled-ended queue is an ordered collection wich generalizes a queue, for which alements can be added to or removed from either the fron (head) or back (tail).

This implements an unrestrictive nature of adding and removing items.

Problem

Implement a Deque class! It should be able to do the following:

• Check if its empty
• Add to both front and rear

slzdevsnp

Implement a Queue

A queue is an ordred collection of elements where new elements are added added at the end (rear) and the removal of existing items occors at the start, (front). This is a FIFO principle (first in first out). The simple analogy is any waiting line with first-come first served principle.

Problem

It's very common to be asked to implement a Queue class! The class should be able to do the following:

• Check if Queue is Empty
• Enqueue

slzdevsnp

Stack

is an ordered collection of elments with analogy like a stack of paper.

It supports a principle of LIFO. (grab first the element from the top which as put as a last)

Implement a Stack

Problem

A very common interview question is to begin by just implementing a Stack! Try your best to implement your own stack!

slzdevsnp

Problem

Create our own Dynamic Array class!

use a built in library ctypes

NB. A quick note on public vs private methods, we can use an underscore _ before the method name to keep it non-public.

slzdevsnp

resources

• 1 udemy python for data structures, algorithms and interviews

plan

• 1v BigO
• 1v Arrays
• 1v Stacks Queues
• 1 Linked Lists
• 1 Recursion
• 1 Trees
• 1 Search Sort