꿈꾸는공학도

https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/description/Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Example 1:Input: haystack = "sadbutsad", needle = "sad"Output: 0Explanation: "sad" occurs at index 0 and 6.The first occurrence is at index 0, so we return 0.Exa..

https://leetcode.com/problems/remove-element/description/Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val.Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following things:Change ..

Given a string s, return the longest palindromic substring in s. Example 1:Input: s = "babad"Output: "bab"Explanation: "aba" is also a valid answer.Example 2:Input: s = "cbbd"Output: "bb" Constraints:1 s consist of only digits and English letters.Topics: Two Pointers / String/ Dynamic Programming 1. Pythonclass Solution: def longestPalindrome(self, s: str) -> str: temp={} for i ..

https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Then return the number of unique elements in nums.Consider the number of unique elements of nums to be k, to get accepte..

https://leetcode.com/problems/longest-substring-without-repeating-characters/description/Given a string s, find the length of the longest substring without repeating characters. Example 1:Input: s = "abcabcbb"Output: 3Explanation: The answer is "abc", with the length of 3.Example 2:Input: s = "bbbbb"Output: 1Explanation: The answer is "b", with the length of 1.Example 3:Input: s = "pwwkew"Output..

https://leetcode.com/problems/add-two-numbers/description/You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.You may assume the two numbers do not contain any leading zero, except the number 0 itself. Example 1:Input: l1 = ..

https://github.com/bgg-lee/CS_PRACTICE/tree/main GitHub - bgg-lee/CS_PRACTICE Contribute to bgg-lee/CS_PRACTICE development by creating an account on GitHub. github.com 코딩연습 코드는 타 플랫폼에 저장