sleemer

using System;
using System.IO;
using System.Net;
using System.Net.Sockets;
using System.Reactive.Linq;
using Newtonsoft.Json;

public static class TcpSubscriber
{
    /// <summary>

sleemer

Tabs and Windows

Function	Shortcut
New Tab	⌘ + T
Close Tab or Window	⌘ + W (same as many mac apps)
Go to Tab	⌘ + Number Key (ie: ⌘2 is 2nd tab)
Go to Split Pane by Direction	⌘ + Option + Arrow Key
Cycle iTerm Windows	⌘ + backtick (true of all mac apps and works with desktops/mission control)

sleemer

# EditorConfig is awesome:http://EditorConfig.org

# top-most EditorConfig file
root = true

# Don't use tabs for indentation.
[*]
indent_style = space
# (Please don't specify an indent_size here; that has too many unintended consequences.)

sleemer

using System;
using System.Collections.Generic;
using System.IO;
using System.IO.MemoryMappedFiles;
using System.Linq;

namespace WordFrequencyCounter
{
    public sealed class WordCounter
    {

sleemer

FROM microsoft/aspnetcore-build:2
ENV NUGET_XMLDOC_MODE skip
WORKDIR /vsdbg
RUN apt-get update \
    && apt-get install -y --no-install-recommends \
       unzip \
    && rm -rf /var/lib/apt/lists/* \
    && curl -sSL https://aka.ms/getvsdbgsh | bash /dev/stdin -v latest -l /vsdbg

RUN mkdir /app

sleemer

using System;
using System.Linq;
using Tweetinvi;
using Tweetinvi.Core.Extensions;
using Tweetinvi.Events;
using Tweetinvi.Models;

public class Program
{
    public static void Main(string[] args)

sleemer

// https://www.hackerrank.com/challenges/and-xor-or
// Original statement could be simplified: ((M1&M2)^(M1|M2))&(M1^M2) == M1^M2
public int MaxAndOrXor(string input)
{
    var numbers = input.Split(new[] { ' ' }, StringSplitOptions.RemoveEmptyEntries)
        .Select(int.Parse)
        .ToArray();
    var max = 0;
    foreach (var pair in GetSmallestPairs(numbers))
    {

sleemer

// https://www.hackerrank.com/challenges/poisonous-plants/submissions/code/31921305
// Stack will be used to track series of plants splitted by the survived plants.
// Stack is a tuple of index of plant and amount of day that it will servive (0 - will live forever).
//  eaxamle input: 3 7 1 2 4 8 2 7 9
// serie splitter: |   | 
//          index: 0 1 2 3 4 5 6 7 8
// amount of days: 0 1 0 1 1 1 2 1 1
//        maximum: 2
public int PoisonousPlants(string input)
{

sleemer

Missing parts of the .Net Developer Days

This presintation is based on the true stories

• Abusing C# - by Jon Skeet
• Rethinking the Enterprise - by Ted Neward
• Immutability in C# - by Jon Skeet

Part I - The Art of Pain

I wonder what I could do with this that would make the Mads Torgersen wince? >

sleemer

/// Description of the problem can be found at https://www.hackerrank.com/challenges/largest-rectangle/editorial
/// As a real use case we could consider usage of this algorithm to find out the largest rectangular subarray containing only ones.
/// For more details go to http://www.drdobbs.com/database/the-maximal-rectangle-problem/184410529
public int LargestRectangle(string input)
{
  var heights = input.Split(new[] { ' ' }, StringSplitOptions.RemoveEmptyEntries)
    .Select(int.Parse)
    .Concat(new[] { 0 }) // add tail 0 to force calculation when we reach the last element
    .ToArray();
  var positions = new Stack<int>();