huseyinyilmaz

<?xml version="1.0"?>
<root>
    <item>
        <name>Cursor to command</name>
    <item>
        <name>Arrow to Control_L</name>
        <identifier>remap.arrows2controlR</identifier>

        <autogen>__KeyToKey__ KeyCode::CURSOR_RIGHT, KeyCode::CONTROL_R</autogen>
        <autogen>__KeyToKey__ KeyCode::CURSOR_LEFT, KeyCode::CONTROL_R</autogen>

huseyinyilmaz

compile:
	rm -f Inversions
	stack ghc -- -O2 --make -prof -caf-all -auto-all Inversions.hs

only_compile:
	rm -f Inversions
	stack ghc -- -O2 --make -auto-all Inversions.hs

run_tests: only_compile
	./Inversions

huseyinyilmaz

# https://leetcode.com/problems/median-of-two-sorted-arrays/
from bisect import bisect_left
from itertools import takewhile


class Solution(object):

    def count_prefix(self, start_idx, st, char):
        """ Starting from the start index, checks how many times given character
        repeated"""

huseyinyilmaz

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def deleteNode(self, node):
        """
        :type node: ListNode

huseyinyilmaz

huseyinyilmaz

service Calculator {

  /**
   * A method definition looks like C code. It has a return type, arguments,
   * and optionally a list of exceptions that it may throw. Note that argument
   * lists and exception lists are specified using the exact same syntax as
   * field lists in struct or exception definitions.
   */

   void ping(),

huseyinyilmaz

huseyinyilmaz

huseyinyilmaz

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def insert(self, head, node):
        if head is None:
            node.next = None

huseyinyilmaz

--https://leetcode.com/problems/merge-intervals/
module Main where
import Test.HUnit
import Data.List(sort)

data Interval = Interval Int Int deriving (Show, Eq, Ord)

merge :: [Interval] -> [Interval]
merge intervals = merge' $ sort intervals
  where