flexelem

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 {

flexelem

Resources:
  costapi8876B5F2:
    Type: AWS::ApiGateway::RestApi
    Properties:
      EndpointConfiguration:
        Types:
          - EDGE
      Name: cost-api
    Metadata:
      aws:cdk:path: CostApiAlfa/cost-api/Resource

flexelem

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");

flexelem

### 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

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

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

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

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

public class LinkedList {

    public class Node {

        int  data;
        Node next;

        public Node(int item) {

            this.data = item;

flexelem

public class LinkedList {

    public class Node {

        int  data;
        Node next;

        public Node(int item) {

            this.data = item;