Discussions

[
  {
    "id": 2,
    "user": {
      "id": 1,
      "first_name": "ramisa",
      "last_name": "alam",
      "username": "ramisa"
    },
    "comments": [],
    "tags": [
      "motivation",
      "interview"
    ],
    "title": " Keep going | Interview Prep",
    "description": "**Struggle is real** - When I started off, I found it difficult to come up to the solution, when I was able to come up with a solution, I found it difficult to code. And I took my own sweet time to come get a hang of things. But, perseverance is the key. You have to go back and understand where you are lacking, sometimes these things don't come naturally to you, but failed OA’s, failed interview’s will in a way point you out to that direction. What I really recommend is - do MOCK technical interviews, spend quality time in understanding concepts in depth. Sometimes, you might understand the concept, but you would still fail in coding. You have to ace both the concepts, and implementation in your primary programming language.",
    "created_at": "2022-07-16T22:54:45.006350+06:00",
    "updated_at": "2022-07-16T23:49:05.170503+06:00",
    "upvotes": 13,
    "downvotes": 0,
    "views": 0,
    "comment_count": 0
  },
  {
    "id": 3,
    "user": {
      "id": 1,
      "first_name": "ramisa",
      "last_name": "alam",
      "username": "ramisa"
    },
    "comments": [],
    "tags": [
      "motivation",
      "interview"
    ],
    "title": "Design Facebook : System Design Interview",
    "description": "Design a simple model of *Facebook* where people can add other people as friends. In addition, where people can post messages and that messages are visible on their friend's page. The design should be such that it can handle 10M of people. There may be, on an average 100 friends each person has. Every day each person posts around 10 messages on an average.\n\n**Use Case**\n- A user can create their own profile.\n- A user can add other users to his friend list.\n- Users can post messages to their timeline.\n- The system should display posts of friends to the display board/timeline.\n- People can like a post.\n- People can share their friends post to their own display board/timeline.\n**Constraints**\n- Consider a whole network of people as represented by a graph. Each person is a node and each friend\n- relationship is an edge of the graph.\n- Total number of distinct users / nodes: 10 million\n- Total number of distinct friend’s relationship / edges in the graph: 100 * 10 million\n- Number of messages posted by a single user per day: 10\n- Total number of messages posted by the whole network per day: 10 * 10 million",
    "created_at": "2022-07-16T23:03:16.965601+06:00",
    "updated_at": "2022-07-16T23:48:15.172434+06:00",
    "upvotes": 25,
    "downvotes": 0,
    "views": 0,
    "comment_count": 0
  },
  {
    "id": 1,
    "user": {
      "id": 1,
      "first_name": "ramisa",
      "last_name": "alam",
      "username": "ramisa"
    },
    "comments": [
      {
        "comment": "<p>Great Post. Loved it!</p>",
        "parent": null,
        "created_at": "2022-07-16T23:04:34.782583+06:00",
        "updated_at": "2022-07-16T23:04:34.782601+06:00"
      },
      {
        "comment": "<p>Thanks for sharing</p>",
        "parent": null,
        "created_at": "2022-07-16T23:04:42.173590+06:00",
        "updated_at": "2022-07-16T23:04:42.173609+06:00"
      },
      {
        "comment": "<p>Agree with you</p>",
        "parent": "1353ce8b-ceb8-41be-87fc-e261674695ff",
        "created_at": "2022-07-16T23:50:19.532247+06:00",
        "updated_at": "2022-07-16T23:50:19.532263+06:00"
      },
      {
        "comment": "<p>Thanks!!!</p>",
        "parent": null,
        "created_at": "2022-07-16T23:50:27.709365+06:00",
        "updated_at": "2022-07-16T23:50:27.709420+06:00"
      }
    ],
    "tags": [
      "google",
      "sort",
      "interview",
      "linked list"
    ],
    "title": "Google Onsite LinkedList Question",
    "description": "Hi everyone, I encountered this problem during my Google Virtual Onsite Interview and still I could not figure out the Solution.\n\nGiven a Doubly Linked list, find a minimum number of API calls ( move()) to sort the given Linked List. we can only use the move() method to move the node value. We can iterate over the LinkedList elements as many times as we want but the task is to minimize the move() calls and sort the LinkedList.\n\nExample LinkedList 5 -> 2 -> 4 -> 3 -> 1 -> 6\n\nmove() - function takes node_val that you want to move and the position of where you want to place the node at. For example, if you want to pick node_val 5 and place it between 1 and 6 you can use move(5,1,6). The interviewer mentioned the move function is flexible and we can use an index as well to move the node. The way the function works is It would delete the node_val 5 and place it between 1 and 6 like this 2->4->3->1->5->6. This is defined as a 1 move() call.\n\nOur task is to minimize the move() call to sort the given LinkedList. For this linkedList 5 -> 2 -> 4 -> 3 -> 1 -> 6, minimum move() calll is 3 to sort the list.\n\n2->4->3->1->5->6 <-- move 1\n1->2->4->3->5->6 <-- move 2\n1->2->3->4->5->6 <-- move 3\n\nI could not come up with a solution for the above problem. Please let me know if you could build intuition. Also, this is my 1st post forgive me for any mistakes or I missed adding details.",
    "created_at": "2022-07-16T22:51:43.172169+06:00",
    "updated_at": "2022-07-16T23:47:55.565880+06:00",
    "upvotes": 15,
    "downvotes": 0,
    "views": 0,
    "comment_count": 0
  },
  {
    "id": 16,
    "user": {
      "id": 1,
      "first_name": "ramisa",
      "last_name": "alam",
      "username": "ramisa"
    },
    "comments": [],
    "tags": [
      "dp",
      "algorithm"
    ],
    "title": "DP Again",
    "description": "### **Dynamic Programming**\n\n- [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)\n- [Coin Change](https://leetcode.com/problems/coin-change/)\n- [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)\n- [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)\n- [Word Break Problem](https://leetcode.com/problems/word-break/)\n- [Combination Sum](https://leetcode.com/problems/combination-sum-iv/)\n- [House Robber](https://leetcode.com/problems/house-robber/)\n- [House Robber II](https://leetcode.com/problems/house-robber-ii/)\n- [Decode Ways](https://leetcode.com/problems/decode-ways/)\n- [Unique Paths](https://leetcode.com/problems/unique-paths/)\n- [Jump Game](https://leetcode.com/problems/jump-game/)",
    "created_at": "2022-07-17T13:47:53.613482+06:00",
    "updated_at": "2022-07-17T13:47:53.613551+06:00",
    "upvotes": 0,
    "downvotes": 0,
    "views": 0,
    "comment_count": 0
  },
  {
    "id": 17,
    "user": {
      "id": 1,
      "first_name": "ramisa",
      "last_name": "alam",
      "username": "ramisa"
    },
    "comments": [],
    "tags": [
      "algorithm",
      "graph"
    ],
    "title": "A sample title",
    "description": "# Post title\n- point 1\n- point 2\n- point 3",
    "created_at": "2022-07-17T15:34:10.297338+06:00",
    "updated_at": "2022-07-17T15:34:10.297479+06:00",
    "upvotes": 0,
    "downvotes": 0,
    "views": 0,
    "comment_count": 0
  }
]

