Загрузка страницы

IRCTC System Design | Railways Ticket Booking Service | System Design Interview Question

Railway train or in general ticket booking is a common thing in today's world.
Today we will learn to design system to meet the requirement of ticket booking system like IRCTC.
In this video I have covered the System Design for IRCTC. Content deals mainly around the database table structure and the best way a query can be performed. Relevant APIs and a High level design of the software is also added in the video.

Here software lifecycle of Search train, book train, cancel train and notification has been explained in details.

Also touched on the topic of how to choose column to create index and further partition your table to improve performance of the Railways booking system, so that your design is scalable and queries are optimized.

0:00 Introduction
0:10 Requirements
3:48 Major Life Cycles of components involved
5:28 Search Trains
15:37 Book train Ticket
19:33 Payments to be made
21:09 Capacity Estimation
22:02 Relevant APIs
27:42 High Level Design of IRCTC

Payment Gateway : https://youtu.be/NxjGFIgFCbg
URL Shortener : https://youtu.be/sqEBc9VsFko
Distributed Cache : https://youtu.be/jzPSuBiidF4
You can buy us a coffee at : https://www.buymeacoffee.com/thetechgranth

system design: https://youtu.be/jzPSuBiidF4

DS for beginners: https://youtu.be/cxjWjBPPbzI

leetcode solutions: https://youtu.be/jVN6Mq0mXJo

github: https://github.com/TheTechGranth/thegranths
facebook group : https://www.facebook.com/groups/741317603336313/
twitter: https://twitter.com/GranthTech

Видео IRCTC System Design | Railways Ticket Booking Service | System Design Interview Question канала The Tech Granth
Показать
Комментарии отсутствуют
Введите заголовок:

Введите адрес ссылки:

Введите адрес видео с YouTube:

Зарегистрируйтесь или войдите с
Информация о видео
3 декабря 2021 г. 19:26:15
00:30:46
Другие видео канала
Depth First Search (DFS) | Graph Traversal | Graph Search AlgorithmDepth First Search (DFS) | Graph Traversal | Graph Search AlgorithmPartition LinkedList | LeetCode - 86 | Google Data Structures Problem | PointersPartition LinkedList | LeetCode - 86 | Google Data Structures Problem | PointersLeetcode 278 | First Bad Version | Coding Interview Problem (Java Solution using Binary Search)Leetcode 278 | First Bad Version | Coding Interview Problem (Java Solution using Binary Search)Leetcode 19 | Remove Nth Node From End of List | Hare and Turtle | Fast and slow pointer SolutionLeetcode 19 | Remove Nth Node From End of List | Hare and Turtle | Fast and slow pointer SolutionBreadth First Search (BFS) | Graph Traversal | Graph Search AlgorithmBreadth First Search (BFS) | Graph Traversal | Graph Search AlgorithmLeetcode 24 | Swap Nodes in Pairs/set of K (Java Solution with Detailed Explanation)Leetcode 24 | Swap Nodes in Pairs/set of K (Java Solution with Detailed Explanation)Finding Cycles in a Graph: Algorithms and Techniques ExplainedFinding Cycles in a Graph: Algorithms and Techniques ExplainedTopological Sort | Graph Ordering Algorithm | Sorting | Graph TheoryTopological Sort | Graph Ordering Algorithm | Sorting | Graph TheoryApache AirFlow Tutorial | Use ChatGPT for Skill Development | Tech InterviewsApache AirFlow Tutorial | Use ChatGPT for Skill Development | Tech InterviewsDetect loop in Linked list (Tortoise and Hare a.k.a Floyd Algorithm)Detect loop in Linked list (Tortoise and Hare a.k.a Floyd Algorithm)Leetcode 75 | sort array of 0 1 2 | sort colors | Oracle VmWare Interview (Linear time complexity)Leetcode 75 | sort array of 0 1 2 | sort colors | Oracle VmWare Interview (Linear time complexity)Leetcode 965 | Univalued Binary Tree (Java Solution)Leetcode 965 | Univalued Binary Tree (Java Solution)Leetcode 200 | Number of Islands | DFS (Java Solution)Leetcode 200 | Number of Islands | DFS (Java Solution)System Design: Data Ingestion Framework | Factory Method and Abstract Factory Design PatternsSystem Design: Data Ingestion Framework | Factory Method and Abstract Factory Design PatternsStack Data structures | Data Structures for Beginners | Stack creation using ArraysStack Data structures | Data Structures for Beginners | Stack creation using ArraysLeetCode 709 |  To Lower Case | Implementing lowercase conversion function (Java Implementation)LeetCode 709 | To Lower Case | Implementing lowercase conversion function (Java Implementation)Leetcode 977 | Squares of a Sorted Array | Easy Coding Interview Question (Java Solution)Leetcode 977 | Squares of a Sorted Array | Easy Coding Interview Question (Java Solution)Leetcode 3 | Longest Substring Without Repeating Characters | Bucket logic explained (Java Solution)Leetcode 3 | Longest Substring Without Repeating Characters | Bucket logic explained (Java Solution)Leetcode 4 | Median Of Two Sorted Arrays (Extended Binary Search | O(log(m+n) Solution)Leetcode 4 | Median Of Two Sorted Arrays (Extended Binary Search | O(log(m+n) Solution)Linked list Data Structures | Data Structures for BeginnersLinked list Data Structures | Data Structures for BeginnersLeetcode 234 | Palindrome Linked List | Reverse LinkedList | Hare and Turtle | Fast and Slow PointerLeetcode 234 | Palindrome Linked List | Reverse LinkedList | Hare and Turtle | Fast and Slow Pointer
Яндекс.Метрика