Skip to content

Ayush272002/Complete-Java-with-DSA

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

88 Commits
Lecture 001 Bitwise Operator
Lecture 001 Bitwise Operator
 
 
Lecture 002 Swap Two Numbers
Lecture 002 Swap Two Numbers
 
 
Lecture 003 Masking
Lecture 003 Masking
 
 
Lecture 004 Bitwise Operator Questions
Lecture 004 Bitwise Operator Questions
 
 
Lecture 005 Bitwise Operator Questions
Lecture 005 Bitwise Operator Questions
 
 
Lecture 006 Lucky Numbers
Lecture 006 Lucky Numbers
 
 
Lecture 007 SingleNumber II
Lecture 007 SingleNumber II
 
 
Lecture 008 Subsequences of String
Lecture 008 Subsequences of String
 
 
Lecture 009 sieve of eratosthenes I Count Primes
Lecture 009 sieve of eratosthenes I Count Primes
 
 
Lecture 010 HCF LCM Euclids Algorithm
Lecture 010 HCF LCM Euclids Algorithm
 
 
Lecture 011 - Prime Pairs With Target Sum
Lecture 011 - Prime Pairs With Target Sum
 
 
Lecture 012 Binary Search
Lecture 012 Binary Search
 
 
Lecture 013 Binary Search Questions
Lecture 013 Binary Search Questions
 
 
Lecture 014 Binary Search Interview Questions FAANG
Lecture 014 Binary Search Interview Questions FAANG
 
 
Lecture 015 Binary Search Advanced Problems
Lecture 015 Binary Search Advanced Problems
 
 
Lecture 016 Selection Sort
Lecture 016 Selection Sort
 
 
Lecture 017 Bubble Sort
Lecture 017 Bubble Sort
 
 
Lecture 018 Insertion Sort
Lecture 018 Insertion Sort
 
 
Lecture 019 -Solving LeetCodeCodeStudio Questions [Arrays]
Lecture 019 -Solving LeetCodeCodeStudio Questions [Arrays]
 
 
Lecture 020-Solving LeetCodeCodeStudio Questions [Arrays]
Lecture 020-Solving LeetCodeCodeStudio Questions [Arrays]
 
 
Lecture 021 Merge Sort
Lecture 021 Merge Sort
 
 
Lecture 022 - Quick Sort using Recursion
Lecture 022 - Quick Sort using Recursion
 
 
Lecture 023 - Count Sort
Lecture 023 - Count Sort
 
 
Lecture 024 - Radix Sort
Lecture 024 - Radix Sort
 
 
Lecture 025 - Pigeonhole Sort
Lecture 025 - Pigeonhole Sort
 
 
Lecture 026 - Moores Voting Algotithm
Lecture 026 - Moores Voting Algotithm
 
 
Lecture 027 - Dutch National Flag algorithm
Lecture 027 - Dutch National Flag algorithm
 
 
Lecture 044 Linked List & its types
Lecture 044 Linked List & its types
 
 
Lecture 045 Linked List Questions Reverse LL and find Middle of LL
Lecture 045 Linked List Questions Reverse LL and find Middle of LL
 
 
Lecture 046 Linked List Questions Reverse in K group and Check LL is circular or Not
Lecture 046 Linked List Questions Reverse in K group and Check LL is circular or Not
 
 
Lecture 047 Detect & Remove loop in linked list/Question 1
Lecture 047 Detect & Remove loop in linked list/Question 1
 
 
Lecture 048 Remove Duplicates from a Sorted or Unsorted Linked List
Lecture 048 Remove Duplicates from a Sorted or Unsorted Linked List
 
 
Lecture 049 Mege 2 Sorted Linked List & Sort Linked List
Lecture 049 Mege 2 Sorted Linked List & Sort Linked List
 
 
Lecture 050 Check whether a linked list is Palindrome
Lecture 050 Check whether a linked list is Palindrome
 
 
Lecture 051 Add 2 Linked Lists
Lecture 051 Add 2 Linked Lists
 
 
Lecture 052 Clone a Linked List With Random Pointers
Lecture 052 Clone a Linked List With Random Pointers
 
 
Lecture 053 Merge Sort in Linked List
Lecture 053 Merge Sort in Linked List
 
 
Lecture 054 Intro to Stacks
Lecture 054 Intro to Stacks
 
 
Lecture 055 Stack Interview Questions
Lecture 055 Stack Interview Questions
 
 
Lecture 056 Largest Rectangle Area in Histogram
Lecture 056 Largest Rectangle Area in Histogram
 
 
Lecture 057 Celebrity Problem & Max Rectangle in Binary Matrix with all 1's
Lecture 057 Celebrity Problem & Max Rectangle in Binary Matrix with all 1's
 
 
Lecture 058 N Stacks in an Array Stack Hard Question
Lecture 058 N Stacks in an Array Stack Hard Question
 
 
Lecture 059 Design Special Stack Problem
Lecture 059 Design Special Stack Problem
 
 
Lecture 060 Queues
Lecture 060 Queues
 
 
Lecture 061 Queue FAANG Interview Questions
Lecture 061 Queue FAANG Interview Questions
 
 
Lecture 062 Binary Trees & its Representation Different types of Traversals
Lecture 062 Binary Trees & its Representation Different types of Traversals
 
 
Lecture 063 Binary Tree FAANG Interview Questions
Lecture 063 Binary Tree FAANG Interview Questions
 
 
Lecture 064 Binary Tree FAANG Interview Questions
Lecture 064 Binary Tree FAANG Interview Questions
 
 
Lecture 065 Binary Tree FAANG Interview Questions
Lecture 065 Binary Tree FAANG Interview Questions
 
 
Lecture 066 Construct a Binary Tree from InOrder , PreOrder , PostOrder Traversal
Lecture 066 Construct a Binary Tree from InOrder , PreOrder , PostOrder Traversal
 
 
Lecture 067 Minimum Time to Burn The Entire Binary Tree
Lecture 067 Minimum Time to Burn The Entire Binary Tree
 
 
Lecture 068 Morris Traversal Flatten a Binary tree to Linked List
Lecture 068 Morris Traversal Flatten a Binary tree to Linked List
 
 
Lecture 069 Binary Search Tree and its Implementation Insertion Deletion Searching a Node
Lecture 069 Binary Search Tree and its Implementation Insertion Deletion Searching a Node
 
 
Lecture 070 Other Forms Of Trees
Lecture 070 Other Forms Of Trees
 
 
Lecture 071 Binary SearchTree FAANG Interview Questions Part-1
Lecture 071 Binary SearchTree FAANG Interview Questions Part-1
 
 
Lecture 072 Binary SearchTree FAANG Interview Questions Part-2
Lecture 072 Binary SearchTree FAANG Interview Questions Part-2
 
 
Lecture 073 Merge 2 Binary Search Trees
Lecture 073 Merge 2 Binary Search Trees
 
 
Lecture 074 Largest BST in a Binary Tree
Lecture 074 Largest BST in a Binary Tree
 
 
Lecture 075 Heaps-Heap Sort-Insertion Deletion in Heap-Priority Queue STL
Lecture 075 Heaps-Heap Sort-Insertion Deletion in Heap-Priority Queue STL
 
 
Lecture 076 Heaps in Java Interview Questions Part - 1
Lecture 076 Heaps in Java Interview Questions Part - 1
 
 
Lecture 077 Heaps in Java Interview Questions Part - 2
Lecture 077 Heaps in Java Interview Questions Part - 2
 
 
Lecture 078 Heaps Hard Interview Questions Part - 3
Lecture 078 Heaps Hard Interview Questions Part - 3
 
 
Lecture 079 Hashmaps
Lecture 079 Hashmaps
 
 
Lecture 080 Trie & its Implementation
Lecture 080 Trie & its Implementation
 
 
Lecture 081 Longest Common Prefix Problem Tries
Lecture 081 Longest Common Prefix Problem Tries
 
 
Lecture 082 - Implement a Phone Directory Using Trie
Lecture 082 - Implement a Phone Directory Using Trie
 
 
Lecture 083 - Rat in Maze Problem Backtracking Day 1
Lecture 083 - Rat in Maze Problem Backtracking Day 1
 
 
Lecture 084 - N-Queen Problem Backtracking Day 2
Lecture 084 - N-Queen Problem Backtracking Day 2
 
 
Lecture 085 - Sudoku Solver Problem Backtracking Day 3
Lecture 085 - Sudoku Solver Problem Backtracking Day 3
 
 
Lecture 086 - Introduction to Graphs Creation and Implementation
Lecture 086 - Introduction to Graphs Creation and Implementation
 
 
Lecture 087 - BFS Traversal in Graph
Lecture 087 - BFS Traversal in Graph
 
 
Lecture 088 - DFS Traversal in Graph
Lecture 088 - DFS Traversal in Graph
 
 
Lecture 089 - Cycle Detection in Undirected Graphs Using BFS and DFS
Lecture 089 - Cycle Detection in Undirected Graphs Using BFS and DFS
 
 
Lecture 090 - Cycle Detection in Directed Graphs
Lecture 090 - Cycle Detection in Directed Graphs
 
 
Lecture 091 - Topological Sort Using DFS
Lecture 091 - Topological Sort Using DFS
 
 
Lecture 092 - Topological Sort Using Kahns Algorithm or using BFS
Lecture 092 - Topological Sort Using Kahns Algorithm or using BFS
 
 
Lecture 093 - Cycle Detection In A Directed Graph
Lecture 093 - Cycle Detection In A Directed Graph
 
 
Lecture 094 - Shortest Path in Undirected Graphs
Lecture 094 - Shortest Path in Undirected Graphs
 
 
Lecture 095 - Shortest Path in Directed Acyclic Graphs
Lecture 095 - Shortest Path in Directed Acyclic Graphs
 
 
Lecture 096 - Dijkstras Algorithm
Lecture 096 - Dijkstras Algorithm
 
 
Lecture 097 - Minimum Spanning Tree Prims Algorithm
Lecture 097 - Minimum Spanning Tree Prims Algorithm
 
 
Lecture 098 - Kruskals Algorithm - Disjoint Set - Union by Rank and Path Compression
Lecture 098 - Kruskals Algorithm - Disjoint Set - Union by Rank and Path Compression
 
 
Lecture 099 - Bridges in a Graph
Lecture 099 - Bridges in a Graph
 
 
Lecture 100 - Articulation Points in Graphs Tarjan's Algorithm
Lecture 100 - Articulation Points in Graphs Tarjan's Algorithm
 
 
Lecture 101 - Kosarajus Algorithm for Strongly Connected Components
Lecture 101 - Kosarajus Algorithm for Strongly Connected Components
 
 
Lecture 102 - Bellman Ford Algorithm, Floyed Warshell Algorithm
Lecture 102 - Bellman Ford Algorithm, Floyed Warshell Algorithm
 
 
Lecture 103 - Bipartite Graphs
Lecture 103 - Bipartite Graphs
 
 
Lecture 104 - Graph Questions
Lecture 104 - Graph Questions
 
 
Lecture 105 - Introduction to Dynamic Programming_Memoization_Tabulation_Space Optimisation
Lecture 105 - Introduction to Dynamic Programming_Memoization_Tabulation_Space Optimisation
 
 
Lecture 106 - Minimum Cost Climbing Stairs
Lecture 106 - Minimum Cost Climbing Stairs
 
 
Lecture 107 - Minimum Number of Coins
Lecture 107 - Minimum Number of Coins
 
 
Lecture 108 - Maximum Sum of Non-Adjacent Elements
Lecture 108 - Maximum Sum of Non-Adjacent Elements
 
 
Lecture 109 - House Robbery Problem
Lecture 109 - House Robbery Problem
 
 
Lecture 110 - Cut Rod into Segments of X Y Z
Lecture 110 - Cut Rod into Segments of X Y Z
 
 
Lecture 111 - Count derangements
Lecture 111 - Count derangements
 
 
Lecture 112 - Painting Fence Algorithm
Lecture 112 - Painting Fence Algorithm
 
 
Lecture 113 - 0 1 KnapSack Problem
Lecture 113 - 0 1 KnapSack Problem
 
 
Lecture 114 - Combination Sum IV Problem
Lecture 114 - Combination Sum IV Problem
 
 
Lecture 115 - Perfect Squares Problem
Lecture 115 - Perfect Squares Problem
 
 
Lecture 116 - Minimum Cost for Tickets
Lecture 116 - Minimum Cost for Tickets
 
 

Repository files navigation

hello

About

Complete DSA series using Java which covers all important DSA concepts asked in an interview

Topics

java leetcode geeksforgeeks dsa algorithms-and-data-structures codingninjas

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages