Programming Tech Brief By HackerNoon

Programming Tech Brief By HackerNoon

Download on the App Store

All Programming Tech Brief By HackerNoon episodes

  • How to Build a 2FA Application in Python

    This story was originally published on HackerNoon at: https://hackernoon.com/how-to-build-a-2fa-application-in-python.


    Sometimes the best way to learn how to code something is by looking at an example, so we’ve created a sample application on GitHub.
    Check more stories related to programming at: https://hackernoon.com/c/programming.
    You can also check exclusive content about #plivo, #good-company, #programming, #technology, #2fa, #two-factor-authentication, #python, #cybersecurity, #hackernoon-es, and more.


    This story was written by: @plivo. Learn more about this writer by checking @plivo's about page,
    and for more stories, please visit hackernoon.com.


    It’s easier than you might think to add two-factor authentication (2FA) to your applications. The secret is to use APIs provided by a cloud communications platform like Plivo.
    Sometimes the best way to learn how to code something is by looking at an example, so we’ve created a sample application on GitHub.
    To use it, you need a Plivo account; you can sign up for free and get enough free credits to lease a phone number with which to send or receive messages and build some starter applications.
    If this is your first time using Plivo APIs, Plivo’s documentation provides instructions on how to set up a Python development environment, including installing the Plivo Python SDK, setting up a Flask server, and installing ngrok, which exposes local servers running behind NATs and firewalls to the public internet over secure tunnels.

    3 min
  • Java Algorithms: Coding a Binary Tree Right Side View (LeetCode)

    This story was originally published on HackerNoon at: https://hackernoon.com/java-algorithms-coding-a-binary-tree-right-side-view-leetcode.


    In this article, you will learn how to code a Binary Tree Right side view in LeetCode.
    Check more stories related to programming at: https://hackernoon.com/c/programming.
    You can also check exclusive content about #javascript, #java, #leetcode, #computer-science, #data-structures, #algorithms, #competitive-coding, #programming, #hackernoon-es, and more.


    This story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page,
    and for more stories, please visit hackernoon.com.


    Given the root of a binary tree, imagine yourself standing on the right side of it. Then, return the values of the nodes you can see ordered from top to bottom. I would say it’s a pretty popular question during coding interviews Using simple words — think of the level for a particular node in a binary tree as the depth of that node. This code gives us linear time and space complexity, and it performs pretty well.

    3 min
  • How To Merge Two Sorted Lists

    This story was originally published on HackerNoon at: https://hackernoon.com/how-to-merge-two-sorted-lists.


    We can use LinkedList to merge both sorted lists, though there are considerations to doing it single or double-linked that may complicate the operation.
    Check more stories related to programming at: https://hackernoon.com/c/programming.
    You can also check exclusive content about #leetcode, #data-structures, #computer-science, #tech, #programming, #learn-programming, #programming-tips, #competitive-coding, #hackernoon-es, and more.


    This story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page,
    and for more stories, please visit hackernoon.com.


    The list should be made by splicing together the nodes of the first two lists. It could be singly linked or doubly linked. The number of nodes in both lists is in the range `[0, 50]`-100 <= 100` The first Linked node is usually called the head whereas the last one is called the tail. The solution has a solution and we’ll discuss it in terms of big O notation. We’re looking for a node with minimal value stored in it. We move the pointer to the next for LinkedList which has a head. We also need a current node for storing the link of the current node.

    3 min
  • How to Implement Trie (Prefix Tree) - Blind 75 LeetCode Questions

    This story was originally published on HackerNoon at: https://hackernoon.com/how-to-implement-trie-prefix-tree-blind-75-leetcode-questions.


    A trie (pronounced as “try”) or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings.
    Check more stories related to programming at: https://hackernoon.com/c/programming.
    You can also check exclusive content about #leetcode, #data-structures, #computer-science, #tech, #programming, #learn-programming, #programming-tips, #competitive-coding, #hackernoon-es, and more.


    This story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page,
    and for more stories, please visit hackernoon.com.


    Trie is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker. The Trie data structure is the classic data structure that is widely used in text searching. We need to implement Trie with the following method: Trie() and Trie.insert(). In the real example of Trie we had to introduce a small part of the data structure which consists of smaller pieces called **Tree. nodes.

    5 min
  • Implementing a Singly or Doubly Linked List in Java (A LeetCode Question)

    This story was originally published on HackerNoon at: https://hackernoon.com/implementing-a-singly-or-doubly-linked-list-in-java-a-leetcode-question.


    Design your implementation of the linked list. You can choose to use a singly or doubly linked list.
    Check more stories related to programming at: https://hackernoon.com/c/programming.
    You can also check exclusive content about #leetcode, #linked-lists, #data-structures-and-algorithms, #leetcode-practice, #coding-interviews, #computer-science, #software-engineering, #software-development, #hackernoon-es, and more.


    This story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page,
    and for more stories, please visit hackernoon.com.


    This task may help you to build or improve your skill of dividing tasks into smaller pieces. It can be solved in many different ways that if we are to describe them you’ll be bored and tired of reading that amount of information. I’m pretty sure many of you struggle to understand how this data structure works and where it works can be used to help you understand how it works. I suggest diving deeper and implementing our version of LinkedList, where you can be able to understand where this data works.

    7 min
  • Java Algorithms: Linked List in Binary Tree (LeetCode)

    This story was originally published on HackerNoon at: https://hackernoon.com/java-algorithms-linked-list-in-binary-tree-leetcode.


    Linked List in Binary Tree
    Check more stories related to programming at: https://hackernoon.com/c/programming.
    You can also check exclusive content about #leetcode, #binary-tree, #linked-list, #algorithms, #self-studying, #coding, #learning-to-code, #learn-to-code, #hackernoon-es, and more.


    This story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page,
    and for more stories, please visit hackernoon.com.


    The number of nodes in the tree will be in the range `[1, 2500]` For each node in the linked list and binary tree. The maximum of the number of node in a binary tree is 2500 nodes in a linked list. The only difference is that TreeTree has an additional pointer and that is all. In fact, you can represent some types of BinaryTrees using LinkedLists using the same pointer. We need to find out if a given binary tree contains a given. binary tree containing a. linked list starting from the. head. If all the elements in the. linked. list from the `head` correspond to some *downward path* connected in the binary tree otherwise return False.

    6 min
  • Java Algorithms: Merge k Sorted Lists (LeetCode)

    This story was originally published on HackerNoon at: https://hackernoon.com/java-algorithms-merge-k-sorted-lists-leetcode.


    An easy approach to the hard leetcode problem Merge k Sorted Lists from that many people using Java Algorithms will need to learn in order to be effective.
    Check more stories related to programming at: https://hackernoon.com/c/programming.
    You can also check exclusive content about #data-structures, #linked-lists, #interview-questions, #how-to-code, #leetcode, #coding, #java, #algorithms, #hackernoon-es, and more.


    This story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page,
    and for more stories, please visit hackernoon.com.


    ask description:
    You are given an array of k linked-lists lists, each linked-list is sorted in ascending order.
    Merge all the linked-lists into one sorted linked-list and return it.
    Example 1:
    Input: lists = [[1,4,5],[1,3,4],[2,6]]
    Output: [1,1,2,3,4,4,5,6]
    Explanation: The linked-lists are:
    [
    1->4->5,
    1->3->4,
    2->6
    ]
    merging them into one sorted list:
    1->1->2->3->4->4->5->6

    4 min
  • Git Branch Naming Convention: 7 Best Practices to Follow

    This story was originally published on HackerNoon at: https://hackernoon.com/git-branch-naming-convention-7-best-practices-to-follow-1c2l33g2.


    Git branching naming conventions support the organic growth of a codebase in a systematic way. It helps in separating the work strategically.
    Check more stories related to programming at: https://hackernoon.com/c/programming.
    You can also check exclusive content about #git, #git-workflow, #github, #github-pages, #gitflow, #git-tags, #coding, #programming, #hackernoon-es, and more.


    This story was written by: @digitalverma. Learn more about this writer by checking @digitalverma's about page,
    and for more stories, please visit hackernoon.com.


    The Git branch naming convention supports the organic growth of a codebase in a systematic way. It helps in separating the work strategically. There are a large number of recommended conventions and formats, following which could be a challenging task. The naming convention of regular branches is easy and straightforward. Using hyphen or slash separators, the names become more challenging to read, creating confusion for the team. Avoid simultaneous naming conventions. Avoid combining naming conventions only leads to complications and makes the process prone to errors.

    5 min
  • How To Take Screenshots In The Browser Using JavaScript

    This story was originally published on HackerNoon at: https://hackernoon.com/how-to-take-screenshots-in-the-browser-using-javascript-l92k3xq7.


    Taking screenshots in-browser (or 'client-side') is all about tradeoffs - there's no perfect solution for every situation. Let's take a look at three different ways you can take screenshots, and then how you can use them by sending them to a server or letting the user download the image.
    Check more stories related to programming at: https://hackernoon.com/c/programming.
    You can also check exclusive content about #javascript, #feedback, #html, #screenshots, #chrome-browser-extension, #web-development, #javascript-development, #good-company, #hackernoon-es, and more.


    This story was written by: @James_BugHerd. Learn more about this writer by checking @James_BugHerd's about page,
    and for more stories, please visit hackernoon.com.


    How To Take Screenshots In The Browser Using JavaScript is all about tradeoffs - there's no perfect solution for every situation. There are three ways you can automatically capture screenshots for your users. Using HTML2canvas for client-side screenshots is one of the most popular methods. Generate screenshots with getDisplayMedia - which is used as the screen sharing API. You can capture a still image from a video, which is essentially like screen sharing, like a screen sharing image, using JavaScript.

    9 min
  • 21 Best Developer Portfolio Examples

    This story was originally published on HackerNoon at: https://hackernoon.com/21-best-developer-portfolio-examples-p61j31wi.


    21 Awesome DEV portfolios for your inspiration
    Check more stories related to programming at: https://hackernoon.com/c/programming.
    You can also check exclusive content about #web-development, #careers, #inspiration, #css, #portfolio, #html, #javascript, #design, #hackernoon-es, and more.


    This story was written by: @madzadev. Learn more about this writer by checking @madzadev's about page,
    and for more stories, please visit hackernoon.com.

    2 min