Updated readme.

Author: javadev

README.md

@@ -793,7 +793,8 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
 | 1104 |[Path In Zigzag Labelled Binary Tree](src/main/java/g1101_1200/s1104_path_in_zigzag_labelled_binary_tree)| [Java](src/main/java/g1101_1200/s1104_path_in_zigzag_labelled_binary_tree/Solution.java) | Medium | Math, Tree, Binary_Tree | 1 | 58.50
 | 1103 |[Distribute Candies to People](src/main/java/g1101_1200/s1103_distribute_candies_to_people)| [Java](src/main/java/g1101_1200/s1103_distribute_candies_to_people/Solution.java) | Easy | Math, Simulation | 2 | 49.07
 | 1096 |[Brace Expansion II](src/main/java/g1001_1100/s1096_brace_expansion_ii)| [Java](src/main/java/g1001_1100/s1096_brace_expansion_ii/Solution.java) | Hard | String, Breadth_First_Search, Stack, Backtracking | 23 | 60.36
-| 1095 |[Find in Mountain Array](src/main/java/g1001_1100/s1095_find_in_mountain_array)| [Java](src/main/java/g1001_1100/s1095_find_in_mountain_array/MountainArray.java) | |||| 1094 |[Car Pooling](src/main/java/g1001_1100/s1094_car_pooling)| [Java](src/main/java/g1001_1100/s1094_car_pooling/Solution.java) | Medium | Array, Sorting, Heap_Priority_Queue, Simulation, Prefix_Sum | 1 | 99.38
+| 1095 |[Find in Mountain Array](src/main/java/g1001_1100/s1095_find_in_mountain_array)| [Java](src/main/java/g1001_1100/s1095_find_in_mountain_array/Solution.java) | Hard | Array, Binary_Search, Interactive | 0 | 100.00
+| 1094 |[Car Pooling](src/main/java/g1001_1100/s1094_car_pooling)| [Java](src/main/java/g1001_1100/s1094_car_pooling/Solution.java) | Medium | Array, Sorting, Heap_Priority_Queue, Simulation, Prefix_Sum | 1 | 99.38
 | 1093 |[Statistics from a Large Sample](src/main/java/g1001_1100/s1093_statistics_from_a_large_sample)| [Java](src/main/java/g1001_1100/s1093_statistics_from_a_large_sample/Solution.java) | Medium | Math, Two_Pointers, Probability_and_Statistics | 1 | 86.00
 | 1092 |[Shortest Common Supersequence](src/main/java/g1001_1100/s1092_shortest_common_supersequence)| [Java](src/main/java/g1001_1100/s1092_shortest_common_supersequence/Solution.java) | Hard | String, Dynamic_Programming | 10 | 96.12
 | 1091 |[Shortest Path in Binary Matrix](src/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix)| [Java](src/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix/Solution.java) | Medium | Array, Breadth_First_Search, Matrix, Algorithm_II_Day_8_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_5_Matrix_Related_Problems | 22 | 69.99