Error
|
|
---|---|
@Ibrahim Nash | 5761 |
@blackshadows | 5701 |
@akhayrutdinov | 5111 |
@mb1973 | 4989 |
@Quandray | 4944 |
@saiujwal13083 | 4506 |
@sanjay05 | 3762 |
@marius_valentin_dragoi | 3516 |
@sushant_a | 3459 |
@verma_ji | 3341 |
@KshamaGupta | 3318 |
Complete Leaderboard | |
|
|
@aroranayan999 | 938 |
@bt8816103042 | 739 |
@SHOAIBVIJAPURE | 428 |
@codeantik | 412 |
@SherlockHolmes3 | 407 |
@neverevergiveup | 348 |
@mahlawatep | 347 |
@shalinibhataniya1097 | 343 |
@murarry3625 | 333 |
@saiujwal13083 | 326 |
@rohitanand | 314 |
Complete Leaderboard |
Given a string S and a character X, the task is to find the last index (0 based indexing) of X in string S. If no index found then the answer will be -1.
Example 1:
Input: S = "Geeks", P = 'e'
Output: 2
Explanation: Last index of 'e'
is 2.
​Example 2:
Input: S = "okiyh", P = 'z'
Output: -1
Explanation: There is no character
as 'z'.
Your Task:
You don't need to read input or print anything. Your task is to complete the function LastIndex() which takes the string s and character p as inputs and returns the answer.
Expected Time Complexity: O(|S|)
Expected Auxiliary Space: O(1)
Constraints:
1 ≤ |S| ≤ 105
S and P contain only lower and upper case alphabets.
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes