{"author_url":"https://blog.hatena.ne.jp/atiek1121/","image_url":null,"author_name":"atiek1121","blog_url":"https://keita-matsushita.hatenablog.com/","version":"1.0","provider_url":"https://hatena.blog","width":"100%","blog_title":"\u30de\u30c4\u30b7\u30bf\u306e\u304a\u52c9\u5f37\u30e1\u30e2","url":"https://keita-matsushita.hatenablog.com/entry/2017/01/22/161628","description":"Problem You are given two sorted arrays, A and B, where A has large enough buffer at the end to hold B. Write a method to merge B into A in sorted order How to Solve By merging two arrays like merge sort, we can achieve the goal. Since A has enough buffer at the end, we traverse the arrays from end \u2026","published":"2017-01-22 16:16:28","categories":["Merge Sort","Cracking The Coding Interview"],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkeita-matsushita.hatenablog.com%2Fentry%2F2017%2F01%2F22%2F161628\" title=\"Merge two sorted arrays - \u30de\u30c4\u30b7\u30bf\u306e\u304a\u52c9\u5f37\u30e1\u30e2\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","title":"Merge two sorted arrays","type":"rich","height":"190"}