SDE - 1

Given an array of numbers, find the maximum sum of any contiguous subarray of the array.

For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.

Given the array [-5, -1, -8, -9], the maximum sum would be -1.

Follow up: Do this in O(N) time.

You are given two strings, 'str1' and 'str2'. You have to find the length of the longest common substring.

A substring is a continuous segment of a string. For example, "bcd" is a substring of "abcd", while "acd" or "cda" are not.

Example:

Input: ‘str1’ = “abcjklp” , ‘str2’ = “acjkp”.

Output: 3

Explanation:  The longest common substring between ‘str1’ and ‘str2’ is “cjk”, of length 3.

• What are ACID Properties? (Learn)
• What is Indexing? (Learn)

Past projects, their descriptions, tech stack, and basic architecture.

• REST API working (Learn)
• HTTP vs HTTPS (Learn)
• Ports
• Layers
• TCP vs UDP (Learn)
• How requests hit from the browser
• Django architecture and functioning

• Gen AI: Learn about it from 1-2 courses on deeplearning.ai.
• LLMs: Understand how they work.
• Project + Documentation based on your understanding.

I created a Recipe Generator AI-based application, which was preconfigured to use only the ingredients supplied by the end user, within a limited number of steps (10), and with concise responses.