Skip to main content

Importants Links of Leetcode

 

Here are all the important discussion posts which contain brief descriptions about a topic with its problem list.

  1. Recursion:-
    A. https://leetcode.com/tag/recursion/discuss/1733447/Become-Master-In-Recursion

  2. Binary Tree and Binary Search Tree:-
    A. https://leetcode.com/tag/binary-tree/discuss/1212004/Binary-Trees-study-guide
    B. https://leetcode.com/tag/binary-tree/discuss/1820334/Become-Master-in-Tree
    C. https://leetcode.com/tag/binary-tree/discuss/1094690/Views-and-Traversal-of-binary-tree-or-Important-topics-or-Must-Read-%3A-)

  3. Dynamic Programming:-
    A. https://leetcode.com/discuss/study-guide/458695/Dynamic-Programming-Patterns
    B. https://leetcode.com/tag/dynamic-programming/discuss/1437879/Dynamic-Programming-Patterns
    C. https://leetcode.com/tag/dynamic-programming/discuss/662866/DP-for-Beginners-Problems-or-Patterns-or-Sample-Solutions
    D. https://leetcode.com/tag/dynamic-programming/discuss/1050391/Must-do-Dynamic-programming-Problems-Category-wise
    E. https://leetcode.com/tag/dynamic-programming/discuss/1296872/Think-DP-How-I-approach-DP-problems-(Guide-for-Beginners)
    F. https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/discuss/108870/Most-consistent-ways-of-dealing-with-the-series-of-stock-problems

  4. BackTracking:-
    A. https://leetcode.com/tag/backtracking/discuss/1141947/Backtracking%3A-Study-and-Analysis
    B. https://leetcode.com/tag/backtracking/discuss/1405817/Backtracking-algorithm-%2B-problems-to-practice

  5. Graph:-
    A. https://leetcode.com/tag/graph/discuss/655708/Graph-For-Beginners-Problems-or-Pattern-or-Sample-Solutions
    B. https://leetcode.com/tag/graph/discuss/969327/Graph-Algorithms-One-Place-or-Dijkstra-or-Bellman-Ford-or-Floyd-Warshall-or-Prims-or-Kruskals-or-DSU
    C. https://leetcode.com/tag/graph/discuss/1326900/Graph-algorithms-%2B-problems-to-practice
    D. https://leetcode.com/tag/graph/discuss/1808711/Graph-for-Beginners-Problems

  6. Binary Search:-
    A. https://leetcode.com/tag/binary-search/discuss/691825/Binary-Search-for-Beginners-Problems-or-Patterns-or-Sample-solutions
    B. https://leetcode.com/tag/binary-search/discuss/786126/Python-Powerful-Ultimate-Binary-Search-Template.-Solved-many-problems
    C. https://leetcode.com/tag/binary-search/discuss/1322500/5-variations-of-Binary-search-(A-Self-Note)
    D. https://leetcode.com/tag/binary-search/discuss/313216/Binary-search-Interview-Questions
    E. https://leetcode.com/tag/binary-search/discuss/1529866/Solving-kth-kind-of-problems

  7. String:-
    https://leetcode.com/tag/string/discuss/1333049/Collections-of-string-questions-pattern-for-upcoming-placement-2021

  8. Linked List:-
    A. https://leetcode.com/discuss/study-guide/1800120/become-master-in-linked-list
    B. https://leetcode.com/tag/linked-list/discuss/1147973/C%2B%2B-How-to-solve-Linked-List-problem

  9. Sliding Window:-
    A. https://leetcode.com/tag/sliding-window/discuss/657507/Sliding-Window-for-Beginners-Problems-or-Template-or-Sample-Solutions
    B. https://leetcode.com/tag/two-pointers/discuss/1122776/Summary-of-Sliding-Window-Patterns-for-Subarray-Substring
    C. https://leetcode.com/tag/sliding-window/discuss/597315/Time-complexity-for-sliding-window-Templates

  10. Hashing:-
    https://leetcode.com/tag/hash-table/discuss/1068545/HASH-TABLE-and-MAP-POWERFUL-GUIDE-!!!

  11. Sorting:-
    A. https://leetcode.com/tag/sorting/discuss/1091763/Must-do-all-required-Sorting-Algorithms%3A-Complete-Guide
    B. https://leetcode.com/tag/sorting/discuss/754949/Sorting-Algorithms-in-Short

  12. Greedy:-
    https://leetcode.com/tag/greedy/discuss/669996/Greedy-for-Beginners-Problems-or-Sample-solutions

  13. Bit Manipulation:-
    A. https://leetcode.com/tag/bit-manipulation/discuss/1151183/TIPS-or-HACKS-WHICH-YOU-CAN'T-IGNORE-AS-A-CODER
    B. https://leetcode.com/tag/bit-manipulation/discuss/1073221/All-about-Bitwise-Operations-Beginner-Intermediate

  14. Heap (Priority Queue):-
    A. https://leetcode.com/tag/heap-priority-queue/discuss/1685989/Approach-to-recognise-the-need-of-heap-in-DSA-problem

  15. Prefix Sum:-
    A. https://leetcode.com/tag/prefix-sum/discuss/1340496/Struggling-and-need-tips-for-prefix-sum-hashmap-problems-(325-523-525-974)
    B. https://leetcode.com/discuss/general-discussion/563022/prefix-sum-problems

  16. Trie:-
    A. https://leetcode.com/tag/trie/discuss/1066206/Introduction-to-Trie
    B. https://leetcode.com/tag/trie/discuss/931977/Beginner-friendly-guide-to-Trie-Tutorial-%2B-Practice-Problems

