EquiLeader

        /// <summary>
        /// Solution
        /// 100/100
        /// </summary>
        /// <param name="A"></param>
        /// <returns></returns>
        public static int solution(int[] A)
        {
            int result = 0;
            int max = 0;
            int leader = 0;
            int leftLeader = 0;
            int rightLeader = 0;

            int[] arrLeftLeader = new int[A.Length];
            int[] arrRightLeader = new int[A.Length];
            Dictionary<int, int> dic = new Dictionary<int, int>();

            for (int i = 0; i < A.Length; i++)
            {
                if (!dic.ContainsKey(A[i]))
                    dic.Add(A[i], 1);
                else
                    dic[A[i]]++;

                if (dic[A[i]] > max)
                {
                    max = dic[A[i]];
                    leader = A[i];
                }
                if (max > (i + 1) / 2)
                    arrLeftLeader[i] = leader;
                else
                    arrLeftLeader[i] = -1;
            }

            max = 0;
            dic.Clear();

            for (int i = A.Length - 1; i >= 0; i--)
            {
                if (!dic.ContainsKey(A[i]))
                    dic.Add(A[i], 1);
                else
                    dic[A[i]]++;

                if (dic[A[i]] > max)
                {
                    max = dic[A[i]];
                    leader = A[i];
                }
                if (max > (A.Length - i) / 2)
                    arrRightLeader[i] = leader;
                else
                    arrRightLeader[i] = -1;
            }

            for (int i = 0; i < A.Length - 1; i++)
            {
                leftLeader = arrLeftLeader[i];
                rightLeader = arrRightLeader[i + 1];
                if (leftLeader != -1 && rightLeader != -1 && leftLeader == rightLeader)
                    result++;
            }

            return result;
        }