<feed xmlns="http://www.w3.org/2005/Atom"> <id>https://rahulkumarsahu.github.io/</id><title>ByteBrewery</title><subtitle>Welcome to ByteBrewery, A tech Blog!!!</subtitle> <updated>2024-02-20T13:44:08+09:00</updated> <author> <name>Rahul Kumar</name> <uri>https://rahulkumarsahu.github.io/</uri> </author><link rel="self" type="application/atom+xml" href="https://rahulkumarsahu.github.io/feed.xml"/><link rel="alternate" type="text/html" hreflang="en" href="https://rahulkumarsahu.github.io/"/> <generator uri="https://jekyllrb.com/" version="4.3.3">Jekyll</generator> <rights> © 2024 Rahul Kumar </rights> <icon>/assets/img/favicons/favicon.ico</icon> <logo>/assets/img/favicons/favicon-96x96.png</logo> <entry><title>System Design Course</title><link href="https://rahulkumarsahu.github.io/posts/system-design/" rel="alternate" type="text/html" title="System Design Course" /><published>2024-01-12T03:00:00+09:00</published> <updated>2024-02-13T21:38:22+09:00</updated> <id>https://rahulkumarsahu.github.io/posts/system-design/</id> <content src="https://rahulkumarsahu.github.io/posts/system-design/" /> <author> <name>Rahul Kumar</name> </author> <category term="System Design" /> <summary> </summary> </entry> <entry><title>OOPS Concept</title><link href="https://rahulkumarsahu.github.io/posts/oops-concept/" rel="alternate" type="text/html" title="OOPS Concept" /><published>2024-01-12T03:00:00+09:00</published> <updated>2024-02-13T21:38:22+09:00</updated> <id>https://rahulkumarsahu.github.io/posts/oops-concept/</id> <content src="https://rahulkumarsahu.github.io/posts/oops-concept/" /> <author> <name>Rahul Kumar</name> </author> <category term="OOPS Concept" /> <summary> Overvieew Object-Oriented Programming (OOP) is a programming paradigm that revolves around the concept of “classes” and “objects.” It is a way of designing and organizing code to promote modularity, reusability, and maintainability. OOPS concepts helps reduce code complexity and enables the reusability of code Imagine you have a toy robot. The object here is the robot, and it has information... </summary> </entry> <entry><title>Design Pattern Course</title><link href="https://rahulkumarsahu.github.io/posts/design-pattern/" rel="alternate" type="text/html" title="Design Pattern Course" /><published>2024-01-12T03:00:00+09:00</published> <updated>2024-02-13T21:38:22+09:00</updated> <id>https://rahulkumarsahu.github.io/posts/design-pattern/</id> <content src="https://rahulkumarsahu.github.io/posts/design-pattern/" /> <author> <name>Rahul Kumar</name> </author> <category term="Design Pattern" /> <summary> </summary> </entry> <entry><title>Binary Search</title><link href="https://rahulkumarsahu.github.io/posts/binary-search/" rel="alternate" type="text/html" title="Binary Search" /><published>2024-01-12T03:00:00+09:00</published> <updated>2024-02-13T21:38:22+09:00</updated> <id>https://rahulkumarsahu.github.io/posts/binary-search/</id> <content src="https://rahulkumarsahu.github.io/posts/binary-search/" /> <author> <name>Rahul Kumar</name> </author> <category term="Data Structures and Algorithms" /> <summary> Problem 1: Binary Search Algorithm What is Binary Search? Binary search is an efficient algorithm for finding a target value within a sorted array or list. It works by repeatedly dividing the search space in half. It is a divide-and-conquer algorithm, reducing the problem size in each step. Conditions for Binary Search: The list must be sorted. Access to any element of the data structur... </summary> </entry> <entry><title>Array</title><link href="https://rahulkumarsahu.github.io/posts/array/" rel="alternate" type="text/html" title="Array" /><published>2024-01-12T03:00:00+09:00</published> <updated>2024-02-20T13:43:45+09:00</updated> <id>https://rahulkumarsahu.github.io/posts/array/</id> <content src="https://rahulkumarsahu.github.io/posts/array/" /> <author> <name>Rahul Kumar</name> </author> <category term="Data Structures and Algorithms" /> <summary> Array Easy Question Question 1 Largest Element Given an array ‘arr’ of size ‘n’ find the largest element in the array. Example: Input: ‘n’ = 5, ‘arr’ = [1, 2, 3, 4, 5] Output: 5 Explanation: From the array {1, 2, 3, 4, 5}, the largest element is 5. Sample input 1: 6 4 7 8 6 7 6 Sample output 1: 8 Explanation of sample input 1: The answer is 8. From {4 7 8 6 7 6}, 8 is the larges... </summary> </entry> </feed>
