Ahmah2009

func findAllConcatenatedWordsInADict(words []string) []string {
    res:= []string{}
    mp:= make(map[string]int)
    
    for _, word := range words {
        mp[word] = 1
    }
    
    for _, word := range words {
        delete(mp, word)

Ahmah2009

func deleteDuplicates(head *ListNode) *ListNode {
    if head == nil{
        return head
    }
    tempNode := &ListNode{Val: head.Val-1, Next:head}

    node:=tempNode
    fast := tempNode.Next
    
    for node.Next!=nil && fast.Next!=nil{

Ahmah2009

func deleteDuplicates(head *ListNode) *ListNode {
    if head == nil {
        return head
    }
    node:=head
    next := head.Next
    
    for node!=nil && next!=nil{
        if node.Val==next.Val{
            temp := next

Ahmah2009

class Solution:
    def climbStairs(self, n: int) -> int:
        if n==0 or n==1 or n==2:
            return n

        m = n+1
        step_n = [0] * m

        step_n[0] = 0
        step_n[1] = 1