using System;

public class Program

{

    public static void Main()

    {

        Console.WriteLine("\"Hello World\"\n е любим поздрав на програмистите");

    }

    /*

    If ur not up for this, its more than fine

    If u dont want my annoying assistance its fine

    If u do want assistance, im happy to go through all these problems with you

    Dont stress. We got this. 

    I would open two browser windows

    One with one of these fiddles

    And another with blank fiddle for you to re write the code yourself

    Just writing it out - will let it sink it

    Dont look all at once, just one by one

​

    After you write these out, it will just sink it

    References are there to help, but spend more time just doing than trying to read all the articles

    Just reference

    */

    public void Monday_Day1(){

        /*

        Stacks

            1. Parentheses Problem

                https://dotnetfiddle.net/2zS29p

                An easy-ish problem to get you grooving and build some momentum

                Very good problem to know, asked often

        Recursion

        - This is the shitty stuff. Hard to wrap ur head around. 

        So let's dig in!

        I spent some time trying to find good problems to wrap your head around the concepts.

        I added lot of comments to try and help.

        Start to look at these, one at a time, take ur time.

        This will take u a while.

        We have three days of this to get thru it without getting too overhwlemed.

        Just get overview on Monday, then dig in Tues/Wed

        If you have laptop, u can look on train without internet connection

            1. Recursion - Triple Step

                https://dotnetfiddle.net/9HG0LQ

            2. Recursion - Find Path in Grid

                https://dotnetfiddle.net/HePeAV

               Path in Grid II

                https://dotnetfiddle.net/No4n9E

            3. Recursion - N choose K

                https://dotnetfiddle.net/ZDXaQm

            4. Recursion - Combinations

                https://dotnetfiddle.net/z2MYoh

        */

    }

    public void Tuesday_Day2(){

        /*

        Recursion is hard. 

        So we have three days of it to wrap ur head around.

        I do suggest doing these in order, but of course just a suggestion.

            1. Recursion - Triple Step - Important

                https://dotnetfiddle.net/9HG0LQ

            2. Recursion - Find Path in Grid - Important

                https://dotnetfiddle.net/HePeAV

            3. Path in Grid II

                https://dotnetfiddle.net/No4n9E

            4. Recursion - N choose K - Important

                https://dotnetfiddle.net/ZDXaQm

            5. Recursion - Combinations

                https://dotnetfiddle.net/z2MYoh

            6. Paint Fill

                https://dotnetfiddle.net/Og4dg1

            7. Magic Index - Important

                https://dotnetfiddle.net/oEN4Ur

            8. Watch Video - Algorithms: Memoization and Dynamic Programming

                https://www.youtube.com/watch?v=P8Xa2BitN3I

            9. Coin Change

                https://dotnetfiddle.net/IZFzDq

​

        */

    }

    public void Wednesday_Day3(){

        /*

        Recursion is hard. 

        So we have three days of it to wrap ur head around

        AFTER you look at these problems and get a bit of understanding,

        start reading the book chapters on recursion and memoization.

        If you do these problems first, then read the book, I think book will make more sense.

        Also look at the solutions in the book at end of chapter. Dont try the solutions yourself. 

        You don't have time for that. Look up the solutions in back of book and try to practice them.

​

            1. Recursion - Triple Step - Important

                https://dotnetfiddle.net/9HG0LQ

            2. Recursion - Find Path in Grid - Important

                https://dotnetfiddle.net/HePeAV

            3. Path in Grid II

                https://dotnetfiddle.net/No4n9E

            4. Recursion - N choose K - Important

                https://dotnetfiddle.net/ZDXaQm

            5. Recursion - Combinations

                https://dotnetfiddle.net/z2MYoh

            6. Paint Fill

                https://dotnetfiddle.net/Og4dg1

            7. Magic Index - Important

                https://dotnetfiddle.net/oEN4Ur

            8. Watch Video - Algorithms: Memoization and Dynamic Programming

                https://www.youtube.com/watch?v=P8Xa2BitN3I

            9. Coin Change

                https://dotnetfiddle.net/IZFzDq

        */

    }