There are two DSA Sheets that I found helpful.

  1. Striver’s SDE Sheet by Raj
    https://takeuforward.org/interviews/strivers-sde-sheet-top-coding-interview-problems/
  2. Leetcode DSA sheet by Fraz
    https://docs.google.com/spreadsheets/d/1-wKcV99KtO91dXdPkwmXGTdtyxAfk1mbPXQg81R9sFE/edit#gid=0

My linkdIn Post ( I though to share there only at first):-
https://www.linkedin.com/posts/rupam-pakhira107_connections-activity-6910896097666220033-RZEc?utm_source=linkedin_share&utm_medium=member_desktop_web

Hope this will help you if you are learning Data Structure and algorithms.
You can save this post for the future.

P.S:- If I missed out on any important discussion post from the leetcode, comment down I will add.
 Essential Leetcode links,
#Key Leetcode resources,# Leetcode tutorials,#Leetcode practice links,#Leetcode coding resources, #Must-have Leetcode links,#Top Leetcode resources, #Leetcode study materials, #Leetcode programming links,#Valuable Leetcode resources,#Leetcode tips and tricks, #Leetcode solutions,#Leetcode practice problems,

Labels:

Comments

Post a Comment

Popular posts from this blog

Create a socket for HTTP for web page upload and download

Create a socket for HTTP for web page upload and download. Aim: To write a java program for socket for HTTP for web page upload and download . Algorithm 1.Start the program. 2.Get the frame size from the user 3.To create the frame based on the user request. 4.To send frames to server from the client side. 5.If your frames reach the server it will send ACK signal to client otherwise it will send NACK signal to client. 6.Stop the program Program : Client import javax.swing.*; import java.net.*; import java.awt.image.*; import javax.imageio.*; import java.io.*; import java.awt.image.BufferedImage; import java.io.ByteArrayOutputStream; import java.io.File; import java.io.IOException; import javax.imageio.ImageIO; public class Client{ public static void main(String args[]) throws Exception{ Socket soc; BufferedImage img = null; soc=new Socket("localhost",4000); System.out.println("Client is running. ");  try { System.out.println("Reading image from disk. "); im...
Post a Comment
Read more

Write a code simulating ARP /RARP protocols

   Write a code simulating ARP /RARP protocols . Aim:        To write a java program for simulating ARP/RARP protocols ALGORITHM: server 1. Create a server socket and bind it to port. 2. Listen for new connection and when a connection arrives, accept it. 3. Send server ‟ s date and time to the client. 4. Read client ‟ s IP address sent by the client. 5. Display the client details. 6. Repeat steps 2-5 until the server is terminated. 7. Close all streams. 8. Close the server socket. 9. Stop. Client 1. Create a client socket and connect it to the server ‟ s port number. 2. Retrieve its own IP address using built-in function. 3. Send its address to the server. 4. Display the date & time sent by the server. 5. Close the input and output streams. 6. Close the client socket. 7. Stop. Program Program for Address Resolutuion Protocol (ARP) using TCP Client: import java.io.*; import java.net.*; impor...
Post a Comment
Read more

Write program to find ε – closure of all states of any given NFA with ε transition.

 Write program to find ε – closure of all states of any given NFA with ε transition. Agenda 1.Program 2.Input/Output 1.Program #include <stdio.h> #include <string.h> char  result[ 20 ][ 20 ], copy[ 3 ], states[ 20 ][ 20 ]; void  add_state( char  a[ 3 ],  int  i) {   strcpy(result[i], a); } void  display( int  n) {    int  k =  0 ;   printf( "nnn Epsilon closure of %s = { " , copy);    while  (k < n) {     printf( " %s" , result[k]);     k++;   }   printf( " } nnn" ); } int  main() {   FILE * INPUT;   INPUT = fopen( "input.dat" ,  "r" );    char  state[ 3 ];    int  end, i =  0 , n, k =  0 ;  ...
Post a Comment
Read more