Scribd Logo
Upload

Welcome to Scribd!

  • LeetCode DSA Sheet

    Uploaded by

    Weeb Coder 404
    18 views1 page
    This document provides a list of 20 must-do LeetCode problems across various computer science topics that are commonly asked about in coding interviews. These problems cover dynamic programming, greedy algorithms, graphs, backtracking, linked lists, bit manipulation, hash tables, disjoint-set unions, shortest path algorithms like Dijkstra's and Bellman-Ford, topological sorting, sliding window techniques, tries, queues, heaps, trees, binary search, two pointers, and blind curated problems. The source is identified as LeetCode and it encourages following Keerthivasan Kannan on LinkedIn for more problem recommendations.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides a list of 20 must-do LeetCode problems across various computer science topics that are commonly asked about in coding interviews. These problems cover dynamic programming, greedy algorithms, graphs, backtracking, linked lists, bit manipulation, hash tables, disjoint-set unions, shortest path algorithms like Dijkstra's and Bellman-Ford, topological sorting, sliding window techniques, tries, queues, heaps, trees, binary search, two pointers, and blind curated problems. The source is identified as LeetCode and it encourages following Keerthivasan Kannan on LinkedIn for more problem recommendations.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    18 views1 page

    LeetCode DSA Sheet

    Uploaded by

    Weeb Coder 404
    This document provides a list of 20 must-do LeetCode problems across various computer science topics that are commonly asked about in coding interviews. These problems cover dynamic programming, greedy algorithms, graphs, backtracking, linked lists, bit manipulation, hash tables, disjoint-set unions, shortest path algorithms like Dijkstra's and Bellman-Ford, topological sorting, sliding window techniques, tries, queues, heaps, trees, binary search, two pointers, and blind curated problems. The source is identified as LeetCode and it encourages following Keerthivasan Kannan on LinkedIn for more problem recommendations.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    𝙇𝙚𝙚𝙩𝘾𝙤𝙙𝙚 𝘿𝙎𝘼 𝙎𝙃𝙀𝙀𝙏

    The Following is a list of Must do LeetCode problems asked in Coding Interview so


    far.
    Follow Keerthivasan Kannan on LinkedIn for more.

    1. DP
    2. Greedy Related Problem
    3. Graph
    4. Backtracking
    5. Linked List
    6. Bit Manipulation List
    7. Hash Table & Map
    8. DSU Problem
    9. Bridge & Articulation Point
    10.Dijkstra Algorithms
    11.Bellman Ford Algorithms
    12.Floyd Warshall Algorithms
    13.Topological Sort
    14.Sliding Windows problems
    15.Trie Problem
    16.Queue
    17.Heaps
    18.Trees
    19.Binary Search
    20.2 Pointers
    21.Blind Curated

    Source: LeetCode

    Curated

    You might also like