Skip to content

Instantly share code, notes, and snippets.

View cost-api-stack.ts
import {
CfnParameter, Construct, Stack, StackProps,
} from '@aws-cdk/core';
import * as lambda from '@aws-cdk/aws-lambda';
import * as apigateway from '@aws-cdk/aws-apigateway';
import * as iam from '@aws-cdk/aws-iam';
import * as secretsmanager from '@aws-cdk/aws-secretsmanager';
import { ApiStackProps } from './entity';
export class CostApiStack extends Stack {
View template.yml
Resources:
costapi8876B5F2:
Type: AWS::ApiGateway::RestApi
Properties:
EndpointConfiguration:
Types:
- EDGE
Name: cost-api
Metadata:
aws:cdk:path: CostApiAlfa/cost-api/Resource
View AWS Lambda email parser
var AWS = require("aws-sdk");
var simpleParser = require("mailparser").simpleParser;
var s3 = new AWS.S3();
exports.handler = async (event, context, callback) => {
console.log("Invoked Lambda");
const mail = event.Records[0].ses.mail;
console.log("Mail");
View gist:dceed4fae51099df1b58
### Keybase proof
I hereby claim:
* I am flexelem on github.
* I am buraktas (https://keybase.io/buraktas) on keybase.
* I have a public key whose fingerprint is 7A85 0AFA 2966 A9D3 4373 47ED D57B 4F5E 6010 4B7C
To claim this, I am signing this object:
@flexelem
flexelem / Dictionary.java
Created Aug 17, 2014
Prefix tree written by using Trie. Supports find prefixes in O(n.m.k) where k is length of the prefix and O(n.m) comes from Depth First Search
View Dictionary.java
import java.util.ArrayList;
import java.util.Map.Entry;
import java.util.Set;
public class Dictionary {
private TrieNode root;
public Dictionary() {
root = new TrieNode(null);
@flexelem
flexelem / Quicksort.java
Last active Aug 29, 2015
Quicksort algorithm in java
View Quicksort.java
import java.util.Random;
public class RandomizedQuickSort {
public void quickSort(int[] numbers, int low, int high) {
if (low < high) {
// select pivot randomly
int q = randomizedPartition(numbers, low, high);
@flexelem
flexelem / FindCommonElementsInTwoArrays.java
Created Jun 13, 2014
Find common elements out of two sorted array
View FindCommonElementsInTwoArrays.java
import java.util.ArrayList;
public class FindCommonElementsInTwoArrays {
public ArrayList<Integer> findCommonElementsOfTwoArray(int[] array1, int[] array2) {
int[] larger = array1;
int[] smaller = array2;
if (array1.length < array2.length) {
@flexelem
flexelem / ReverseLinkedListKSizeSlots.java
Created Jun 13, 2014
Reverse a linked list by given K size slots with recursion
View ReverseLinkedListKSizeSlots.java
public class ReverseLinkedListKSizeSlots {
public Node reverseRecursion(Node root, int k) {
Node current = root;
Node prev = null;
Node next = null;
int count = 0;
while (current != null && count < k) {
@flexelem
flexelem / LinkedList.java
Last active Aug 29, 2015
reverse a LinkedList by k size slots with using a stack
View LinkedList.java
public class LinkedList {
public class Node {
int data;
Node next;
public Node(int item) {
this.data = item;
@flexelem
flexelem / LinkedList.java
Created Jun 13, 2014
Reverse a LinkedList
View LinkedList.java
public class LinkedList {
public class Node {
int data;
Node next;
public Node(int item) {
this.data = item;