diff --git a/google-cloud-firestore/src/main/java/com/google/cloud/firestore/collection/ArraySortedMap.java b/google-cloud-firestore/src/main/java/com/google/cloud/firestore/collection/ArraySortedMap.java
index 7b0c419a3c88..dd23461964d2 100644
--- a/google-cloud-firestore/src/main/java/com/google/cloud/firestore/collection/ArraySortedMap.java
+++ b/google-cloud-firestore/src/main/java/com/google/cloud/firestore/collection/ArraySortedMap.java
@@ -274,7 +274,7 @@ private static <T> T[] replaceInArray(T[] arr, int pos, T value) {
 
   /**
    * This does a linear scan which is simpler than a binary search. For a small collection size this
-   * still should be as fast a as binary search.
+   * still should be as fast as binary search.
    */
   private int findKeyOrInsertPosition(K key) {
     int newPos = 0;
@@ -286,7 +286,7 @@ private int findKeyOrInsertPosition(K key) {
 
   /**
    * This does a linear scan which is simpler than a binary search. For a small collection size this
-   * still should be as fast a as binary search.
+   * still should be as fast as binary search.
    */
   private int findKey(K key) {
     int i = 0;