サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
WWDC25
www.geeksforgeeks.org
TutorialsPython TutorialTaking Input in PythonPython OperatorsPython Data TypesPython NumbersPython StringPython ListsPython TuplesSets in PythonPython DictionaryPython Loops and Control FlowPython Conditional StatementsPython LoopsPython FunctionsPython OOPS ConceptPython Data StructuresPython DSALinked ListStackQueueTreeHeapHashingGraphSetsMapAdvance Data StructureSorting AlgorithmsSearching Alg
In computer networks, congestion occurs when data traffic exceeds the available bandwidth and leads to packet loss, delays, and reduced performance. Traffic shaping can prevent and reduce congestion in a network. It is a technique used to regulate data flow by controlling the rate at which packets are sent into the network. There are 2 types of traffic shaping algorithms: Leaky Bucket Token Bucket
Getting ready for a tech job interview? Algorithms are really important! Companies often ask questions that require problem-solving skills. In this article, we'll look at the top 10 algorithms commonly used in interviews. Each algorithm is like a powerful tool in your problem-solving toolbox. Knowing them well can really help you handle different technical challenges during interviews. Let's break
Algorithm is a step-by-step procedure for solving a problem or accomplishing a task. In the context of data structures and algorithms, it is a set of well-defined instructions for performing a specific computational task. Algorithms are fundamental to computer science and play a very important role in designing efficient solutions for various problems. Understanding algorithms is essential for any
CoursesDSA to DevelopmentMachine Learning & Data ScienceGenerative AI & ChatGPTBecome AWS CertifiedDSA CoursesData Structure & Algorithm(C++/JAVA)Data Structure & Algorithm(Python)Data Structure & Algorithm(JavaScript)Programming LanguagesCPPJavaPythonJavaScriptCAll CoursesTutorialsPython TutorialTaking Input in PythonPython OperatorsPython Data TypesPython Loops and Control FlowPython Conditional
Given an array arr[] of size N, the task is to find the length of the Longest Increasing Subsequence (LIS) i.e., the longest possible subsequence in which the elements of the subsequence are sorted in increasing order, in O(N log N). Examples: Input: arr[] = {3, 10, 2, 1, 20} Output: 3 Explanation: The longest increasing subsequence is 3, 10, 20 Input: arr[] = {3, 2} Output:1 Explanation: The long
CoursesDSA to DevelopmentGet IBM CertificationNewly Launched!Master Django FrameworkBecome AWS CertifiedFor Working ProfessionalsInterview 101: DSA & System DesignData Science Training ProgramJAVA Backend Development (Live)DevOps Engineering (LIVE)Data Structures & Algorithms in PythonFor StudentsPlacement Preparation CourseData Science (Live)Data Structure & Algorithm-Self Paced (C++/JAVA)Master
Given an undirected graph with V vertices and E edges (edges[][]), Your task is to return all the articulation points in the graph. If no such point exists, return {-1}. Note: An articulation point is a vertex whose removal, along with all its connected edges, increases the number of connected components in the graph. The graph may contain more than one connected component.Examples: Input: V = 5,
In C, the extern keyword is used to declare a variable or a function whose definition is present in some other file. Basically, it extends the visibility of the variables and functions in C to multiple source files. Before going deeper into the topic, we need to know about a few terms: Declaration: A declaration only tells the compiler about the existence of an identifier and its type.Definition:
Tech Interview 101 - From DSA to System Design for Working Professionals
このページを最初にブックマークしてみませんか?
『GeeksforGeeks』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く