String Algorithms for the day before your Coding Interview

Name: String Algorithms for the day before your Coding Interview
Brand: Independently Published
SKU: 9798645079598
Price: 7.53 EUR
Availability: InStock

Автор: Ue Kiao, Aditya Chatterjee

Език:

Корици: С меки корици

Издател: Independently Published

Наличност: Външен склад

Изпращаме след 9-15 дни

7.53 € 14.72 лв

Strings are fundamental data type in real world and developing algorithms to deal with it is an impo...

Информация за книгата

Автор

Ue Kiao, Aditya Chatterjee

Език

Английски език

Корици

Книга - С меки корици

Издадена

2020

страници

EAN

9798645079598

Enbook ID

37918133

Издател

Independently Published

Теглоt

118

Размери

216 x 279 x 2

Пълно описание

Strings are fundamental data type in real world and developing algorithms to deal with it is an important domain. In interviews, often, string algorithms are most insightful and challenging.

In this guide for the day before your coding interview, we have explored some problems and demonstrated the thought process to solve it starting from the brute force solutions.
In the process, we have covered all fundamental ideas along with applying Dynamic Programming to String algorithms so that you are able to solve all string-based problems.

Some of the problems we have covered are:

• Check substring: This is an important fundamental problem where we learn how strings can be handled just like numeric data and algorithms for numeric data can be leveraged.
Some of the core concepts we explored are string hashing, rolling hash and much more.

• Longest common substring: This is a core problem as this uses the concepts we gained in the previous problems and an alternative solution is to use Dynamic Programming.
The core idea is to apply Dynamic Programming over two different string data.

• Longest repeating substring: In line with our previous problem, we explored how to apply Dynamic Programming for this problem. The key distinction is that we are dealing with just 1 string instead of 2 strings as in the previous problem. Unlike the previous problem, the Dynamic Programming approach is the only optimal solution.

With these problems and the thought process to solve them, you will be fully prepared.

This book has been carefully 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 professors at The University of Tokyo and Tokyo Institute of Technology.

Read this book now and ace your upcoming coding interview. This is a must read for everyone preparing for Coding Interviews at top companies.

Books in this series ("Day before coding Interview"):

• Problems for the day before your coding interview
• Greedy Algorithms for the day before your Coding Interview
• Dynamic Programming for the day before your coding interview
• String Algorithms for the day before your Coding Interview

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

String Algorithms for the day before your Coding Interview

Информация за книгата

Пълно описание

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също