Skip to content

Instantly share code, notes, and snippets.

View jbasinger's full-sized avatar
🔮
One sec

Justin Basinger jbasinger

🔮
One sec
View GitHub Profile
public class ListNode
{
public int val;
public ListNode next;
public ListNode(int val = 0, ListNode next = null)
{
this.val = val;
this.next = next;
}
FROM public.ecr.aws/lambda/dotnet:5.0
#You can alternately also pull these images from DockerHub amazon/aws-lambda-dotnet:5.0
# Copy function code
COPY net5-lambda-template/bin/Debug/net5.0 ${LAMBDA_TASK_ROOT}
# Set the CMD to your handler (could also be done as a parameter override outside of the Dockerfile)
CMD [ "net5-lambda-template::net5_lambda_template.LambdaFunction::Handler" ]
@jbasinger
jbasinger / AllALessThanB.cs
Last active March 12, 2021 22:05
Leetcode Problem 4
/*
* A [--|--]
* B [--|--]
*/
[Test]
public void AllOfAIsLessThanB()
{
var nums1 = new int[]{1,2,3,4};
var nums2 = new int[]{10,11,12,13,14};
var appended = new int[] {1, 2, 3, 4, 10, 11, 12, 13, 14};
@jbasinger
jbasinger / solution.cs
Last active March 13, 2021 01:34
Leetcode Problem 3
public int LengthOfLongestSubstring(string s)
{
if(s.Length == 0)
return 0;
if (s.Length == 1)
return 1;
var maxLength = 1;
var curLength = 0;
@jbasinger
jbasinger / solution.cs
Last active March 14, 2021 00:48
LeetCode Problem 5
public string LongestPalindrome(string s)
{
if (s.Length == 0 || s.Length==1)
return s;
var longestPali = s[0].ToString();
for (var i = 0; i < s.Length; i++)
{
//Walk backward until you find the same character then start looking for a palindrome