uk
Feedback

Не попадись на ботовода! Telemetrio знаходить і позначає такі канали мітками 👉 Хочеш бачити мітку, оформляй підписку

Coding All slot Solution

Coding All slot Solution

Відкрити в Telegram

500+ Placement & Competitive Exam Materials 75+ Companies Materials 100+ JOB Updates in a Month 🚀DM for Promotion @Wren_0 🚀Placement Updates: @offcampusjobs_0 🌟 Placment Material: @placement_materials0

Показати більше
ІндіяКатегорія не вказана
2 221
Підписники
Немає даних24 години
Немає даних7 днів
Немає даних30 днів
Архів дописів
Dm me for both round available

Hi Amrit Nath , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0

Hi Carl Ellis Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @offcampusjobs_0 @offcampusjobs_0

Hi Coders_k , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0

Ans

Hi Nan Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @offcampusjobs_0 @offcampusjobs_0

E learning code?

Hi Sravani Welcome to this Community, Subscribe Our YouTube Channel📣 for Daily Jobs Updates and Study Material

Hi Naga Swetha , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0

Python & C++ Annual Day Code https:http://t.me/Coding_solution_0

Anyone need help in Deloitte or Accenture.

Hi Dutiful Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @offcampusjobs_0 @offcampusjobs_0

Infosys tomorrow 27th Jan Joining ?
Public voting

def findLongestRepeatingSubSeq( str): n = len(str) # Create and initialize DP table dp=[[0 for i in range(n+1)] for j in range(n+1)] # Fill dp table (similar to LCS loops) for i in range(1,n+1): for j in range(1,n+1): # If characters match and indexes are # not same if (str[i-1] == str[j-1] and i != j): dp[i][j] = 1 + dp[i-1][j-1] # If characters do not match else: dp[i][j] = max(dp[i][j-1], dp[i-1][j]) return dp[n][n] # Driver Program if name=='main': str = input() print(findLongestRepeatingSubSeq(str))

Hi @unknown Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @offcampusjobs_0 @offcampusjobs_0

@nxthiring_Owner [1383657512] is sending a spam message. Action: Warn (1/3) ❕ until 27/05/2023 21:25.

God your faithful to fail me Is this a dream or what,am so excited Right now I can't believe myself withdraw today Jesus Christ after what scammer has done to me,I can't believe I will see a trust and real platform all thanks to Logan_CA00 who keep to his world and put food in my table,my God will bless you Click here see God Blessing's 👇👇👇👇👇👇👇👇 @Logan_CA00 @Logan_CA00