saikat111,al rakib sorder,github

Versatile Software Engineer | Mobile Development, AI/ML, & Quantum Computing Specialist

👋 Hi, I’m @saikat111
👀 I’m passionate about mobile app development, backend systems, and quantum mechanics research.
🌱 Currently exploring advanced topics in quantum computing and enhancing my skills in machine learning.
💞️ I’m open to collaborating on native Android development, backend solutions, and quantum computing projects.
📫 Reach out to me via email at [email protected] or connect with me on Facebook

al rakib sorder's Projects

llmdatahub

A quick guide (especially) for trending instruction finetuning datasets

searching challenge have the function searchingchallenge(str) take str which will be a string and return the longest pattern within the string. a pattern for this challenge will be defined as: if at least 2 or more adjacent characters within the string repeat at least twice. so for example "aabecaa" contains the pattern aa, on the other hand "abbbaac" doesn't contain any pattern. your program should return yes/no pattern/null. so if str were "aabejiabkfabed" the output should be yes abe. if str were "123224" the output should return no null. the string may either contain all characters (a through z only), integers, or both. but the parameter will always be a string type. the maximum length for the string being passed in will be 20 characters. if a string for example is "aa2bbbaacbbb" the pattern is "bbb" and not "aa". you must always return the longest pattern possible. examples