This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import android.os.Environment; | |
import android.support.v7.app.AppCompatActivity; | |
/** | |
* Created by tanmaybaranwal on 14/02/17. | |
*/ | |
import android.app.Activity; | |
import android.net.Uri; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{% set CLUSTER_NAME = env['deployment'] + '-' + env['name'] %} | |
resources: | |
- name: {{ properties['gkeClusterName'] }} | |
type: container.v1.cluster | |
properties: | |
zone: {{ properties['zone'] }} | |
cluster: | |
name: {{ properties['gkeClusterName'] }} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class StringClassifier: | |
def __init__(self, input_data: list): | |
self.input_list = input_data | |
self.input_dict = dict(enumerate(input_data)) | |
self.sorted_dict = dict(enumerate(list(map(lambda x: "".join(sorted(x)), input_data)))) | |
def process(self) -> list: | |
reverse_dict = {} | |
processed_list = [] | |
for key, value in self.sorted_dict.items(): |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def find_triplets(array): | |
n = len(array) | |
array.sort() | |
triplets = [] | |
for index in range(0, n-1): | |
starting_pointer = index + 1 | |
end_pointer = n - 1 | |
curr_value = array[index] | |
while (starting_pointer < end_pointer): | |
if (curr_value + array[starting_pointer] + array[end_pointer] == 0): |