    public void Thursday_Holiday(){

        // Thanksgiving 

        // IF you feel like it, review recursion

        // Maybe watch some Big O videos. Good to get good handle on this stuff

        // https://www.youtube.com/watch?v=v4cd1O4zkGw

        // Some crazy big O notes I took. Read at your own risk!

        //      Big 0 https://dotnetfiddle.net/XD5tvq

​

    }

    public void Friday_Day4(){

        /* Back to trees and lists and fun stuff

        Hopefully you have recursion down a bit by now.

        So take a break from it. Your probably hungover from Turkey.

        Give ur brain a break. So this is more fun, easier stuff.

        Also important to know. Dont want to skip.

        BinaryTree :: InOrder, PostOrder, PreOrder - Important

            One new method to review here using a stack

            https://dotnetfiddle.net/dLxtM3

        BinaryTree :: BFS Print Tree Line By Line - Important

            Print Tree Line by Line (u already did this one)

            https://dotnetfiddle.net/FQITA4

        Linked Lists

            Number Printer  https://dotnetfiddle.net/kKgVbn

        Dictionary - Flight Routes - Important

            https://dotnetfiddle.net/JrgUDf

        Parentheses Problem (yes, again!) - Important

                https://dotnetfiddle.net/2zS29p

        */

    }

    public void Saturday_Day6(){

        // Sat and Sun are your last real days to study bc hard to study and work

        // So make use of these days. Crunch Time. We already went thru the hard recursion basics.

        // Now we are going to solidify. Lot more stuff will come here soon!

        /*

        BinarySearch - Find Closest Number - Important

            https://dotnetfiddle.net/vGAoEt

        Tries- Contacts / AutoComplete using Tries - Important

            https://dotnetfiddle.net/McmkTa

        Linked Lists - All the things

            We want to be comfortable with linked lists, but in reality you probably wont get these exact questions.

            More logic, recursion, grid path, kinda stuff asked

            https://dotnetfiddle.net/m1qcfM

        Max Sliding Window - Queues

            https://dotnetfiddle.net/WscFIq

        Linked Lists - Advanced Topics

            Dont spend much time - u prob wont get these questions. 

            But reviews concepts for bubble sort and merge list.

            https://dotnetfiddle.net/Gmyp5D

        Above are not too hard (relatively). Just a few new things.  Shouldnt hurt brain too much.

        Review everything from Wednesdays lesson! 1- 9

        Weekend Crunch Time, if you didnt have time during week, go over the stuff from M-W. Its all the same. 

        Nows the time. Call me if you want company with it

        */

    }

    public void Sunday_Day7(){

        // TODO

        /*

        Max Rectangle in Grid - Histogram with Stack

            https://dotnetfiddle.net/Lv0yjr

        Largest SubArray

            https://dotnetfiddle.net/g8GvaT

        Queues  - Shoots And Ladders

            https://dotnetfiddle.net/0iYsjO

        Stack / Queue Implementation

            https://dotnetfiddle.net/chFjYq

        Insert Interval

            https://dotnetfiddle.net/v0RnhD

        Permutations - Recursion - Not to be confused with combinations

            https://dotnetfiddle.net/3cUUPO

​

        Above are not too hard (relatively). Just a few new things.  Shouldnt hurt brain too much.

        Review everything from Wednesdays lesson! 1- 9

        Weekend Crunch Time, if you didnt have time during week, go over the stuff from M-W. Its all the same. 

        Nows the time. Call me if you want company with it

​

        */

    }

    public void Monday_Day8(){

        // Take a break. Review previous stuff. Relax. We've done all we can. 

        // You should be fairly solid if u went over above shit.

        // You will have a basic arsenal.

        // Always remember - its not as important to get the answer as it is to have the conversation and show u can listen and learn

        // I bombed the "robot in a grid" question and still moved on for facebook or amazon or whatever it was

        // I just tried and was able to talk in some kind of minorly intelligent manner

/******* Advice ******

​

-   Important:

    Drag out ur intro as long as possible - you really want to play up ur experience and make a compelling first impression right off

    This will give u leyway when needing help solving a problem

        Play Up: Experience in commerce, legacy code, integrations. These things are key, They will impress.

        Really good things to mention 

            Brand work u did - shows complex commerce experience

            Specials  - shows complex commerce experience

            Performance analysis using metrics/tools with measurable results

            Coordination with different teams for integrations - Golf/PetSmart (say the names)

            Production Support - there is a lot of crazy ASAP issues after releases here - 

                if you can convey you have experience handling urgent prod issues, this is desirable

            Love workign with legacy code and respecting it while taking advantage of new technologies as appropriate

            Experience with smart caching - We do lot of caching

        Take your time with all of this stuff - this is your 5-10 minutes to shine and show they need ur experience

        After that, your onto the BS and ur chance to boast ur experience is over.  I usually make decision in first 5 minutes

        speaking to candidate. After that, I dont care they get the problem or not. And if I like them, I help them. Bc we all know this shit is BS.

        So long as they work with me and dont freak out.

-   Always listen to interviewers suggestions. If don't understand - have the conversation - talk it out, dont just ignore and continue.

    They are giving u specific hint for a reason. Much better to ask questions and listen that go down a bad path insistently

-   Feel free to say, you took a week to review data structures and algorithms but you arent familiar with this one

    Happy to work through it and will try to talk out loud to share thought process

    Always remain confident. Like this is nothing - like u can do anything - bc u know is not rocket appliances

    Your smart guy - u can figure it out :)

    This is just the stuff I told myself in this interview and I really think it helped me not to freak out so much.

-   I know you are overhwlemed with the material. There are SO many questions. Im trying to help narrow it down given the time constraint.

    Since most questions are variations of others - if you can study the stuff here, i really tihnk u will be in good shape with the concepts.

    Finding the right questions to solidify the concepts is annoying, which is why Im tried to do this for you.

    The questions I wrote should be reflective of concepts you need to know. Not trying distract u - trying to focus on imp stuff

    in expedicous way

-   Have fun! (Jay says this makes things better) Dont be about proving anything, 

    be about working together.

​

*/

    }

    public void Tuesday_Day0(){

        // Interview

    }

    public void StudyPlan_OnSite(){

        /*

            Questions asked:

            1. Autocomplete with trie

            The question and one candidates attempt at the answer:

            https://dotnetfiddle.net/Qnz1pu

            There are many online articles / examples on this question. Some of them are harder to understand than others.

            This looks like a clear one:

            https://leetcode.com/articles/implement-trie-prefix-tree/

            Also there are videos by Gayle and others :)

            2. Print in order of insert and Line by Line print a tree

            The question and some attempt at an answer:

            https://dotnetfiddle.net/voWrpv

            https://dotnetfiddle.net/PvGsOz

            We also did this one here:

            https://dotnetfiddle.net/FQITA4

            3. One guy asks a question about how to implement a debugger. This is a conversation.

                There is no right or wrong. The only thing he ever heard "wrong" was using one thread, bc 

                u def need at least two threads - one to run the code - and another to intercept/debug.

                He may also ask about what happens when u enter url in browser. 

                You are good at this stuff - for example, I have no clue.

            4. Flight Route

                One person always asks this one which we went over

                https://dotnetfiddle.net/JrgUDf

            5. One guy asks a "battleship" game question. It is a grid path traversal question with recursion.

                Review grid path traverals and/or lookup leetcode battleship or leetcode grid questions

            6. One girls asks some threading question. You are given 2 methods. Each thread knows its own identity 

            but not the idenity of the others threads. One method should be used to ask the thread its own 

            identity and then wait/sleep if it is not the last thread. I know this is a ridiculous thing to write 

            bc i cant remember the question, but its a tough one that someone asks so I want u to at least have idea

            in mind about threading and waiting if ur not the last thread to go. Maybe it will ring a bell and be helpful.

            7. One person asks about logs and how to keep 24 hours of logs at a time. The answer has to do with making buckets.

            One bucket per each hour. Why this is the answer, I dont know. I did some other way, like cache with expiration.

            I am just trying to give u whatever inside info I possibly can to help - even tho it is a sad and lame attempt.

            8. Water fall problem - look online for answers

            9. Review the problems in this doc

            Just remember to have conversations and be clear and really listen are more important that proving something.

        */

    }

}