using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
 
namespace SandCastlePractice
{
    class Program
    {
        static void Main(string[] args)
        {
            Console.WriteLine("Generate a distinct list of 10 random numbers,"
                +" ranging from 1 to 10, with the lowest amount of steps (10)");
            DateTime timeStart = DateTime.Now;
            Console.WriteLine("Time Started : "+ timeStart.TimeOfDay+"\r\n");
 
            //Counter for total times it will try
            int Total_Iterations = 0;
            //Decrementor for lowest amount of steps to create distinct list
            int lowestStep = 10000;
            //int used to see if lowest step changed
            int laststep = 0; 
            //display list when lowest steps are achieved
            LinkedList<int> displayList = new LinkedList<int>();
 
            //while the lowest steps arnt 10, keep trying
            while (lowestStep != 10)
            {
                Total_Iterations++;
                //steps counter
                int iSteps = 0;
                //bool to check if list of 10 is distinct
                bool isListDistinct = false;
                //temp LinkedList to be populated over and over
                LinkedList<int> numList = new LinkedList<int>();
                //create random number object
                Random random = new Random();
                while (!isListDistinct)
                {
                    ++iSteps;
                    //get a random number 0 - 10
                    int randomNumber = random.Next(0, 10);
                    //increment it by one so its 1-10, instead of 0-9
                    randomNumber++;
                    //if temp LinkedList doesn't contain generated int, add it
                    if (!numList.Contains(randomNumber))
                        numList.AddLast(randomNumber);
                    //when the list has 10 elements stop looping
                    if (numList.Count == 10)
                    {
                        isListDistinct = true;
                        //check if lowest amount of step is less then previous
                        if (iSteps < lowestStep)
                            lowestStep = iSteps;
                    }
                }
                //if lowest amount of steps got lower
                if (laststep != lowestStep)
                {
                    //Display new low
                    Console.WriteLine("lowest steps so far : " + lowestStep);
                    //when steps taken are 10, set current temp LinkedList 
                    //to Display List
                    if (lowestStep == 10)
                        displayList = numList;
 
                }
                laststep = lowestStep;
                isListDistinct = false;
            }
 
            Console.WriteLine("---------------------\r\n");
            //display the distinct list of ten, that only took 10 steps to generate
            foreach (var num in displayList)
            {
                Console.Write(num + " ");
            }
            Console.WriteLine();
            Console.WriteLine("How many times did it have to try?  " + 
                Total_Iterations.ToString("#,##0"));
            DateTime timeFinish = DateTime.Now;
            Console.WriteLine("How Long did it take?               "+  
                (timeFinish-timeStart)   );
        }
    }
}

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
 
namespace Polarity
{
    class Program
    {
        static void Main(string[] args)
        {
            Console.WriteLine("indeed.");
            Random random = new Random();
            LinkedList[] arrayLL = new LinkedList[10];
 
            //Make 10 lists: each with 10 items
            //for each set of items there must be three 1's, in random locations
            //then sort the ten lists by their closeness towards the end 
 
            for (int i = 0; i < 10; i++)
            {
                LinkedList distinctOrder = new LinkedList();
                while (distinctOrder.Count < 10)
                {
                    int randomNumber = random.Next(0, 10);
                    if (!distinctOrder.Contains(randomNumber))
                        distinctOrder.AddLast(randomNumber);
                }
                Console.WriteLine();
 
                //now that i have my distinct list random 1-10 order
                //make 0,1,2 into 1's and the rest into 0's
                LinkedList polList = new LinkedList();
                foreach (var num in distinctOrder)
                {
                    if (num == 0 || num == 1 || num == 2)
                        polList.AddLast(1);
                    else
                        polList.AddLast(0);
                }
                foreach (var num in polList)
                {
                    Console.Write(num + " ");
                }
                arrayLL[i] = polList;
            }
 
            Console.WriteLine("\r\n-------------------");
            Dictionary dictionary = new Dictionary();
 
            //figure out the score of each line and add it to dictionary
            //the position of the 1's indicidate their score towards the end
            for (int i = 0; i < arrayLL.Length; i++)
            {
                int[] thisLine = arrayLL[i].ToArray();
                int sum = 0;
                string line = "";
                for (int k = 0; k < thisLine.Length; k++)                 
                {                    
                         line += " " + thisLine[k];                    
                         if (thisLine[k] == 1)                         
                                  sum += k;                 
                 }                 
                 Console.WriteLine(line+"    "+sum);                
                 //add string of 10 to dictionary object                
                 //Warning! this will crash if the randomized string repeats                
                dictionary.Add(line, sum);                                 
          }             
           Console.WriteLine("-------------------");             
            //sort lines from highest score to lowest             
            var sortedDict = (from entry in dictionary orderby entry.Value descending select entry).ToDictionary(pair => pair.Key, pair => pair.Value);
            foreach (var strKey in sortedDict.Keys)
                Console.WriteLine(strKey);
 
        }
    }
}

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Collections;
 
