[{"id":203,"link":"https:\/\/amritsrivastava.com\/question-3\/","name":"question-3","thumbnail":{"url":false,"alt":false},"title":"Question 3","excerpt":"","content":"Given an array of numbers\u00a0N\u00a0and an integer\u00a0k, your task is to split\u00a0N\u00a0into\u00a0k\u00a0partitions such that the maximum sum of any partition is minimized. Return this sum.","author":{"name":"amritsrivastava","link":"https:\/\/amritsrivastava.com\/author\/amritsrivastava\/"},"date":"Feb 18, 2024","dateGMT":"2024-02-18 16:46:47","modifiedDate":"2024-02-18 22:18:46","modifiedDateGMT":"2024-02-18 16:48:46","commentCount":"0","commentStatus":"open","categories":{"coma":"<a href=\"https:\/\/amritsrivastava.com\/category\/technical-posts\/daily-question\/\" rel=\"category tag\">Daily Question<\/a>, <a href=\"https:\/\/amritsrivastava.com\/category\/technical-posts\/\" rel=\"category tag\">Tech<\/a>","space":"<a href=\"https:\/\/amritsrivastava.com\/category\/technical-posts\/daily-question\/\" rel=\"category tag\">Daily Question<\/a> <a href=\"https:\/\/amritsrivastava.com\/category\/technical-posts\/\" rel=\"category tag\">Tech<\/a>"},"taxonomies":{"post_tag":"<a href='https:\/\/amritsrivastava.com\/tag\/daily\/' rel='post_tag'>DAILY<\/a><a href='https:\/\/amritsrivastava.com\/tag\/etsy\/' rel='post_tag'>ETSY<\/a><a href='https:\/\/amritsrivastava.com\/tag\/medium\/' rel='post_tag'>MEDIUM<\/a>"},"readTime":{"min":2,"sec":49},"status":"publish"},{"id":194,"link":"https:\/\/amritsrivastava.com\/question-2\/","name":"question-2","thumbnail":{"url":false,"alt":false},"title":"Question 2","excerpt":"","content":"Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. Find the minimum element in O(log N) time. You","author":{"name":"amritsrivastava","link":"https:\/\/amritsrivastava.com\/author\/amritsrivastava\/"},"date":"Feb 17, 2024","dateGMT":"2024-02-17 17:58:38","modifiedDate":"2024-02-17 23:29:33","modifiedDateGMT":"2024-02-17 17:59:33","commentCount":"0","commentStatus":"open","categories":{"coma":"<a href=\"https:\/\/amritsrivastava.com\/category\/technical-posts\/daily-question\/\" rel=\"category tag\">Daily Question<\/a>, <a href=\"https:\/\/amritsrivastava.com\/category\/technical-posts\/\" rel=\"category tag\">Tech<\/a>","space":"<a href=\"https:\/\/amritsrivastava.com\/category\/technical-posts\/daily-question\/\" rel=\"category tag\">Daily Question<\/a> <a href=\"https:\/\/amritsrivastava.com\/category\/technical-posts\/\" rel=\"category tag\">Tech<\/a>"},"taxonomies":{"post_tag":"<a href='https:\/\/amritsrivastava.com\/tag\/daily\/' rel='post_tag'>DAILY<\/a><a href='https:\/\/amritsrivastava.com\/tag\/medium\/' rel='post_tag'>MEDIUM<\/a><a href='https:\/\/amritsrivastava.com\/tag\/uber\/' rel='post_tag'>UBER<\/a>"},"readTime":{"min":3,"sec":2},"status":"publish"},{"id":181,"link":"https:\/\/amritsrivastava.com\/given-the-head-of-a-singly-linked-list-swap-every-two-nodes-and-return-its-head\/","name":"given-the-head-of-a-singly-linked-list-swap-every-two-nodes-and-return-its-head","thumbnail":{"url":false,"alt":false},"title":"Question 1","excerpt":"","content":"Given the head of a singly linked list, swap\u00a0every\u00a0two nodes and return its head. Approach In the realm of linked lists,\u00a0a classic algorithmic puzzle is","author":{"name":"amritsrivastava","link":"https:\/\/amritsrivastava.com\/author\/amritsrivastava\/"},"date":"Feb 16, 2024","dateGMT":"2024-02-16 17:43:34","modifiedDate":"2024-02-17 23:30:50","modifiedDateGMT":"2024-02-17 18:00:50","commentCount":"0","commentStatus":"open","categories":{"coma":"<a href=\"https:\/\/amritsrivastava.com\/category\/technical-posts\/daily-question\/\" rel=\"category tag\">Daily Question<\/a>, <a href=\"https:\/\/amritsrivastava.com\/category\/technical-posts\/\" rel=\"category tag\">Tech<\/a>","space":"<a href=\"https:\/\/amritsrivastava.com\/category\/technical-posts\/daily-question\/\" rel=\"category tag\">Daily Question<\/a> <a href=\"https:\/\/amritsrivastava.com\/category\/technical-posts\/\" rel=\"category tag\">Tech<\/a>"},"taxonomies":{"post_tag":"<a href='https:\/\/amritsrivastava.com\/tag\/daily\/' rel='post_tag'>DAILY<\/a><a href='https:\/\/amritsrivastava.com\/tag\/easy\/' rel='post_tag'>EASY<\/a><a href='https:\/\/amritsrivastava.com\/tag\/google\/' rel='post_tag'>GOOGLE<\/a>"},"readTime":{"min":2,"sec":42},"status":"publish"}]