{"product_id":"110450","title":"Java Algorithm Interview with Kotlin ","description":"\u003ccenter\u003e\u003cdiv style=\"text-align:center\"\u003e\u003cimg src=\"https:\/\/tmgdisk01.cafe24.com\/images\/vs\/4172\/sv\/3jYEEONHNmVhH62AHyF75Fy2jo1iIN.png?v=1765102695\" style=\"max-width:100%;max-height:10px\"\u003e\u003c\/div\u003e\u003c\/center\u003e\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\u003ccenter\u003e\n\n\u003cdiv style=\"width:95%\"\u003e\n\n\u003cdiv style=\"text-align:center;font-size:30px;font-weight:bolder;line-height:1.6em\"\u003e Java Algorithm Interview with Kotlin \u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"border-bottom:1px;border-bottom-style:dotted;border-color:;padding-bottom:20px\"\u003e\u003ccenter\u003e\u003ctable align=\"center\" width=\"100%\"\u003e\u003ctbody style=\"border:0px\"\u003e\n\n\u003ctr\u003e\u003ctd align=\"center\" style=\"line-height:1.2em;text-align:center;font-size:18px;color:black;font-weight:bold;padding-bottom:20px;\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\n\n\u003ctr\u003e\u003ctd style=\"text-align:center\"\u003e\u003cimg src=\"https:\/\/image.yes24.com\/goods\/122445610\/XL\" style=\"max-width:100%;height:auto\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\n\n\n\u003c\/tbody\u003e\u003c\/table\u003e\u003c\/center\u003e\u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"width:95%;{split_style6}padding-top:20px;padding-bottom:20px\"\u003e\n\n\u003cdiv style=\"text-align:left;font-size:16px;font-weight:bold;padding-bottom:20px\"\u003e Description \u003c\/div\u003e\n\n\u003cdiv style=\"text-align:left;word-break:break-all;font-size:14px;line-height:1.6em;\"\u003e\n\n\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eBook Introduction\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e\u003cdiv\u003e \u003cb\u003e- A complete study guide on algorithms and data structures for job seekers and those changing careers!\u003cbr\u003e - Detailed analysis and solution explanations of 102 previous Leetcode\/Programmers questions.\u003c\/b\u003e\u003cbr\u003e \u003cbr\u003e\"Python Algorithm Interview,\" the ultimate guide for developers preparing for coding tests and algorithm interviews, has been updated and remastered with Java and Kotlin code! With this one book, you can build the foundation for practical code that can be applied immediately in the workplace, not to mention preparing for a job or career change.\u003cbr\u003e Let's solidify our understanding of algorithms and data structures once again through over 200 rich illustrations.\u003cbr\u003e\n\n\u003c\/div\u003e\u003c\/div\u003e\n\u003cdiv\u003e\u003cul\u003e\u003cli\u003e You can preview some of the book's contents.\u003cbr\u003e \u003cspan\u003ePreview\u003c\/span\u003e\n\n\u003c\/li\u003e\u003c\/ul\u003e\u003c\/div\u003e\n\u003c\/div\u003e\n\u003cbr\u003e\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eindex\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e \u003cb\u003e[Part 1] Preparing for a Coding Interview\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Chapter 1: Coding Interviews \u0026amp; Coding Tests\u003cbr\u003e Coding Interviews: The Gateway to Corporate Talent Acquisition\u003cbr\u003e __Coding Interviews and Evaluation Criteria of Domestic and Foreign Companies\u003cbr\u003e __Current Status of Coding Testing Platform Utilization by Domestic Companies\u003cbr\u003e Preparing for an Online Coding Test\u003cbr\u003e __Practice book and writing tools \u003cbr\u003e__Which programming language is advantageous?\u003cbr\u003e __Prepare your own code snippet\u003cbr\u003e __must be solved so that all test cases pass\u003cbr\u003e __If a timeout occurs\u003cbr\u003e __Don't forget to handle exceptions\u003cbr\u003e __How to deal with a solution that is approached incorrectly\u003cbr\u003e __Do I need a coding tool?\u003cbr\u003e __If there are negative interviewers in IDE\u003cbr\u003e __Verify your code with the REPL tool\u003cbr\u003e Features and Uses of Online Coding Testing Platforms\u003cbr\u003e __Leetcode\u003cbr\u003e __programmers\u003cbr\u003e\u003cbr\u003e \u003cb\u003e[Part 2] Java \u0026amp; Kotlin\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Chapter 2 Java, the world's most famous language\u003cbr\u003e History of Java\u003cbr\u003e Key Features of Java\u003cbr\u003e __object-oriented programming language\u003cbr\u003e __Functional programming language\u003cbr\u003e Java tools\u003cbr\u003e __Ready-to-run JShell\u003cbr\u003e __How to build and run Java\u003cbr\u003e The emergence of JVM-based languages\u003cbr\u003e\u003cbr\u003e Chapter 3 Kotlin, an official language recognized by Google\u003cbr\u003e Key Features of Kotlin\u003cbr\u003e __practicality\u003cbr\u003e __Interoperability\u003cbr\u003e __Safety\u003cbr\u003e __Elegance\u003cbr\u003e Kotlin's basic grammar\u003cbr\u003e __Clean for loop\u003cbr\u003e __Neat when conditional statement \u003cbr\u003e__Convenient function declaration\u003cbr\u003e __Functional programming language\u003cbr\u003e __Visibility Controller\u003cbr\u003e __extension function\u003cbr\u003e How to build and run Kotlin\u003cbr\u003e __Is Kotlin really slow?\u003cbr\u003e\u003cbr\u003e Chapter 4 Data Types\u003cbr\u003e What data types does Java provide?\u003cbr\u003e __primitive data type\u003cbr\u003e __Reference data type\u003cbr\u003e __Speed ​​comparison of primitive and reference data types\u003cbr\u003e The emergence of the Java Collections Framework\u003cbr\u003e __The list you will use most often\u003cbr\u003e __The most useful map you will ever use\u003cbr\u003e Performance issues with initial data types\u003cbr\u003e A data type that can store numbers of infinite size\u003cbr\u003e What data types does Kotlin provide?\u003cbr\u003e __Are Kotlin data types really that fast?\u003cbr\u003e How Kotlin Implements a Collections Framework\u003cbr\u003e Kotlin's extension functions that extend the functionality of a class\u003cbr\u003e __Collection interface implemented separately by Kotlin\u003cbr\u003e Execution speed of the Java Collections Framework\u003cbr\u003e\u003cbr\u003e Chapter 5 Big O\u003cbr\u003e Big O\u003cbr\u003e Comparison of __n2 and 2n\u003cbr\u003e __A practical way to calculate Big O\u003cbr\u003e __Upper and Worst\u003cbr\u003e __Installation Repayment Analysis\u003cbr\u003e __Parallelization \u003cbr\u003e__Characteristics of complexity\u003cbr\u003e Big O of the Java Collections Framework\u003cbr\u003e __List Time Complexity\u003cbr\u003e __Map Time Complexity\u003cbr\u003e Deck time complexity\u003cbr\u003e\u003cbr\u003e Chapter 6 String Processing\u003cbr\u003e [Problem 01] Valid Palindrome\u003cbr\u003e [Problem 02] Reversing a string\u003cbr\u003e [Problem 03] Log file reorganization\u003cbr\u003e [Question 04] The most common words\u003cbr\u003e [Problem 05] Group Anagram\u003cbr\u003e [Problem 06] Longest palindromic substring\u003cbr\u003e\u003cbr\u003e \u003cb\u003e[Part 3] Linear Data Structures\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Chapter 7 Arrangement\u003cbr\u003e dynamic array\u003cbr\u003e [Problem 07] Sum of two numbers\u003cbr\u003e [Problem 08] Rainwater Trapping\u003cbr\u003e [Problem 09] Sum of three numbers\u003cbr\u003e [Problem 10] Array Partition I\u003cbr\u003e [Problem 11] Product of arrays excluding itself\u003cbr\u003e [Question 12] The best time to buy and sell stocks\u003cbr\u003e\u003cbr\u003e Chapter 8 Linked Lists\u003cbr\u003e [Problem 13] Palindromic Linked List\u003cbr\u003e [Problem 14] Merging two sorted lists\u003cbr\u003e [Problem 15] Reverse linked list\u003cbr\u003e [Problem 16] Addition of two numbers\u003cbr\u003e [Problem 17] Pair Node Swap\u003cbr\u003e [Problem 18] Odd-Even Linked List\u003cbr\u003e [Problem 19] Reverse Linked List II\u003cbr\u003e\u003cbr\u003e Chapter 9 Stacks and Queues\u003cbr\u003e stack\u003cbr\u003e cue\u003cbr\u003e Utilizing in Java\u003cbr\u003e __Java Queue Declaration\u003cbr\u003e __Java's stack declaration \u003cbr\u003e__If thread safety is required\u003cbr\u003e [Problem 20] Valid parentheses\u003cbr\u003e [Problem 21] Removing duplicate characters\u003cbr\u003e [Problem 22] Daily temperature\u003cbr\u003e [Problem 23] Implementing a stack using a queue\u003cbr\u003e [Problem 24] Implementing a Queue Using a Stack\u003cbr\u003e [Problem 25] Circular Queue Design\u003cbr\u003e\u003cbr\u003e 10-card deck, priority queue\u003cbr\u003e deck\u003cbr\u003e [Problem 26] Circular Deck Design\u003cbr\u003e priority queue\u003cbr\u003e [Problem 27] ​​Merging k sorted lists\u003cbr\u003e [Problem 28] The k closest points to the origin\u003cbr\u003e [Question 29] Spicier\u003cbr\u003e\u003cbr\u003e Chapter 11 Hash Tables\u003cbr\u003e Hash\u003cbr\u003e __birthday problem\u003cbr\u003e __Pigeonhole principle\u003cbr\u003e __load factor\u003cbr\u003e __hash function\u003cbr\u003e crash\u003cbr\u003e __Individual chaining\u003cbr\u003e __Open Addressing\u003cbr\u003e __Language-specific hash table implementation methods\u003cbr\u003e [Problem 30] Hashmap Design\u003cbr\u003e [Problem 31] Gems and Stones\u003cbr\u003e [Problem 32] Longest substring without duplicate characters\u003cbr\u003e [Problem 33] Top k frequent elements\u003cbr\u003e [Question 34] Athletes who failed to finish\u003cbr\u003e\u003cbr\u003e \u003cb\u003e[Part 4] Nonlinear Data Structures\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Chapter 12 Graph\u003cbr\u003e Euler path\u003cbr\u003e Hamilton path\u003cbr\u003e Graph traversal\u003cbr\u003e __DFS (depth-first search)\u003cbr\u003e __BFS (Breadth-First Search)\u003cbr\u003e Backtracking\u003cbr\u003e Constraint satisfaction problem\u003cbr\u003e [Problem 35] Number of islands \u003cbr\u003e[Problem 36] Phone number character combination\u003cbr\u003e [Problem 37] Permutations\u003cbr\u003e [Problem 38] Combination\u003cbr\u003e [Problem 39] Sum of combinations\u003cbr\u003e [Problem 40] Subsets\u003cbr\u003e [Problem 41] Schedule Restructuring\u003cbr\u003e [Problem 42] Travel route\u003cbr\u003e [Question 43] Course Schedule\u003cbr\u003e\u003cbr\u003e Chapter 13: The Shortest Path Problem\u003cbr\u003e [Problem 44] Network Delay Time\u003cbr\u003e [Question 45] Cheapest flight within K transit point\u003cbr\u003e [Question 46] Shortest distance on the game map\u003cbr\u003e\u003cbr\u003e Chapter 14 Tree\u003cbr\u003e Each name of the tree\u003cbr\u003e Differences between graphs and trees\u003cbr\u003e binary tree\u003cbr\u003e [Problem 47] Maximum depth of a binary tree\u003cbr\u003e [Problem 48] Diameter of a binary tree\u003cbr\u003e [Problem 49] Longest path with identical values\u003cbr\u003e [Problem 50] Binary Tree Inversion\u003cbr\u003e [Problem 51] Merging two binary trees\u003cbr\u003e [Problem 52] Binary Tree Serialization \u0026amp; Deserialization\u003cbr\u003e [Problem 53] Balanced binary tree\u003cbr\u003e [Problem 54] Minimum height tree\u003cbr\u003e Binary Search Tree (BST)\u003cbr\u003e __Self-balancing binary search tree\u003cbr\u003e [Problem 55] Converting a sorted array into a binary search tree\u003cbr\u003e [Problem 56] Converting a binary search tree (BST) to a larger sum tree\u003cbr\u003e [Problem 57] Binary Search Tree (BST) Agreement Range\u003cbr\u003e [Problem 58] Minimum value between nodes in a binary search tree (BST) \u003cbr\u003eTree traversal\u003cbr\u003e __preposition traversal\u003cbr\u003e __Lieutenant Tour\u003cbr\u003e __postorder traversal\u003cbr\u003e [Problem 59] Building a binary tree using preorder and inorder traversals\u003cbr\u003e\u003cbr\u003e Chapter 15 Heap\u003cbr\u003e Heap operations\u003cbr\u003e __insertion\u003cbr\u003e __extraction\u003cbr\u003e [Problem 60] The kth largest element in an array\u003cbr\u003e [Problem 61] Dual Priority Queue\u003cbr\u003e\u003cbr\u003e Chapter 16 Try\u003cbr\u003e [Problem 62] Trie Implementation\u003cbr\u003e [Problem 63] Palindrome Pair\u003cbr\u003e\u003cbr\u003e \u003cb\u003e[Part 5] Algorithms\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Chapter 17 Sorting\u003cbr\u003e Bubble sort\u003cbr\u003e Insertion sort\u003cbr\u003e merge sort\u003cbr\u003e Quick sort\u003cbr\u003e Stable and unstable sorts\u003cbr\u003e [Problem 64] List sorting\u003cbr\u003e [Problem 65] Section Merge\u003cbr\u003e [Problem 66] Insertion sort list\u003cbr\u003e [Problem 67] Largest number\u003cbr\u003e [Problem 68] Valid anagrams\u003cbr\u003e [Problem 69] Color Sorting\u003cbr\u003e\u003cbr\u003e Chapter 18: Binary Search\u003cbr\u003e [Problem 70] Binary Search\u003cbr\u003e [Problem 71] Searching a Rotationally Sorted Array\u003cbr\u003e [Problem 72] Intersection of two arrays\u003cbr\u003e [Problem 73] Sum of Two Numbers II\u003cbr\u003e [Problem 74] 2D Matrix Search II\u003cbr\u003e [Question 75] Immigration Inspection\u003cbr\u003e\u003cbr\u003e Chapter 19 Bit Manipulation\u003cbr\u003e Boolean operators\u003cbr\u003e bitwise operators\u003cbr\u003e Beat Manipulation Quiz\u003cbr\u003e __Digit Limited Bit Operations\u003cbr\u003e 2's complement\u003cbr\u003e __2's complement number representation\u003cbr\u003e __bitwise operator NOT\u003cbr\u003e [Problem 76] Single Number\u003cbr\u003e [Problem 77] Hamming distance \u003cbr\u003e[Problem 78] Sum of two integers\u003cbr\u003e [Problem 79] UTF-8 Verification\u003cbr\u003e [Problem 80] Number of 1 bit\u003cbr\u003e\u003cbr\u003e Chapter 20 Sliding Window\u003cbr\u003e [Problem 81] Maximum sliding window\u003cbr\u003e [Problem 82] Minimum window containing a substring\u003cbr\u003e [Problem 83] Replace the longest repeating character\u003cbr\u003e\u003cbr\u003e Chapter 21: Greedy Algorithms\u003cbr\u003e Backpack problem\u003cbr\u003e Coin Changing Problem\u003cbr\u003e largest sum\u003cbr\u003e [Problem 84] The Best Time to Buy and Sell Stocks II\u003cbr\u003e [Problem 85] Queue Reorganization by Key\u003cbr\u003e [Problem 86] Task Scheduler\u003cbr\u003e [Problem 87] Gas Station\u003cbr\u003e [Problem 88] Cookie Granting\u003cbr\u003e\u003cbr\u003e Chapter 22 Divide and Conquer\u003cbr\u003e [Problem 89] Majority Element\u003cbr\u003e [Problem 90] Various ways to insert parentheses\u003cbr\u003e\u003cbr\u003e Chapter 23: Dynamic Programming\u003cbr\u003e Optimal substructure\u003cbr\u003e Overlapping subproblems\u003cbr\u003e Dynamic programming methodology\u003cbr\u003e __bottom-up\u003cbr\u003e __Top-down\u003cbr\u003e [Problem 91] Fibonacci numbers\u003cbr\u003e 0-1 backpack problem\u003cbr\u003e [Problem 92] Maximum subarray\u003cbr\u003e [Problem 93] Climbing stairs\u003cbr\u003e [Problem 94] House thief\u003cbr\u003e [Problem 95] Theft\u003cbr\u003e\u003cbr\u003e Appendix: 2022 Kakao Recruitment Perfect Score Guide\u003cbr\u003e [Problem 96] Receiving Report Results\u003cbr\u003e [Problem 97] Finding the number of prime numbers in base k \u003cbr\u003e[Problem 98] Calculating parking fees\u003cbr\u003e [Question 99] Archery Competition\u003cbr\u003e [Question 100] Sheep and Wolf\u003cbr\u003e [Problem 101] Undestructed building\u003cbr\u003e [Problem 102] Disappearing Foothold\u003c\/div\u003e\n\u003cdiv\u003e\u003c\/div\u003e\n\u003c\/div\u003e\n\u003cbr\u003e\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eDetailed image\u003c\/b\u003e \u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\u003cdiv\u003e\n\u003cimg src=\"https:\/\/image.yes24.com\/momo\/TopCate4292\/MidCate009\/429189276.png\" border=\"0\" alt=\"Detailed Image 1\"\u003e\u003cimg src=\"https:\/\/image.yes24.com\/momo\/TopCate4301\/MidCate010\/430097852(1).jpg\" border=\"0\" alt=\"Detailed Image 2\"\u003e\n\u003c\/div\u003e\u003c\/div\u003e\n\u003cbr\u003e\u003cdiv\u003e\u003ch5\u003e \u003cb\u003ePublisher's Review\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e \u003cb\u003eStructure of this book\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e [Part 1] 'Preparing for a Coding Interview': Chapter 1 'Coding Interview \u0026amp; Coding Test' provides an introduction to each, how to do well on the test, how to handle timeouts and exceptions in addition to solving problems, and various tips to solve problems well and improve your score, along with how to solve problems in Leetcode and Programmers.\u003cbr\u003e\u003cbr\u003e [Part 2] 'Java \u0026amp; Kotlin': In Chapter 2, 'Java', we choose Java as the language for solving coding tests and examine the detailed features and operating principles of Java, the world's most famous language. \u003cbr\u003eChapter 3, 'Kotlin', examines the features and operating principles of Kotlin, which is almost certain to become the next major language after Java.\u003cbr\u003e Chapter 4, 'Data Types', examines various data types provided by Java, including the Java Collection Framework, and examines in detail the principles and implementation methods of how to use Java data types in Kotlin.\u003cbr\u003e Chapter 5, \"Big O,\" examines the definition and characteristics of Big O, and also takes a closer look at the Big O of the Java Collections Framework.\u003cbr\u003e Chapter 6, 'String Handling', examines topics related to strings.\u003cbr\u003e From this chapter onwards, we will begin to solve various problems in earnest.\u003cbr\u003e \u003cbr\u003e[Part 3] 'Linear Data Structures': From Chapter 7 'Arrays' to Chapter 8 'Linked Lists', Chapter 9 'Stacks, Queues', Chapter 10 'Decks, Priority Queues', and Chapter 11 'Hash Tables', we will look at various topics related to linear data structures and solve coding test problems.\u003cbr\u003e\u003cbr\u003e [Part 4] 'Nonlinear Data Structures': From Chapter 12 'Graphs' to Chapter 13 'Shortest Path Problems', Chapter 14 'Trees', Chapter 15 'Heaps', and Chapter 16 'Tries', we will look at topics related to nonlinear data structures and solve coding test problems.\u003cbr\u003e\u003cbr\u003e [Part 5] 'Algorithm': In Chapter 17, 'Sorting', we will look at various sorting algorithms, which are called the flower of algorithms, one by one.\u003cbr\u003e Chapter 18, 'Binary Search', Chapter 19, 'Bit Manipulation', and Chapter 20, 'Sliding Window', examine related algorithms. \u003cbr\u003eIn particular, Chapter 21, 'Greedy Algorithm', Chapter 22, 'Divide and Conquer', and Chapter 23, 'Dynamic Programming' are all independent chapters but are related topics. Therefore, Chapter 23 summarizes the contents and examines the characteristics and differences of each in detail.\u003cbr\u003e\u003cbr\u003e In the appendix, \"2022 Kakao Recruitment Perfect Score Guide,\" we'll mobilize all the algorithmic capabilities we've explored so far to solve problems actually tested in the 2022 Kakao Developer Recruitment using the best methods.\u003cbr\u003e\u003cbr\u003e \u003cb\u003eKey features of this book\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e - For readers unfamiliar with Java, it explains how Java is executed, how it works, and advanced grammar.\u003cbr\u003e - For readers unfamiliar with Kotlin, we introduce the differences between Java and Kotlin, Kotlin's unique advantages, and various tips.\u003cbr\u003e - For readers who have difficulty understanding the algorithm, we have included various visual illustrations of the algorithm. \u003cbr\u003e- For readers who are not familiar with problem solving, we will try to solve various types of problems in various ways.\u003cbr\u003e - For readers with limited understanding of optimization, we introduce various optimization techniques and measure and compare their performance.\u003cbr\u003e\u003cbr\u003e \u003cb\u003eTarget audience for this book\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e This book was written with the eye of 'new developers hoping to get a job at Korea's top IT company.'\u003cbr\u003e - How can I become good at Java?\u003cbr\u003e - How can I learn Kotlin well?\u003cbr\u003e - How can I do well on coding tests?\u003cbr\u003e - How can I solve algorithm problems well?\u003cbr\u003e - How can I do well in an interview?\u003cbr\u003e\u003cbr\u003e Readers of this book should have programming experience in one or more languages ​​and be prepared to learn basic data structures and algorithms. \u003cbr\u003eYou can read this book even if you don't know much about Java, but if possible, it will be much more helpful to understand the content if you read the book with a basic knowledge of Java.\u003cbr\u003e\u003cbr\u003e \u003cb\u003eDevelopment Language and Tools of this Book\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e - Java 11 (required)\u003cbr\u003e - Kotlin 1.3 (required)\u003cbr\u003e - IntelliJ Community Edition (recommended)\u003cbr\u003e - Leetcode (required)\u003cbr\u003e - Programmers (required)\u003cbr\u003e\u003cbr\u003e \u003cb\u003eDownload the GitHub source code\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e The code used to solve all the problems introduced in this book is provided through GitHub, and you can download the solution code for all problems from the following GitHub address.\u003cbr\u003e https:\/\/github.com\/onlybooks\/java-algorithm-interview\u003cbr\u003e\u003cbr\u003e \u003cb\u003eAuthor's Note\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Published in 2020, \"Python Algorithm Interview\" has become a beloved book for those preparing for coding tests and algorithm interviews. \u003cbr\u003eWhile working at Kakao, I participated as a coding test writer during the first blind developer recruitment in Korea, which led to the writing of this great book.\u003cbr\u003e I included in my first book my experience conducting coding tests at Kakao, conducting technical interviews with numerous applicants to recruit good talent, conducting hundreds of interviews to recruit even better software talent for Hyundai Motor Group after moving to Hyundai Motor Company, and even closely examining technical interviews at other companies to conduct even better interviews.\u003cbr\u003e Above all, I am extremely happy that my efforts to create the best algorithm book have borne small fruit.\u003cbr\u003e\u003cbr\u003e \u003cbr\u003eThis new edition of \"Java Algorithm Interview with Kotlin,\" published after three years, is a book that inherits the same mindset as the first book and strives to create the best algorithm book ever.\u003cbr\u003e I solved 88 carefully selected Leetcode problems, 7 Programmers problems, and 7 Kakao problems.\u003cbr\u003e I tried to present a much more efficient and cleaner code than last time, and wrote it at a level that it can be applied directly to practical applications without any problems.\u003cbr\u003e Sometimes, you come across materials or books that, in their haste to solve problems, present code that is difficult to use in practice, but at least this book is not like that.\u003cbr\u003e After passing the coding test and successfully getting a job, I focused on providing solution code that can be continuously used in the field.\u003cbr\u003e\u003cbr\u003e\u003cbr\u003e All the code presented in this book is of a high enough level that it can be applied directly to practical applications. \u003cbr\u003eThe coding skills you acquire through this book will be of great help in your practical work.\u003cbr\u003e Not only that, but like its predecessor, it explains difficult algorithms with friendly illustrations.\u003cbr\u003e We put a lot of effort into intuitively explaining the difficult algorithm through over 200 illustrations, along with additional explanations and various historical facts.\u003cbr\u003e In this way, 『Java Algorithm Interview with Kotlin』 is a book similar to 『Python Algorithm Interview』, but with a further upgrade.\u003cbr\u003e Moreover, the most notable difference in this book is that it chose Java as the solution language.\u003cbr\u003e Java is the most popular language for coding tests.\u003cbr\u003e I hope this book will be helpful to more readers.\u003cbr\u003e In addition to this, I have significantly improved upon the parts that I felt were lacking in the previous book.\u003cbr\u003e \u003cbr\u003eThis book is useful not only for developers working in the field, but also for college students still enrolled in school.\u003cbr\u003e It will be especially helpful for job seekers who have just graduated and are looking for a job, as well as for master's and doctoral students who are leaving the lab.\u003cbr\u003e This book will also be a good choice for interviewers looking for good questions.\u003cbr\u003e As an interviewer, I've also participated in countless coding tests and competitions and read countless algorithm books to come up with better problems.\u003cbr\u003e This book reflects all the experiences and difficulties I have experienced so far.\u003cbr\u003e\u003cbr\u003e All problems in this book have solutions and explanations provided right away.\u003cbr\u003e However, I recommend that you try to solve the problems yourself first without looking at the solution in the book. \u003cbr\u003eThe solutions presented in this book have been designed to be as optimal as possible and to be elegant code. So, try solving the problems first, and then compare your solutions with the ones in this book to see what differences there are.\u003cbr\u003e It will be of great help in improving your code quality and solution methods, and learning optimization techniques.\u003cbr\u003e\n\u003c\/div\u003e\n\u003cdiv\u003e\u003c\/div\u003e\n\u003c\/div\u003e\n\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"width:95%;padding-top:20px;padding-bottom:20px\"\u003e\n\n\u003cdiv style=\"text-align:left;font-size:16px;font-weight:bold;padding-bottom:20px\"\u003e GOODS SPECIFICS \u003c\/div\u003e\n\n\u003cdiv style=\"text-align:left;font-size:14px;line-height:1.6em;\"\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eDate of issue:\u003c\/strong\u003e September 20, 2023\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003ePage count, weight, size:\u003c\/strong\u003e 904 pages | 1,586g | 180*235*43mm\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eISBN13:\u003c\/strong\u003e 9791189909550\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eISBN10:\u003c\/strong\u003e 1189909553 \u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\u003ccenter\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cspan\u003e\u003c\/span\u003e\n\n\u003c\/center\u003e\n\n\n\u003c\/center\u003e","brand":"LIBRAIRIE COREENNE","offers":[{"title":"Default Title","offer_id":43893803843626,"sku":"110450","price":60.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0683\/2750\/5962\/files\/9f84ac5d2429b12987cfe1f379db46cc.jpg?v=1765417680","url":"https:\/\/librairie.coreenne.fr\/en\/products\/110450","provider":"LIBRAIRIE COREENNE","version":"1.0","type":"link"}