namespace HashInversion
{
    class Program
    {
        static void Main(string[] args)
        {
            Hashtable num_2_Letters_Hash = new Hashtable();
            Hashtable letters_2_num_Hash = new Hashtable();
 
            num_2_Letters_Hash.Add(1, "a,c,d");
            num_2_Letters_Hash.Add(6, "d,e");
            num_2_Letters_Hash.Add(13, "a,d,j");
            num_2_Letters_Hash.Add(29, "c,e,d");
            num_2_Letters_Hash.Add(7, "j");
            num_2_Letters_Hash.Add(9, "e,c,a");
            num_2_Letters_Hash.Add(11, "c,d,f,j");
 
            foreach (var key in num_2_Letters_Hash.Keys)
            {
                string content = num_2_Letters_Hash[key].ToString();
                string [] letters = content.Split(',');
                for (int i = 0; i < letters.Length; i++)
                {
                    if ( letters_2_num_Hash.ContainsKey(letters[i].ToString()))
                    {
                        string previous_content = letters_2_num_Hash[letters[i]].ToString();
                        letters_2_num_Hash[letters[i]] = previous_content + "," + key;
                    }
                    else
                    {
                        letters_2_num_Hash.Add(letters[i],""+key);
                    }
                }
            }
 
            Console.WriteLine();
 
            Console.WriteLine("before");
            foreach (var key in num_2_Letters_Hash.Keys)
            {Console.WriteLine(key + "   " + num_2_Letters_Hash[key]);}
 
            Console.WriteLine("after");
            foreach (var key in letters_2_num_Hash.Keys)
            {Console.WriteLine(key + "   " + letters_2_num_Hash[key]);}
        }
    }
}

 
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using Microsoft.Office.Core;
using PowerPoint = Microsoft.Office.Interop.PowerPoint;
 
namespace readPPT
{
    class Program
    {
        static void Main(string[] args)
        {
            Microsoft.Office.Interop.PowerPoint.Application PowerPoint_App = new Microsoft.Office.Interop.PowerPoint.Application();
            Microsoft.Office.Interop.PowerPoint.Presentations multi_presentations = PowerPoint_App.Presentations;
            Microsoft.Office.Interop.PowerPoint.Presentation presentation = multi_presentations.Open(@"C:\PPT\myPowerpoint.pptx");
            string presentation_text = "";
            for (int i = 0; i < presentation.Slides.Count; i++)
            {
                foreach (var item in presentation.Slides[i+1].Shapes)
                {
                    var shape = (PowerPoint.Shape)item;
                    if (shape.HasTextFrame == MsoTriState.msoTrue)
                    {
                        if (shape.TextFrame.HasText == MsoTriState.msoTrue)
                        {
                            var textRange = shape.TextFrame.TextRange;
                            var text = textRange.Text;
                            presentation_text += text+" ";
                        }
                    }
                }
            }
            PowerPoint_App.Quit();
            Console.WriteLine(presentation_text);
        }
    }
}