_{[367 - Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](javascript%2F367-Valid-Perfect-Square.js)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F367-Valid-Perfect-Square.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[74 - Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)} | _{<div align='center'>[✔️](c%2F74-Search-A-2D-Matrix.c)</div>} | _{<div align='center'>[✔️](cpp%2F74-Search-A-2d-Matrix.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F74-Search-A-2D-Matrix.cs)</div>} | _{<div align='center'>[✔️](go%2F74-Search-A-2D-Matrix.go)</div>} | _{<div align='center'>[✔️](java%2F74-Search-A-2D-Matrix.java)</div>} | _{<div align='center'>[✔️](javascript%2F74-Search-A-2D-Matrix.js)</div>} | _{<div align='center'>[✔️](kotlin%2F74-Search-A-2D-Matrix.kt)</div>} | _{<div align='center'>[✔️](python%2F74-Search-a-2D-Matrix.py)</div>} | _{<div align='center'>[✔️](ruby%2F74-Search-a-2D-Matrix.rb)</div>} | _{<div align='center'>[✔️](rust%2F746-Min-Cost-Climbing-Stairs.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](swift%2F74-Search-A-2D-Matrix.swift)</div>} | _{<div align='center'>[✔️](typescript%2F74-Search-a-2D-Matrix.ts)</div>}

_{[875 - Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/)} | _{<div align='center'>[✔️](c%2F875-Koko-Eating-Bananas.c)</div>} | _{<div align='center'>[✔️](cpp%2F875-Koko-Eating-Bananas.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F875-Koko-Eating-Bananas.cs)</div>} | _{<div align='center'>[✔️](go%2F875-Koko-Eating-Bananas.go)</div>} | _{<div align='center'>[✔️](java%2F875-Koko-Eating-Bananas.java)</div>} | _{<div align='center'>[✔️](javascript%2F875-Koko-Eating-Bananas.js)</div>} | _{<div align='center'>[✔️](kotlin%2F875-Koko-Eating-Bananas.kt)</div>} | _{<div align='center'>[✔️](python%2F875-Koko-Eating-Bananas.py)</div>} | _{<div align='center'>[✔️](ruby%2F875-Koko-Eating-Bananas.rb)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](swift%2F875-Koko-Eating-Bananas.swift)</div>} | _{<div align='center'>[✔️](typescript%2F875-Koko-Eating-Bananas.ts)</div>}

_{[33 - Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)} | _{<div align='center'>[✔️](c%2F33-Search-in-Rotated-Sorted-Array.c)</div>} | _{<div align='center'>[✔️](cpp%2F33-Search-In-Rotated-Sorted-Array.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F33-Search-In-Rotated-Sorted-Array.cs)</div>} | _{<div align='center'>[✔️](go%2F33-Search-in-Rotated-Sorted-Array.go)</div>} | _{<div align='center'>[✔️](java%2F33-Search-In-Rotated-Sorted-Array.java)</div>} | _{<div align='center'>[✔️](javascript%2F33-Search-in-Rotated-Sorted-Array.js)</div>} | _{<div align='center'>[✔️](kotlin%2F33-Search-In-Rotated-Sorted-Array.kt)</div>} | _{<div align='center'>[✔️](python%2F33-Search-In-Rotated-Sorted-Array.py)</div>} | _{<div align='center'>[✔️](ruby%2F338-Counting-Bits.rb)</div>} | _{<div align='center'>[✔️](rust%2F33-Search-In-Rotated-Sorted-Array.rs)</div>} | _{<div align='center'>[✔️](scala%2F33-Search-in-Rotated-Sorted-Array.scala)</div>} | _{<div align='center'>[✔️](swift%2F33-Search-in-Rotated-Sorted-Array.swift)</div>} | _{<div align='center'>[✔️](typescript%2F33-Search-in-Rotated-Sorted-Array.ts)</div>}

