Lecture - 8 Find peak element in an Array
Arjun Suri
Lecture - 8 Find peak element in an Array
8:19
Lecture - 7 Find row with Max no. of 1s in Matrix (Binary Search)
Arjun Suri
Lecture - 7 Find row with Max no. of 1s in Matrix (Binary Search)
20:21
Lecture -6 Find no. of occurrences of an element in a sorted array
Arjun Suri
Lecture -6 Find no. of occurrences of an element in a sorted array
9:06
Lecture -5 Find first and last occurrence of an element in a sorted array (Binary Search)
Arjun Suri
Lecture -5 Find first and last occurrence of an element in a sorted array (Binary Search)
16:56
Lecture 4 - Searching Algos (Binary Search)
Arjun Suri
Lecture 4 - Searching Algos (Binary Search)
15:24
Lecture 3 - Searching Algos (Linear search)
Arjun Suri
Lecture 3 - Searching Algos (Linear search)
9:46
Lecture -2 Asymptotic analysis of Algorithms
Arjun Suri
Lecture -2 Asymptotic analysis of Algorithms
25:27
Lecture -1 Introduction to Algorithms
Arjun Suri
Lecture -1 Introduction to Algorithms
12:29
Fastest way to learn new tech in 2024 #computerscience #techjobs #faang #programming
Arjun Suri
Fastest way to learn new tech in 2024 #computerscience #techjobs #faang #programming
1:01
Lecture 57 || BFS for disconnected graph
Arjun Suri
Lecture 57 || BFS for disconnected graph
9:33
Lecture 56 || Depth First traversal of Graph
Arjun Suri
Lecture 56 || Depth First traversal of Graph
10:54
Lecture 55 || Breadth First Search in Graph
Arjun Suri
Lecture 55 || Breadth First Search in Graph
14:16
How does a project gets executed in a software company??
Arjun Suri
How does a project gets executed in a software company??
8:30
Lecture 54 || Adjacency matrix implementation of graph
Arjun Suri
Lecture 54 || Adjacency matrix implementation of graph
5:34
How to manage finances as a fresher?? 🤑🤑
Arjun Suri
How to manage finances as a fresher?? 🤑🤑
7:07
Lecture - 53 Adjacency list implementation of Graph
Arjun Suri
Lecture - 53 Adjacency list implementation of Graph
10:16
Lecture - 52 || Edge list representation of graph
Arjun Suri
Lecture - 52 || Edge list representation of graph
12:30
Lecture 51 || Graph representations (Adjacency List and Matrix)
Arjun Suri
Lecture 51 || Graph representations (Adjacency List and Matrix)
15:25
Lecture 50 || Introduction to graphs (Basics)
Arjun Suri
Lecture 50 || Introduction to graphs (Basics)
15:46
Best way to decide career in 2023
Arjun Suri
Best way to decide career in 2023
5:08
Best way to get referrals in 2023
Arjun Suri
Best way to get referrals in 2023
2:29
Lecture 49 || Check if array can be divided in pairs whose some is divisible by k
Arjun Suri
Lecture 49 || Check if array can be divided in pairs whose some is divisible by k
32:17
Lecture 48 || Find numbers a,b,c,d in an array such that a+b = c+d
Arjun Suri
Lecture 48 || Find numbers a,b,c,d in an array such that a+b = c+d
11:36
How to make a good software development profile???? 😋🤑
Arjun Suri
How to make a good software development profile???? 😋🤑
11:11
Lecture 47 || Count distinct elements in every window of size k
Arjun Suri
Lecture 47 || Count distinct elements in every window of size k
17:42
Lecture 46 || Find if duplicates exist in an array within k distance
Arjun Suri
Lecture 46 || Find if duplicates exist in an array within k distance
28:22
Lecture 45 || Introduction to Hashing
Arjun Suri
Lecture 45 || Introduction to Hashing
22:16
Lecture 44 || Find Kth smallest element in an array
Arjun Suri
Lecture 44 || Find Kth smallest element in an array
22:47
Lecture 43 || Basics of priority queue (Theoretical discussion)
Arjun Suri
Lecture 43 || Basics of priority queue (Theoretical discussion)
12:26
Lecture 42 || MinHeap (Part 2)
Arjun Suri
Lecture 42 || MinHeap (Part 2)
15:03
Core of Software engineering is not coding???😲😲
Arjun Suri
Core of Software engineering is not coding???😲😲
1:30
Lecture 41 || Min Heap (Part - 1)
Arjun Suri
Lecture 41 || Min Heap (Part - 1)
39:07
Lecture 40 || Basics of heap data structure (Theoretical)
Arjun Suri
Lecture 40 || Basics of heap data structure (Theoretical)
15:14
Lecture 39 || Check if all internal nodes of a BST have single child node
Arjun Suri
Lecture 39 || Check if all internal nodes of a BST have single child node
21:52
What exactly does an Oncall Engineer do????
Arjun Suri
What exactly does an Oncall Engineer do????
17:43
Lecture 38 || Minimum element in a BST
Arjun Suri
Lecture 38 || Minimum element in a BST
7:20
Lecture 37 || Inorder traversal of a BST (Iterative)
Arjun Suri
Lecture 37 || Inorder traversal of a BST (Iterative)
20:59
Lecture 36 || Find Inorder successor for a given key in BST
Arjun Suri
Lecture 36 || Find Inorder successor for a given key in BST
28:09
Lecture -35 || Check whether binary tree is bst or not
Arjun Suri
Lecture -35 || Check whether binary tree is bst or not
21:09
Reality of engineering branches in India
Arjun Suri
Reality of engineering branches in India
8:30
Lecture - 34 || Print all keys in BST within given range
Arjun Suri
Lecture - 34 || Print all keys in BST within given range
5:28
Lecture - 33 || Binary Search tree (search key in bst)
Arjun Suri
Lecture - 33 || Binary Search tree (search key in bst)
4:41
Finance Youtube channels that everyone should checkout (Personal Recommendation)
Arjun Suri
Finance Youtube channels that everyone should checkout (Personal Recommendation)
5:58
Lecture 32 || Binary Search Tree (Insertion of new node)
Arjun Suri
Lecture 32 || Binary Search Tree (Insertion of new node)
15:48
Lecture 31 || Basics Of Binary Search Tree (Origins)
Arjun Suri
Lecture 31 || Basics Of Binary Search Tree (Origins)
22:47
Lecture-30 || Print binary tree in vertical order
Arjun Suri
Lecture-30 || Print binary tree in vertical order
14:02
Lecture- 29 || Top view of binary tree
Arjun Suri
Lecture- 29 || Top view of binary tree
19:25
Everything about ACM-ICPC (Olympics of programming)
Arjun Suri
Everything about ACM-ICPC (Olympics of programming)
11:58
Lecture- 28 || Print root to leaf nodes in binary tree
Arjun Suri
Lecture- 28 || Print root to leaf nodes in binary tree
22:02
Lecture- 27 || Find nth node in inorder traversal of binary tree
Arjun Suri
Lecture- 27 || Find nth node in inorder traversal of binary tree
17:08
Lecture- 26 || Find no. of leaf nodes in a Binary Tree
Arjun Suri
Lecture- 26 || Find no. of leaf nodes in a Binary Tree
9:04
Lecture- 25 || Level of a node in Binary Tree
Arjun Suri
Lecture- 25 || Level of a node in Binary Tree
21:48
Lecture- 24 || Diameter of Binary Tree (Recursive Approach)
Arjun Suri
Lecture- 24 || Diameter of Binary Tree (Recursive Approach)
24:15
Lecture- 23 || Height of Binary Tree (Recursive Approach)
Arjun Suri
Lecture- 23 || Height of Binary Tree (Recursive Approach)
16:38
Lecture- 22 || Level Order traversal of Binary tree
Arjun Suri
Lecture- 22 || Level Order traversal of Binary tree
21:13
Lecture- 21 || Inorder and Postorder traversal of Binary tree
Arjun Suri
Lecture- 21 || Inorder and Postorder traversal of Binary tree
15:59
Lecture- 20 || Preorder traversal of Binary tree
Arjun Suri
Lecture- 20 || Preorder traversal of Binary tree
32:03
Lecture- 19 || Binary tree implementation with C++ (Part-2)
Arjun Suri
Lecture- 19 || Binary tree implementation with C++ (Part-2)
13:50
Lecture-18 || Basics of Tree Data Structure (Theoretical Explanation) Part-1
Arjun Suri
Lecture-18 || Basics of Tree Data Structure (Theoretical Explanation) Part-1
23:17
Lecture-17 || Check if a queue can be converted into sorted queue using stack
Arjun Suri
Lecture-17 || Check if a queue can be converted into sorted queue using stack
13:20
Queue Lecture - 16 || Priority Queue Implementation
Arjun Suri
Queue Lecture - 16 || Priority Queue Implementation
29:25
Queue Lecture - 15 || Basics of Priority Queue
Arjun Suri
Queue Lecture - 15 || Basics of Priority Queue
16:13
Queue Lecture - 14 || Implementing Dequeue with Doubly Linked List
Arjun Suri
Queue Lecture - 14 || Implementing Dequeue with Doubly Linked List
21:21
Queue Lecture - 13 || Basics of Queue (Part-2)
Arjun Suri
Queue Lecture - 13 || Basics of Queue (Part-2)
25:18
Queue Lecture - 12 || Basics of Queue (Part-1)
Arjun Suri
Queue Lecture - 12 || Basics of Queue (Part-1)
13:18
Stack Lecture - 11 || Infix to Postfix conversion (Indepth Analysis)
Arjun Suri
Stack Lecture - 11 || Infix to Postfix conversion (Indepth Analysis)
41:53
Lecture- 10 || Tower of Hanoi problem (With recursion and stack calls)
Arjun Suri
Lecture- 10 || Tower of Hanoi problem (With recursion and stack calls)
23:35
My Amazon interview experience
Arjun Suri
My Amazon interview experience
5:56
pro insights-1 || How she cracked GSOC and MS in UCL?? 😲😲
Arjun Suri
pro insights-1 || How she cracked GSOC and MS in UCL?? 😲😲
36:36
Stack Lecture-9 || Implementing queue using stack
Arjun Suri
Stack Lecture-9 || Implementing queue using stack
21:10
Lecture-8 || Checking Balanced Parenthesis with help of Stack
Arjun Suri
Lecture-8 || Checking Balanced Parenthesis with help of Stack
25:03
Lecture-7 || Basics of Stack Data Structure
Arjun Suri
Lecture-7 || Basics of Stack Data Structure
17:56
What is Virtual Hiring??? || Pros and Cons of Hiring Virtually
Arjun Suri
What is Virtual Hiring??? || Pros and Cons of Hiring Virtually
12:31
Linked List lecture-6 || Pairwise swapping of node data in a linked list
Arjun Suri
Linked List lecture-6 || Pairwise swapping of node data in a linked list
14:24
Who is/was/will be Humblefool????
Arjun Suri
Who is/was/will be Humblefool????
10:49
Linked List lecture-5 || Detect loop in linked list || Floyd Cycle Detection Algorithm
Arjun Suri
Linked List lecture-5 || Detect loop in linked list || Floyd Cycle Detection Algorithm
12:33
What to do after college??😕😕|| Career options after engineering
Arjun Suri
What to do after college??😕😕|| Career options after engineering
11:23
Linked list lecture- 4 || Count no. of nodes in a linked list through recursion
Arjun Suri
Linked list lecture- 4 || Count no. of nodes in a linked list through recursion
10:40
Linked List lecture-3 || Reverse a linked list in groups of given size
Arjun Suri
Linked List lecture-3 || Reverse a linked list in groups of given size
23:52
Why you should not do an MBA???? | Part-2 | Discussing Financial Aspects
Arjun Suri
Why you should not do an MBA???? | Part-2 | Discussing Financial Aspects
8:53
Why you should not do an MBA in 2020????
Arjun Suri
Why you should not do an MBA in 2020????
10:00
Linked List lecture-2 || Reverse a Linked List through iteration
Arjun Suri
Linked List lecture-2 || Reverse a Linked List through iteration
20:19
Linked List lecture-1 || Basics Of Linked List 🔥🔥
Arjun Suri
Linked List lecture-1 || Basics Of Linked List 🔥🔥
19:42
Lecture -1 What are Data Structures?? || Basics of Data Structures
Arjun Suri
Lecture -1 What are Data Structures?? || Basics of Data Structures
9:33
Top 5 Youtube Channels Every student should Subscribe 🔥🔥|| Must watch for all the college students
Arjun Suri
Top 5 Youtube Channels Every student should Subscribe 🔥🔥|| Must watch for all the college students
6:54
Clear roadmap to crack product based companies (For Freshers) 🤑😄
Arjun Suri
Clear roadmap to crack product based companies (For Freshers) 🤑😄
12:25
How to use social media effectively???? 🤔🤔 SPECIALLY FOR DEVELOPERS | (Headphones are recommended)
Arjun Suri
How to use social media effectively???? 🤔🤔 SPECIALLY FOR DEVELOPERS | (Headphones are recommended)
5:25
Card Shuffling Game || Frontend Game Development || Vanilla JS
Arjun Suri
Card Shuffling Game || Frontend Game Development || Vanilla JS
2:01
First React App || ToDoList || Frontend Development
Arjun Suri
First React App || ToDoList || Frontend Development
1:20
COVID-19 React App || Frontend Beginner Friendly Project
Arjun Suri
COVID-19 React App || Frontend Beginner Friendly Project
2:26