Muhammad Suleman's Projects
Question Answer application using ObjectBox vector database, Gpt4o and langchain
This project is an end-to-end data engineering pipeline that orchestrates data ingestion, processing, and storage using a suite of powerful tools and technologies. The pipeline is designed for ease of deployment and scalability, leveraging Docker to containerize all components.
Recurrent Neural Network(RNN) and Long Short-Term Memory(LSTM) implementation for word prediction in the sentance
Shopping cart basket web application, web api, web api client application, Asp.net core, asp.net core web api, entityframwork core in memory
Migrate your SQL Server relational database to Large Language Models (LLM) effortlessly with ChromaDB. Enhance query optimization and performance.
full-fledged Streamlit app user interface to interact with our local model using Ollama! I chose Streamlit because it is easy to get started and very composable.
tbt podcast https://www.youtube.com/@TBTGO/videos ai chat bot
INTRODUCTION Spend as much time as required to solve this problem. No time limit is applied. Write production quality code in your usual style, using C#. Do not use built-in language functionality to directly solve the problem. So do not use the built-in pattern matching functions: String::split(), String::indexOf(), String::lastIndexOf(), String::substring(), Regex.Match(), etc... The solution should provide this functionality if applicable. You may use the String class to hold information while your own algorithm does the matching. Do not copy an existing algorithm from the Internet; you do not need to implement the fastest possible algorithm. You may choose any means of accepting input and producing output, including the use of a test harness. Note: String functions not related to matching can be used. Please return the completed code in a zip file named CODE_TEST_<Candidate Name>.zip REQUIREMENTS Write an application that fulfils the following requirements: 1. Accepts two strings as input: one string is called "text" and the other is called "subtext" in this problem statement, 2. Matches the subtext against the text, outputting the character positions of the beginning of each match for the subtext within the text. 3. Allows multiple matches 4. Allows case insensitive matching ACCEPTANCE CRITERIA Input text: Polly put the kettle on, polly put the kettle on, polly put the kettle on we'll all have tea Subtext: Output: INTERCONTINENTAL EXCHANGE Code Test: Text Matching | v 1.00 © 2017 Intercontinental Exchange, Inc. Polly 1, 26, 51 Subtext: Output: polly 1, 26, 51 Subtext: Output: ll 3, 28, 53, 78, 82 Subtext: Output: Ll 3, 28, 53, 78, 82 Subtext: Output: X <no matches> Subtext: Output: Polx <no matches>
translate video with lipsync
translate youtube transcript
Twin-Strings-Problem Here is a solution provided to the twin strings problem. Problem Description Two strings, a and b, are said to be twins only if they can be made equivalent by performing some number of operations on one or both strings. There are two possible operations: SwapEven: Swap a character at an even-numbered index with a character at another even-numbered index. SwapOdd: Swap a character at an odd-numbered index with a character at another odd-numbered index. For example, a = "abcd" and b = "cdab" are twins because we can make them equivalent by performing operations. Alternatively, a = "abcd" and b = "bcda" are not twins (operations do not move characters between odd and even indices), and neither are a = "abc" and b = "ab" (no amount of operations will insert a 'c' into string b). Complete the twins function in the provided code. It has two parameters: An array of n strings named a. An array of n strings named b. The function must return an array of strings where each index i (0 ≤ i < n) contains the string Yes if ai and bi are twins or the string No if they are not. Input Format The provided code reads the following input from stdin and passes it to the function: The first line contains an integer, n, denoting the number of elements in a. Each line i of the n subsequent lines (where 0 ≤ i < n) contains a string describing ai. The next line contains an integer, n, denoting the number of elements in b. Each line i of the n subsequent lines (where 0 ≤ i < n) contains a string describing bi. Constraints 1 ≤ n ≤ 10^3 1 ≤ lengths of ai, bi ≤ 100 ai and bi are not guaranteed to have the same length. Strings ai and bi contain lowercase letters only (i.e., a through z). Output Format The function must return an array of strings where each index i (0 ≤ i < n) contains the string Yes if ai and bi are twins or the string No if they are not. Sample Input 0 2 cdab dcba 2 abcd abcd Sample Output 0 Yes No Explanation 0 Given a = ["cdab", "dcba"] and b = ["abcd", "abcd"], we process each element like so: a0 = "cdab" and b0 = "abcd": We store Yes in index 0 of the return array because a0 = "cdab" → "adcb" → "abcd" = b0. a1 = "dcba" and b1 = "abcd": We store No in index 1 of the return array because no amount of operations will move a character from an odd index to an even index, so the two strings will never be equal. We then return the array ["Yes", "No"] as our answer.
TypeSence console for bulk insert update
Create web application by using Asp.nte Web Api, nUnit, Moq Asp.net MVC
aws server less ymal
AI question answer chatbot for youtube channel
AI question answer hub for youtube channel's
youtube video transcript
youtube video
zeeshan usmani, youtube video AI chatbot