|
MapLibre Native Core
|
return slow.data
def first_non_repeating_char(s): char_count = {} for char in s: if char in char_count: char_count[char] += 1 else: char_count[char] = 1
Example: Input - "aabbc", Output - "c"
return None
Given a string, find the first non-repeating character in it. Tcs Coding Questions 2021
class Node: def __init__(self, data): self.data = data self.next = None
Here are some TCS coding questions from 2021, along with a useful piece of code for each: return slow
Example: Input - 1 -> 2 -> 3 -> 4 -> 5, Output - 3
for char in s: if char_count[char] == 1: return char Tcs Coding Questions 2021
print(count_pairs_with_sum([1, 2, 3, 4, 5], 7)) # Output: 2
def is_palindrome(s): return s == s[::-1]