<SYSTEM_TASK:>
Given the following text description, write Python code to implement the functionality described.
<END_TASK>
<USER_TASK:>
Description:
Lexicographically largest sub
Function to return the lexicographically largest sub - sequence of s ; Get the max character from the string ; Use all the occurrences of the current maximum character ; Repeat the steps for the remaining string ; Driver code

<ASSISTANT_TASK:>
Python Code:
def getSubSeq(s , n ) : 
	 res = ""
 cr = 0 
 while(cr < n ) : 
	 mx = s[cr ] 
 for i in range(cr + 1 , n ) : 
	 mx = max(mx , s[i ] ) 
  lst = cr 
 for i in range(cr , n ) : 
	 if(s[i ] == mx ) : 
	 res += s[i ] 
 lst = i 
   cr = lst + 1 
  return res 
  if __name__== ' __main __' : 
	 s = "geeksforgeeks "
 n = len(s ) 
 print(getSubSeq(s , n ) ) 
 
<END_TASK>
