Problems for the day before your coding interview

Ue Kiao|Aditya Chatterjee

ISBN 13: 9798629851738

Published by Independently Published, 2020

About this Item

Seller Inventory # 599429734

Bibliographic Details

• Title: Problems for the day before your coding interview
• Publisher: Independently Published
• Publication Date: 2020
• Language: English
• ISBN 13: 9798629851738
• Binding: Soft cover
• Condition: New

About this title

Synopsis

If you have an upcoming coding interview, this is a must for you to read this book 💪 and get prepared to tackle ALGORITHM and DATA STRUCTURE problems in a day. In this book, we have solved insightful algorithmic problems and discussed some of the best insights to drive you into the problem solving mindset.Being in a mindset required for an upcoming event is like winning half the battle.In this book, we begin with an easy problem and go on to explore some tough and insightful problems. The first problem we presented is to delete minimum number of digits in a number to make it a perfect square. This might seem to be a simple problem but the insights involved in solving this is widely applicable across various Algorithmic problems. This problem is solved in time complexity of O(N ^ (1/3) x logN x logN) (think how?)Moreover, in solving the above problem, we have learnt how to generate all combinations/ subsets of a set efficiently. In this line, we have covered other ideas related to combination and permutation generation in other problems in this book.Some of the ideas we covered in the other problems are:* Augmented data structures: How modifying a data structure can improve the complexity greatly.* How a single data structure can have multiple states? and algorithms to interchange them* Concepts related to string comparison and searching (MUST READ + VERY IMPORTANT)* Basic insightful ideas in Number theory and solved a couple of problems related to it* Understanding how number of operations can be reduced greatly without impacting time complexity.* Insightful understanding and analysis of Heap's algorithm for permutation generation (VERY IMPORTANT + RARE)* These problems have covered domains like Graph Theory, Dynamic Programming, Greedy Algorithms, Number Theory, Divide and Conquer and much more.In short, we have carefully chosen the problems to give you idea of:* Basic yet widely asked concepts like combination and permutation generation, forming Dynamic Programming solutions, applying greedy algorithms* Doing a detailed complexity analysis* Proceed in solving the problem in steps and understand deeply why the solution worksThis book has been prepared and reviewed by Top programmers and Algorithmic researchers and members of OpenGenus. We would like to thank Aditya Chatterjee and Ue Kiao for their expertise in this domain and reviews from Tokyo Institute of Technology.Read this book now and ace your upcoming coding interview 💪

About the Author

Aditya Chatterjee is an Independent Algorithmic Researcher, Software Developer and Author. He is the founding member of OPENGENUS, an organization focus on changing Internet consumption.

He is based out of Japan and has collaborated with over 500 researchers. He has mentored over 3000 learners across the Globe through the Internship program at OPENGENUS.

Ue Kiao is a Japanese Software Developer and has worked at top Software development companies across China, Singapore and Japan. She is a leading program manager at OpenGenus.

She is, originally, from Taiwan and has been living in Japan for the last decade. Her academic interests range from Algorithms to System Design and has played key role in designing systems like TaoBao, AliPay and many more.

She has completed her B. Sc in Mathematics and Computing Science at National Taiwan University and PhD at Tokyo Institute of Technology.

We would like to thank reviews from Professors at Tokyo Institute of Technology and members at OpenGenus.