_{[153 - Find Minimum In Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)} | _{<div align='center'>[✔️](c%2F153-Find-Minimum-in-Rotated-Sorted-Array.c)</div>} | _{<div align='center'>[✔️](cpp%2F153-Find-Minimum-In-Rotated-Sorted-Array.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F153-Find-Minimum-in-Rotated-Sorted-Array.cs)</div>} | _{<div align='center'>[✔️](go%2F153-Find-Minimum-in-Rotated-Sorted-Array.go)</div>} | _{<div align='center'>[✔️](java%2F153-Find-Minimum-in-Rotated-Sorted-Array.java)</div>} | _{<div align='center'>[✔️](javascript%2F153-Find-Minimum-in-Rotated-Sorted-Array.js)</div>} | _{<div align='center'>[✔️](kotlin%2F153-Find-Minimum-In-Rotated-Sorted-Array.kt)</div>} | _{<div align='center'>[✔️](python%2F153-Find-Minimum-in-Rotated-Sorted-Array.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](rust%2F153-Find-Minimum-In-Rotated-Sorted-Array.rs)</div>} | _{<div align='center'>[✔️](scala%2F153-Find-Minimum-In-Rotated-Sorted-Array.scala)</div>} | _{<div align='center'>[✔️](swift%2F153-Find-Minimum-in-Rotated-Sorted-Array.swift)</div>} | _{<div align='center'>[✔️](typescript%2F153-Find-Minimum-in-Rotated-Sorted-Array.ts)</div>}

