CODE & ALGO

  • 8 Patterns Review For Successful Coding Interview

    8 Patterns Review For Successful Coding Interview This is nothing but quick 5 min revision before going to interview. Visit https: https://codeandalgo.com for more such contents

  • HashMap HashTable

    Interview Questions

  • Tree

    Binary Tree Interview Questions 1. Lowest Common Ancestor of a Binary Tree More Questions Please visit https: https://codeandalgo.com for more such contents

  • Lowest Common Ancestor of a Binary Tree

    LeetCode#236 Problem Statement Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).” Example 1:…

  • Kth Largest Element in an Array

    Kth Largest Element in an Array Logic Golang solution Kth Largest Element in an Array Output Largest k elements in array Output Please visit https: https://codeandalgo.com for more such contents

  • Starting node of cycle in Linked List

    Starting node of cycle in Linked List Problem Statement Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote…

  • Detect Cycle in a Linked List Cycle

    Leetcode#141 Detect Cycle in a Linked List Cycle Problem Statement Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to…