jeb2239

#include <stdio.h>

/* random record description - could be anything */
struct rec
{
    int x,y,z;
};

/* writes and then reads 10 arbitrary records
   from the file "junk". */

jeb2239

‎‎​

jeb2239

#!/bin/python3

import math
import os
import random
import re
import sys
import functools
#
# Complete the 'passwordCracker' function below.

jeb2239

class Solution:
    # you need startIdx for this prob
    def countVowelStrings(self, n: int) -> int:
        vowels = ['a','e','i','o','u']
        result=[]
        def cvs(curr,n,startIdx):
            if n==1:
                result.append(curr)
                
                return 1

jeb2239

UP=3
LEFT=2
DOWN=1
RIGHT=0


DIRS = [(0,1),(1,0),(0,-1),(-1,0)]

def spiral_copy(inputMatrix):

jeb2239

hello

jeb2239

‎‎​

jeb2239

# https://binarysearch.com/problems/Rod-Cutting
class Solution:
    def solve(self, prices, n):
        
        
        memoRec=[-1]*(n+1)
        def rodCutRec(rodLeft,prices):
            if memoRec[rodLeft]!=-1:
                return memoRec[rodLeft]

jeb2239

import heapq as hq
import sys
import math
from typing import NamedTuple

class Entry(NamedTuple):
    cost:int
    node:int

class Solution:

jeb2239

#buggy code took 20 minutes
class Solution:
    def validateBinaryTreeNodes(
        self, n: int, leftChild: List[int], rightChild: List[int]
    ) -> bool:

        nparent = [0] * n
        for i in range(n):

            leftv = nparent[leftChild[i]]