Program.cs

using LeetCode.ArrayOrString.Easy;
using LeetCode.BinarySearch.Easy;
using LeetCode.BinarySearch.Medium;
using LeetCode.Hashmap.Easy;
using LeetCode.TwoPointers.Easy;

namespace LeetCode
{
    class Program
    {
        static void Main(string[] args)
        {
            // var mE = new MajorityElement();
            // mE.CalculateMajorityElement();

            // var rE = new RemoveElement();
            // rE.RemoveElementFromArray();

            // var mS = new MergeStrings();
            // mS.DoMergeStrings();

            // var mP = new MaxProfit();
            // mP.CalculateMaxProfit();

            // var mS = new MergeSortedArray();
            // mS.DoMerge();

            // var cP = new ValidPalindrome();
            // cP.CheckIfPalidrome();

            // var sS = new SubSequence();
            // sS.CheckIfSubstring();

            // var rN = new RansomeNote();
            // rN.CheckCanConstruct();

            // var sIP = new SearchInsertPosition();
            // sIP.Search();

            var pE = new PickElement();
            pE.GetPeakElement();
        }
    }
}