_{[981 - Time Based Key Value Store](https://leetcode.com/problems/time-based-key-value-store/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F981-Time-Based-Key-Value-Store.cpp)</div>} | _{<divalign='center'>[✔️](csharp%2F981-Time-Based-Key-Value-Store.cs)</div>} | _{<divalign='center'>[✔️](go%2F981-Time-Based-Key-Value-Store.go)</div>} | _{<divalign='center'>[✔️](java%2F981-Time-Based-Key-Value-Store.java)</div>} | _{<divalign='center'>[✔️](javascript%2F981-Time-Based-Key-Value-Store.js)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F981-Time-Based-Key-Value-Store.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](typescript%2F981-Time-Based-Key-Value-Store.ts)</div>}

_{[34 - Find First And Last Position of Element In Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](cpp%2F342-Power-Of-Four.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F34-Find-First-and-Last-Position-of-Element-in-Sorted-Array.cs)</div>} | _{<div align='center'>[✔️](go%2F347-Top-K-Frequent-Elements.go)</div>} | _{<div align='center'>[✔️](java%2F342-Power-of-Four.java)</div>} | _{<div align='center'>[✔️](javascript%2F344-Reverse-String.js)</div>} | _{<div align='center'>[✔️](kotlin%2F347-Top-K-Frequent-Elements.kt)</div>} | _{<div align='center'>[✔️](python%2F34-Find-First-and-Last-Position-of-Element-in-Sorted-Array.py)</div>} | _{<div align='center'>[✔️](ruby%2F347-Top-k-frequent-elements.rb)</div>} | _{<div align='center'>[✔️](rust%2F347-Top-K-Frequent-Elements.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](swift%2F347-Top-k-frequent-elements.swift)</div>} | _{<div align='center'>[✔️](typescript%2F344-Reverse-String.ts)</div>}

_{[33 - Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)} | _{<div align='center'>[✔️](c%2F33-Search-in-Rotated-Sorted-Array.c)</div>} | _{<div align='center'>[✔️](cpp%2F33-Search-In-Rotated-Sorted-Array.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F33-Search-In-Rotated-Sorted-Array.cs)</div>} | _{<div align='center'>[✔️](go%2F33-Search-in-Rotated-Sorted-Array.go)</div>} | _{<div align='center'>[✔️](java%2F33-Search-In-Rotated-Sorted-Array.java)</div>} | _{<div align='center'>[✔️](javascript%2F33-Search-in-Rotated-Sorted-Array.js)</div>} | _{<div align='center'>[✔️](kotlin%2F33-Search-In-Rotated-Sorted-Array.kt)</div>} | _{<div align='center'>[✔️](python%2F33-Search-In-Rotated-Sorted-Array.py)</div>} | _{<div align='center'>[✔️](ruby%2F338-Counting-Bits.rb)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](scala%2F33-Search-in-Rotated-Sorted-Array.scala)</div>} | _{<div align='center'>[✔️](swift%2F33-Search-in-Rotated-Sorted-Array.swift)</div>} | _{<div align='center'>[✔️](typescript%2F33-Search-in-Rotated-Sorted-Array.ts)</div>}

_{[153 - Find Minimum In Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)} | _{<div align='center'>[✔️](c%2F153-Find-Minimum-in-Rotated-Sorted-Array.c)</div>} | _{<div align='center'>[✔️](cpp%2F153-Find-Minimum-In-Rotated-Sorted-Array.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F153-Find-Minimum-in-Rotated-Sorted-Array.cs)</div>} | _{<div align='center'>[✔️](go%2F153-Find-Minimum-in-Rotated-Sorted-Array.go)</div>} | _{<div align='center'>[✔️](java%2F153-Find-Minimum-in-Rotated-Sorted-Array.java)</div>} | _{<div align='center'>[✔️](javascript%2F153-Find-Minimum-in-Rotated-Sorted-Array.js)</div>} | _{<div align='center'>[✔️](kotlin%2F153-Find-Minimum-In-Rotated-Sorted-Array.kt)</div>} | _{<div align='center'>[✔️](python%2F153-Find-Minimum-in-Rotated-Sorted-Array.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](scala%2F153-Find-Minimum-In-Rotated-Sorted-Array.scala)</div>} | _{<div align='center'>[✔️](swift%2F153-Find-Minimum-in-Rotated-Sorted-Array.swift)</div>} | _{<div align='center'>[✔️](typescript%2F153-Find-Minimum-in-Rotated-Sorted-Array.ts)</div>}

_{[981 - Time Based Key Value Store](https://leetcode.com/problems/time-based-key-value-store/)} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](cpp%2F981-Time-Based-Key-Value-Store.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F981-Time-Based-Key-Value-Store.cs)</div>} | _{<div align='center'>[✔️](go%2F981-Time-Based-Key-Value-Store.go)</div>} | _{<div align='center'>[✔️](java%2F981-Time-Based-Key-Value-Store.java)</div>} | _{<div align='center'>[✔️](javascript%2F981-Time-Based-Key-Value-Store.js)</div>} | _{<div align='center'>[✔️](kotlin%2F981-Time-Based-Key-Value-Store.kt)</div>} | _{<div align='center'>[✔️](python%2F981-Time-Based-Key-Value-Store.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](typescript%2F981-Time-Based-Key-Value-Store.ts)</div>}

_{[34 - Find First And Last Position of Element In Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](cpp%2F342-Power-Of-Four.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F34-Find-First-and-Last-Position-of-Element-in-Sorted-Array.cs)</div>} | _{<div align='center'>[✔️](go%2F347-Top-K-Frequent-Elements.go)</div>} | _{<div align='center'>[✔️](java%2F342-Power-of-Four.java)</div>} | _{<div align='center'>[✔️](javascript%2F347-Top-K-Frequent-Elements.js)</div>} | _{<div align='center'>[✔️](kotlin%2F347-Top-K-Frequent-Elements.kt)</div>} | _{<div align='center'>[✔️](python%2F34-Find-First-and-Last-Position-of-Element-in-Sorted-Array.py)</div>} | _{<div align='center'>[✔️](ruby%2F347-Top-k-frequent-elements.rb)</div>} | _{<div align='center'>[✔️](rust%2F347-Top-K-Frequent-Elements.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](swift%2F347-Top-k-frequent-elements.swift)</div>} | _{<div align='center'>[✔️](typescript%2F347-Top-K-Frequent-Elements.ts)</div>}

_{[1898 - Maximum Number of Removable Characters](https://leetcode.com/problems/maximum-number-of-removable-characters/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[116 - Populating Next Right Pointers In Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F1160-Find-Words-That-Can-Be-Formed-by-Characters.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[1268 - Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

classTimeMap {

privatedata classTimeStampValuePair(

valtimestamp:Int,

)

privateval keyMap= mutableMapOf<String,MutableList<TimeStampValuePair>>()

funset(key:String,value:String,timestamp:Int) {

keyMap.getOrPut(key, ::mutableListOf).add(TimeStampValuePair(timestamp, value))

}

funget(key:String,timestamp:Int):String {

if (key!in keyMap.keys)return""

val searchList= keyMap.getValue(key)

if (searchList.isEmpty())return""

return binarySearch(

list= searchList,

targetTimeStamp= timestamp

)

}

privatefunbinarySearch(

list:List<TimeStampValuePair>,

):String {

if (list.first().timestamp> targetTimeStamp)return""

if (list.last().timestamp< targetTimeStamp)return list.last().value

var startIndex=0

var endIndex= list.lastIndex

var midIndex:Int

var result=""

while (startIndex<= endIndex) {

midIndex= startIndex+ (endIndex- startIndex)/2

when {

list[midIndex].timestamp<= targetTimeStamp-> {

if (list[midIndex].timestamp== targetTimeStamp)return list[midIndex].value

result= list[midIndex].value

startIndex= midIndex+1

}

else-> endIndex= midIndex-1

}

}

return result

}

}