[
  {
    "id": 2,
    "user": {
      "id": 1,
      "first_name": "ramisa",
      "last_name": "alam",
      "username": "ramisa"
    },
    "comments": [],
    "tags": [
      "motivation",
      "interview"
    ],
    "title": " Keep going | Interview Prep",
    "description": "**Struggle is real** - When I started off, I found it difficult to come up to the solution, when I was able to come up with a solution, I found it difficult to code. And I took my own sweet time to come get a hang of things. But, perseverance is the key. You have to go back and understand where you are lacking, sometimes these things don't come naturally to you, but failed OA’s, failed interview’s will in a way point you out to that direction. What I really recommend is - do MOCK technical interviews, spend quality time in understanding concepts in depth. Sometimes, you might understand the concept, but you would still fail in coding. You have to ace both the concepts, and implementation in your primary programming language.",
    "created_at": "2022-07-16T22:54:45.006350+06:00",
    "updated_at": "2022-07-16T23:49:05.170503+06:00",
    "upvotes": 13,
    "downvotes": 0,
    "views": 0,
    "comment_count": 0
  },
  {
    "id": 3,
    "user": {
      "id": 1,
      "first_name": "ramisa",
      "last_name": "alam",
      "username": "ramisa"
    },
    "comments": [],
    "tags": [
      "motivation",
      "interview"
    ],
    "title": "Design Facebook : System Design Interview",
    "description": "Design a simple model of *Facebook* where people can add other people as friends. In addition, where people can post messages and that messages are visible on their friend's page. The design should be such that it can handle 10M of people. There may be, on an average 100 friends each person has. Every day each person posts around 10 messages on an average.\n\n**Use Case**\n- A user can create their own profile.\n- A user can add other users to his friend list.\n- Users can post messages to their timeline.\n- The system should display posts of friends to the display board/timeline.\n- People can like a post.\n- People can share their friends post to their own display board/timeline.\n**Constraints**\n- Consider a whole network of people as represented by a graph. Each person is a node and each friend\n- relationship is an edge of the graph.\n- Total number of distinct users / nodes: 10 million\n- Total number of distinct friend’s relationship / edges in the graph: 100 * 10 million\n- Number of messages posted by a single user per day: 10\n- Total number of messages posted by the whole network per day: 10 * 10 million",
    "created_at": "2022-07-16T23:03:16.965601+06:00",
    "updated_at": "2022-07-16T23:48:15.172434+06:00",
    "upvotes": 25,
    "downvotes": 0,
    "views": 0,
    "comment_count": 0
  },
  {
    "id": 1,
    "user": {
      "id": 1,
      "first_name": "ramisa",
      "last_name": "alam",
      "username": "ramisa"
    },
    "comments": [
      {
        "comment": "<p>Great Post. Loved it!</p>",
        "parent": null,
        "created_at": "2022-07-16T23:04:34.782583+06:00",
        "updated_at": "2022-07-16T23:04:34.782601+06:00"
      },
      {
        "comment": "<p>Thanks for sharing</p>",
        "parent": null,
        "created_at": "2022-07-16T23:04:42.173590+06:00",
        "updated_at": "2022-07-16T23:04:42.173609+06:00"
      },
      {
        "comment": "<p>Agree with you</p>",
        "parent": "1353ce8b-ceb8-41be-87fc-e261674695ff",
        "created_at": "2022-07-16T23:50:19.532247+06:00",
        "updated_at": "2022-07-16T23:50:19.532263+06:00"
      },
      {
        "comment": "<p>Thanks!!!</p>",
        "parent": null,
        "created_at": "2022-07-16T23:50:27.709365+06:00",
        "updated_at": "2022-07-16T23:50:27.709420+06:00"
      }
    ],
    "tags": [
      "google",
      "sort",
      "interview",
      "linked list"
    ],
    "title": "Google Onsite LinkedList Question",
    "description": "Hi everyone, I encountered this problem during my Google Virtual Onsite Interview and still I could not figure out the Solution.\n\nGiven a Doubly Linked list, find a minimum number of API calls ( move()) to sort the given Linked List. we can only use the move() method to move the node value. We can iterate over the LinkedList elements as many times as we want but the task is to minimize the move() calls and sort the LinkedList.\n\nExample LinkedList 5 -> 2 -> 4 -> 3 -> 1 -> 6\n\nmove() - function takes node_val that you want to move and the position of where you want to place the node at. For example, if you want to pick node_val 5 and place it between 1 and 6 you can use move(5,1,6). The interviewer mentioned the move function is flexible and we can use an index as well to move the node. The way the function works is It would delete the node_val 5 and place it between 1 and 6 like this 2->4->3->1->5->6. This is defined as a 1 move() call.\n\nOur task is to minimize the move() call to sort the given LinkedList. For this linkedList 5 -> 2 -> 4 -> 3 -> 1 -> 6, minimum move() calll is 3 to sort the list.\n\n2->4->3->1->5->6 <-- move 1\n1->2->4->3->5->6 <-- move 2\n1->2->3->4->5->6 <-- move 3\n\nI could not come up with a solution for the above problem. Please let me know if you could build intuition. Also, this is my 1st post forgive me for any mistakes or I missed adding details.",
    "created_at": "2022-07-16T22:51:43.172169+06:00",
    "updated_at": "2022-07-16T23:47:55.565880+06:00",
    "upvotes": 15,
    "downvotes": 0,
    "views": 0,
    "comment_count": 0
  },
  {
    "id": 16,
    "user": {
      "id": 1,
      "first_name": "ramisa",
      "last_name": "alam",
      "username": "ramisa"
    },
    "comments": [],
    "tags": [
      "dp",
      "algorithm"
    ],
    "title": "DP Again",
    "description": "### **Dynamic Programming**\n\n- [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)\n- [Coin Change](https://leetcode.com/problems/coin-change/)\n- [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)\n- [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)\n- [Word Break Problem](https://leetcode.com/problems/word-break/)\n- [Combination Sum](https://leetcode.com/problems/combination-sum-iv/)\n- [House Robber](https://leetcode.com/problems/house-robber/)\n- [House Robber II](https://leetcode.com/problems/house-robber-ii/)\n- [Decode Ways](https://leetcode.com/problems/decode-ways/)\n- [Unique Paths](https://leetcode.com/problems/unique-paths/)\n- [Jump Game](https://leetcode.com/problems/jump-game/)",
    "created_at": "2022-07-17T13:47:53.613482+06:00",
    "updated_at": "2022-07-17T13:47:53.613551+06:00",
    "upvotes": 0,
    "downvotes": 0,
    "views": 0,
    "comment_count": 0
  },
  {
    "id": 17,
    "user": {
      "id": 1,
      "first_name": "ramisa",
      "last_name": "alam",
      "username": "ramisa"
    },
    "comments": [],
    "tags": [
      "algorithm",
      "graph"
    ],
    "title": "A sample title",
    "description": "# Post title\n- point 1\n- point 2\n- point 3",
    "created_at": "2022-07-17T15:34:10.297338+06:00",
    "updated_at": "2022-07-17T15:34:10.297479+06:00",
    "upvotes": 0,
    "downvotes": 0,
    "views": 0,
    "comment_count": 0
  }
]