{"id":165,"date":"2022-03-05T20:13:22","date_gmt":"2022-03-06T01:13:22","guid":{"rendered":"https:\/\/sites.temple.edu\/vahid\/?p=165"},"modified":"2022-03-05T20:13:23","modified_gmt":"2022-03-06T01:13:23","slug":"some-hackerrank-solutions","status":"publish","type":"post","link":"https:\/\/sites.temple.edu\/vahid\/2022\/03\/05\/some-hackerrank-solutions\/","title":{"rendered":"Some HackerRank Solutions"},"content":{"rendered":"\n<p class=\"has-regular-font-size\"><strong>Balanced Brackets<\/strong><\/p>\n\n\n\n<p><a href=\"https:\/\/www.hackerrank.com\/challenges\/balanced-brackets\/problem\">https:\/\/www.hackerrank.com\/challenges\/balanced-brackets\/problem<\/a><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>#!\/bin\/python3\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\n\r\n#\r\n# Complete the 'isBalanced' function below.\r\n#\r\n# The function is expected to return a STRING.\r\n# The function accepts STRING s as parameter.\r\n#\r\n\r\ndef isBalanced(s):\r\n    # Write your code here\r\n    br = &#091;]\r\n    isbal = 'YES'\r\n    for c in s:\r\n        if c in &#091;'{', '(', '&#091;']:\r\n            br.append(c)\r\n        elif c in &#091;'}', ')', ']']:\r\n            if len(br) == 0:\r\n                isbal = 'NO'\r\n                break\r\n            elif ((c == '}') &amp; (br&#091;-1] != '{') | \r\n                (c == ')') &amp; (br&#091;-1] != '(') | \r\n                (c == ']') &amp; (br&#091;-1] != '&#091;')):\r\n                isbal = 'NO'\r\n                break\r\n            else:\r\n                br.pop(-1)\r\n    if len(br) &gt; 0:\r\n        isbal = 'NO'\r\n    return isbal                \r\n\r\nif __name__ == '__main__':\r\n    fptr = open(os.environ&#091;'OUTPUT_PATH'], 'w')\r\n\r\n    t = int(input().strip())\r\n\r\n    for t_itr in range(t):\r\n        s = input()\r\n\r\n        result = isBalanced(s)\r\n\r\n        fptr.write(result + '\\n')\r\n\r\n    fptr.close()\r\n<\/code><\/pre>\n\n\n\n<p><strong>Queue using Two Stacks<\/strong><\/p>\n\n\n\n<p><a href=\"https:\/\/www.hackerrank.com\/challenges\/queue-using-two-stacks\/problem\">https:\/\/www.hackerrank.com\/challenges\/queue-using-two-stacks\/problem<\/a><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code># Enter your code here. Read input from STDIN. Print output to STDOUT\r\n\r\nif __name__ == '__main__':\r\n    nq = int(input())\r\n    q = &#091;]\r\n    for _ in range(nq):\r\n        a = input()\r\n        if a&#091;0] == '1':\r\n            b = int(a&#091;2:])\r\n            q = q + &#091;b]\r\n        elif a&#091;0] == '2':\r\n            q = q&#091;1:]\r\n        elif a&#091;0] == '3':\r\n            print(q&#091;0])\r\n<\/code><\/pre>\n\n\n\n<p><strong>Merge two sorted linked lists<\/strong><\/p>\n\n\n\n<p><a href=\"https:\/\/www.hackerrank.com\/challenges\/merge-two-sorted-linked-lists\/problem\">https:\/\/www.hackerrank.com\/challenges\/merge-two-sorted-linked-lists\/problem<\/a><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>#!\/bin\/python3\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\n\r\nclass SinglyLinkedListNode:\r\n    def __init__(self, node_data):\r\n        self.data = node_data\r\n        self.next = None\r\n\r\nclass SinglyLinkedList:\r\n    def __init__(self):\r\n        self.head = None\r\n        self.tail = None\r\n\r\n    def insert_node(self, node_data):\r\n        node = SinglyLinkedListNode(node_data)\r\n\r\n        if not self.head:\r\n            self.head = node\r\n        else:\r\n            self.tail.next = node\r\n\r\n\r\n        self.tail = node\r\n\r\ndef print_singly_linked_list(node, sep, fptr):\r\n    while node:\r\n        fptr.write(str(node.data))\r\n\r\n        node = node.next\r\n\r\n        if node:\r\n            fptr.write(sep)\r\n\r\n# Complete the mergeLists function below.\r\n\r\n#\r\n# For your reference:\r\n#\r\n# SinglyLinkedListNode:\r\n#     int data\r\n#     SinglyLinkedListNode next\r\n#\r\n#\r\ndef mergeLists(head1, head2):\r\n    h1, h2 = &#091;], &#091;]\r\n    while(head1):\r\n        h1.append(head1.data)\r\n        head1 = head1.next\r\n    while(head2):\r\n        h2.append(head2.data)\r\n        head2 = head2.next\r\n    s = sorted(h1+h2)\r\n    ret = SinglyLinkedList();\r\n    for v in s:\r\n        ret.insert_node(v)\r\n    return ret.head\r\n\r\n\r\nif __name__ == '__main__':\r\n    fptr = open(os.environ&#091;'OUTPUT_PATH'], 'w')\r\n\r\n    tests = int(input())\r\n\r\n    for tests_itr in range(tests):\r\n        llist1_count = int(input())\r\n\r\n        llist1 = SinglyLinkedList()\r\n\r\n        for _ in range(llist1_count):\r\n            llist1_item = int(input())\r\n            llist1.insert_node(llist1_item)\r\n            \r\n        llist2_count = int(input())\r\n\r\n        llist2 = SinglyLinkedList()\r\n\r\n        for _ in range(llist2_count):\r\n            llist2_item = int(input())\r\n            llist2.insert_node(llist2_item)\r\n\r\n        llist3 = mergeLists(llist1.head, llist2.head)\r\n\r\n        print_singly_linked_list(llist3, ' ', fptr)\r\n        fptr.write('\\n')\r\n\r\n    fptr.close()\r\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Balanced Brackets https:\/\/www.hackerrank.com\/challenges\/balanced-brackets\/problem Queue using Two Stacks https:\/\/www.hackerrank.com\/challenges\/queue-using-two-stacks\/problem Merge two sorted linked lists https:\/\/www.hackerrank.com\/challenges\/merge-two-sorted-linked-lists\/problem<\/p>\n","protected":false},"author":18759,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[101],"tags":[102,4,103],"class_list":["post-165","post","type-post","status-publish","format-standard","hentry","category-programming","tag-hackerrank","tag-python","tag-solution","entry"],"_links":{"self":[{"href":"https:\/\/sites.temple.edu\/vahid\/wp-json\/wp\/v2\/posts\/165","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sites.temple.edu\/vahid\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/sites.temple.edu\/vahid\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/sites.temple.edu\/vahid\/wp-json\/wp\/v2\/users\/18759"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.temple.edu\/vahid\/wp-json\/wp\/v2\/comments?post=165"}],"version-history":[{"count":0,"href":"https:\/\/sites.temple.edu\/vahid\/wp-json\/wp\/v2\/posts\/165\/revisions"}],"wp:attachment":[{"href":"https:\/\/sites.temple.edu\/vahid\/wp-json\/wp\/v2\/media?parent=165"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/sites.temple.edu\/vahid\/wp-json\/wp\/v2\/categories?post=165"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/sites.temple.edu\/vahid\/wp-json\/wp\/v2\/tags?post=165"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}