3304. Find the K-th Character in String Game I | Leetcode | Python in Tamil | Soumil Speaks

🎮 3304. Find the K-th Character in String Game I | Leetcode | Python in Tamil 🇮🇳
Welcome to Soumil Speaks! In this video, we solve a smart string simulation + math problem:
How to find the k-th character in a string that grows based on specific repeating rules — without actually generating the full string!

Perfect for those preparing for coding interviews or Leetcode contests.

🎯 What you'll learn:

How to solve the problem without full simulation

Smart way to reverse-trace the k-th character

Python logic using greedy & math

Time-efficient approach with dry-run in Tamil

Avoiding brute-force and Time Limit Exceeded errors

📌 Language: Tamil
📌 Difficulty: Medium
📌 Problem ID: Leetcode 3304
📌 Best For: DSA learners, interview prep, string logic practice

📣 Subscribe to Soumil Speaks for Tamil-based DSA, coding, and placement tips!

🧠 Core Idea:

Each string grows based on repeat values

Keep track of total length instead of building the actual string

Work backward from k to figure out which original character it maps to

📌 Hashtags:
#Leetcode3304 #KthCharacter #StringGame #SoumilSpeaks #PythonInTamil #DSATamil #CodingInTamil #GreedyAlgorithm #StringSimulation #PlacementPrep #LeetcodeMedium

[beingc]

good explanation i tried without cnt class Solution:
def kthCharacter(self, k: int) -> str:
word = "a"
while len(word) <= k:
n = len(word)
for i in range(n):
if word[i] == "z":
word += "a"
else:
word += chr(ord(word[i]) + 1)
return word[k-1]