CodingReview/Program.cs at dev · Vindi-Van/CodingReview · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
using System;

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

            ///////////////////////////////////////////////////////////////////////////////////////////////
            ///// Udemy Coding Course (one with map)
            ///////////////////////////////////////////////////////////////////////////////////////////////

            //// Sample of using timer to see how long a function takes
            //StopWatchEx.StopWatchTest();

            //// Compares 2 arrays to see if there is any common items
            //var stg1 = new string[]{"a", "b", "c", "x"};
            //var stg2 = new string[]{"z", "y","x"};
            //Console.WriteLine(ArrayEx.ContainsCommonType(stg1, stg2));

            //// Check if array has pair with sum
            //var numset = new int[]{6,4,3,2,1,7};
            //Console.WriteLine(ArrayEx.HasPairWithSum(numset, 10));

            //// ArraySamples and MyArray
            //ArrayEx.ArraySamples();

            //MyArray myArray = new MyArray();
            //myArray.push("Hello");
            //myArray.push("World");
            //myArray.push("!");
            //for (int i = 0; i < myArray.length; i++)
            //{
            //    Console.WriteLine(myArray.get(i));
            //}


            //// Graph Example
            /*
            Graph graph = new Graph();
            graph.addVertex(0);
            graph.addVertex(1);
            graph.addVertex(2);
            graph.addVertex(3);
            graph.addVertex(4);
            graph.addVertex(5);
            graph.addVertex(6);
            graph.addEdge(3, 1);
            graph.addEdge(3, 4);
            graph.addEdge(4, 2);
            graph.addEdge(4, 5);
            graph.addEdge(1, 2);
            graph.addEdge(1, 0);
            graph.addEdge(0, 2);
            graph.addEdge(6, 5);
            graph.showConnections();
            */

            //// Binary Search Tree

            BinarySearchTree tree = new BinarySearchTree();
            tree.insert(9);
            tree.insert(4);
            tree.insert(6);
            tree.insert(20);
            tree.insert(170);
            tree.insert(15);
            tree.insert(1);

            tree.printTree(tree.root);
            // BreadthFirstSearch
            var bfsList = BreadthFirstSearch.breathFirstSearch(tree.root);
            Console.Write("Breadth first search ");
            Console.WriteLine(String.Join(",", bfsList));
            // DepthFirstSearch
            var dfsInOrder = DepthFirstSearch.DFSInOrder(tree.root);
            Console.Write("Depth first search inOrder ");
            Console.WriteLine(String.Join(",", dfsInOrder));
            var dfsPreOrder = DepthFirstSearch.DFSPreOrder(tree.root);
            Console.Write("Depth first search preOrder ");
            Console.WriteLine(String.Join(",", dfsPreOrder));
            var dfsPostOrder = DepthFirstSearch.DFSPostOrder(tree.root);
            Console.Write("Depth first search postOrder ");
            Console.WriteLine(String.Join(",", dfsPostOrder));


            ///////////////////////////////////////////////////////////////////////////////////////////////
            /////Amzaon Questions
            ///////////////////////////////////////////////////////////////////////////////////////////////
            //Group Audible Questions
            /*
            int[][] Group = new int[][]{
                new int[] {1,1,0,0},
                new int[] {1,1,1,0},
                new int[] {0,1,1,1},
                new int[] {0,0,1,1}};
            var distinctGroup = Amazon.FindGroupAudible(Group);
            Console.WriteLine("Distinct Group: " + distinctGroup);
            */

            //Circle Robot
            /*
            Console.WriteLine("Robot Bound Circle: " + Amazon.RobotBoundInCircle("GLL"));
            */

            //Optimizing Box
            /*
            int[] arr1 = new int[] {4,2,3,35,7,13,13,11,12,5,1,6};
            Console.WriteLine("Optimizing Box: ");
            Console.WriteLine( String.Join(" ", Amazon.OptimizeBox(arr1)));
            printArray(Amazon.OptimizeBox(arr1));
            */

            //ShoppingOptions
            //Console.WriteLine("Shopping Option : " + Amazon.ShoppingOptions());

            ////////////////////////////////////////////////////////////
            //JudgeCircle
            /*
            Console.WriteLine("Judge Circle: " + Example.JudgeCircle("UUDLLDDRR"));
            */

            //Coin Combination (Dynamic Programming)
            //int[] coins = new int[] {1,2,5};
            //Console.WriteLine("Coin Combination: " + Example.CoinCombination(10, coins));


        }

        public static void printArray(int[] arr){
            for(int i = 0; i < arr.Length; i++){
                Console.WriteLine(arr[i]);
            }
        }
    }
}