Leetcode: Solving Leetcode Problems in Hindi

tornado
  • ٥٫٠ (٣)
  • دورات تدريبية

- My efforts are to summarize precise solutions in simple Hindi to decrease the interview preparation time.

  1. ١٠‏/١١‏/٢٠٢٠

    Rotting oranges

    Given a gif, each cell can have one of the three values. 0 for empty, 1 for fresh Orange and 2 for rotten. Return minimum number of minutes that must elapse until no cell has a fresh Orange

    ٦ من الدقائق

  2. ٠٥‏/١١‏/٢٠٢٠

    Number of islands

    Given a grid, find number of islands. We use depth first search.

    ٤ من الدقائق

  3. ٠٥‏/١١‏/٢٠٢٠

    Breadth first search and depth first search

    Traverse a tree or a graph using DFS and BFS

    ٣ من الدقائق

  4. ٠٥‏/١١‏/٢٠٢٠

    Merge K Sorted Lists

    Given a an array of Sorted K linked lists, merge all K lists in one Sorted linked-list and return it.

    ٨ من الدقائق

  5. ٠٥‏/١١‏/٢٠٢٠

    Two sum, Two Sum - II, Three sum

    Find two numbers that add up to a Target. Find two numbers in a sorted array that add up to a number. Find three numbers in an array that add up to a Target.

    ٦ من الدقائق

  6. ١٥‏/١٠‏/٢٠٢٠

    Simplify Path

    Given a Unix style absolute path, simplify it and return the shortest canonical path

    ٦ من الدقائق

  7. ١٤‏/١٠‏/٢٠٢٠

    Design In-Memory file system

    Design In-Memory file system to simulate following functions. LS, mkdir, addcontentstofile, rewdcontentsfromfile

    ١٠ من الدقائق

  8. ١٢‏/١٠‏/٢٠٢٠

    Minimum window Substring AND longest Substring with at most K distinct characters

    Give a string S and a String T, find the minimum window in S which will contain all characters in T.

    ٦ من الدقائق
مشاهدة الكل (١٥)

التقييمات والمراجعات

٥
من ٥
‫٣ من التقييمات‬

حول

- My efforts are to summarize precise solutions in simple Hindi to decrease the interview preparation time.

المعلومات