Skip to content

Tiwarishashwat/Java-Plus-DSA-Placement-Course

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

104 Commits
Lecture-001 - Programming Language/Notes
Lecture-001 - Programming Language/Notes
 
 
Lecture-002 - Program Flow
Lecture-002 - Program Flow
 
 
Lecture-003 - How Java Program compiles/Notes
Lecture-003 - How Java Program compiles/Notes
 
 
Lecture-004 - Writing your first program
Lecture-004 - Writing your first program
 
 
Lecture-005 - Java Being Java
Lecture-005 - Java Being Java
 
 
Lecture-006 - Operators and Inputs
Lecture-006 - Operators and Inputs
 
 
Lecture-007 - Packages and Modifiers
Lecture-007 - Packages and Modifiers
 
 
Lecture-008 - Flow control and Loops
Lecture-008 - Flow control and Loops
 
 
Lecture-009 - Functions
Lecture-009 - Functions
 
 
Lecture-010 - Mini Project-1/codes
Lecture-010 - Mini Project-1/codes
 
 
Lecture-011 - Maths for DSA - 1
Lecture-011 - Maths for DSA - 1
 
 
Lecture-012 - Maths for DSA - 2
Lecture-012 - Maths for DSA - 2
 
 
Lecture-013 - Bits and Binary Operations/notes
Lecture-013 - Bits and Binary Operations/notes
 
 
Lecture-014 - Bits Manipulation Tips
Lecture-014 - Bits Manipulation Tips
 
 
Lecture-015 - Interview Questions on Bit Manipulation
Lecture-015 - Interview Questions on Bit Manipulation
 
 
Lecture-016 - Array in one shot
Lecture-016 - Array in one shot
 
 
Lecture-017 - Linear Search/code
Lecture-017 - Linear Search/code
 
 
Lecture-018 - Binary Search
Lecture-018 - Binary Search
 
 
Lecture-019 - Questions on Binary Search/code
Lecture-019 - Questions on Binary Search/code
 
 
Lecture-020 - Binary Search on Infinite Array
Lecture-020 - Binary Search on Infinite Array
 
 
Lecture-021 - Binary Search on Bitonic Array
Lecture-021 - Binary Search on Bitonic Array
 
 
Lecture-022 - Rotated Sorted Array/code
Lecture-022 - Rotated Sorted Array/code
 
 
Lecture-023 - Hard Questions
Lecture-023 - Hard Questions
 
 
Lecture-024 - Koko Eating Bananas
Lecture-024 - Koko Eating Bananas
 
 
Lecture-025 - Smallest Divisor in Given Threshold
Lecture-025 - Smallest Divisor in Given Threshold
 
 
Lecture-026 - Minimize Maximum of Products/code
Lecture-026 - Minimize Maximum of Products/code
 
 
Lecture-027 - Aggressive Cows
Lecture-027 - Aggressive Cows
 
 
Lecture-028 - Median of two Sorted Arrays
Lecture-028 - Median of two Sorted Arrays
 
 
Lecture-029 - Find Kth element of Two Sorted Arrays/code
Lecture-029 - Find Kth element of Two Sorted Arrays/code
 
 
Lecture-030 - Single Element and Square Root
Lecture-030 - Single Element and Square Root
 
 
Lecture-031 - Other Search Algorithm
Lecture-031 - Other Search Algorithm
 
 
Lecture-032 - Median of a Matrix/code
Lecture-032 - Median of a Matrix/code
 
 
Lecture-033 - Smallest Kth Element of Matrix/code
Lecture-033 - Smallest Kth Element of Matrix/code
 
 
Lecture-034 - Search in Sorted Matrix/code
Lecture-034 - Search in Sorted Matrix/code
 
 
Lecture-035 - Transpose and Rotate a Matrix/code
Lecture-035 - Transpose and Rotate a Matrix/code
 
 
Lecture-036 - Spiral Matrix/code
Lecture-036 - Spiral Matrix/code
 
 
Lecture-037 - Time and Space Complexity/note
Lecture-037 - Time and Space Complexity/note
 
 
Lecture-038 - Insertion Sort/code
Lecture-038 - Insertion Sort/code
 
 
Lecture-039 - Selection Sort/code
Lecture-039 - Selection Sort/code
 
 
Lecture-040 - Bubble and Brick Sort/code
Lecture-040 - Bubble and Brick Sort/code
 
 
Lecture-041 - Counting Sort/code
Lecture-041 - Counting Sort/code
 
 
Lecture-042 - Radix Sort/code
Lecture-042 - Radix Sort/code
 
 
Lecture-043 - Pigeonhole Sort/code
Lecture-043 - Pigeonhole Sort/code
 
 
Lecture-044 - Cycle Sort/code
Lecture-044 - Cycle Sort/code
 
 
Lecture-045 - Missing Number/code
Lecture-045 - Missing Number/code
 
 
Lecture-046 - Find All Numbers Disappeared in Array/code
Lecture-046 - Find All Numbers Disappeared in Array/code
 
 
Lecture-047 - Find Single and All duplicates/code
Lecture-047 - Find Single and All duplicates/code
 
 
Lecture-048 - Introduction to Strings/codes
Lecture-048 - Introduction to Strings/codes
 
 
Lecture-049 - String functions, builder and buffer/code
Lecture-049 - String functions, builder and buffer/code
 
 
Lecture-050 - string formatting and buffered reader
Lecture-050 - string formatting and buffered reader
 
 
Lecture-051 - Print All Substrings/code
Lecture-051 - Print All Substrings/code
 
 
Lecture-052 - Reverse Strings/code
Lecture-052 - Reverse Strings/code
 
 
Lecture-053 - Palindrome String/code
Lecture-053 - Palindrome String/code
 
 
Lecture-054 - Reverse Words in a String-1/codes
Lecture-054 - Reverse Words in a String-1/codes
 
 
Lecture-055 - Anagrams/codes
Lecture-055 - Anagrams/codes
 
 
Lecture-056 - Reverse Words in a String-3/code
Lecture-056 - Reverse Words in a String-3/code
 
 
Lecture-057 - Stacks in one shot
Lecture-057 - Stacks in one shot
 
 
Lecture-058 - Valid Parentheses
Lecture-058 - Valid Parentheses
 
 
Lecture-059 - Count the Reversals
Lecture-059 - Count the Reversals
 
 
Lecture-060 - Minimum Add to make parentheses Valid
Lecture-060 - Minimum Add to make parentheses Valid
 
 
Lecture-061 - Minimum Number of Swaps to balance String
Lecture-061 - Minimum Number of Swaps to balance String
 
 
Lecture-062 - Minimum Adjacent Swaps for bracket balancing
Lecture-062 - Minimum Adjacent Swaps for bracket balancing
 
 
Lecture-063 - Asteroids Collisions
Lecture-063 - Asteroids Collisions
 
 
Lecture-064 - Stock Span Problem
Lecture-064 - Stock Span Problem
 
 
Lecture-065 - Next Greater Element
Lecture-065 - Next Greater Element
 
 
Lecture-066 - Help Classmates - Next Smaller Element
Lecture-066 - Help Classmates - Next Smaller Element
 
 
Lecture-067 - Next Greater-Smaller Element in circular Array
Lecture-067 - Next Greater-Smaller Element in circular Array
 
 
Lecture-068 - Largest Rectangle in Histogram
Lecture-068 - Largest Rectangle in Histogram
 
 
Lecture-069 - Maximal Rectangle
Lecture-069 - Maximal Rectangle
 
 
Lecture-070 - Longest Valid Parentheses
Lecture-070 - Longest Valid Parentheses
 
 
Lecture-071 - Queue Data Structure/codes
Lecture-071 - Queue Data Structure/codes
 
 
Lecture-072 - Queue using Stacks
Lecture-072 - Queue using Stacks
 
 
Lecture-073 - Stack using Queues
Lecture-073 - Stack using Queues
 
 
Lecture-106 - What is Hashing
Lecture-106 - What is Hashing
 
 
Lecture-107 - HashMap in Java
Lecture-107 - HashMap in Java
 
 
Lecture-108 - Code Your Own HashMap
Lecture-108 - Code Your Own HashMap
 
 
Lecture-109 - Most Frequent Element
Lecture-109 - Most Frequent Element
 
 
Lecture-110 - ArraySubsetOfAnotherArray
Lecture-110 - ArraySubsetOfAnotherArray
 
 
Lecture-111 - Count Pairs With Given Sum
Lecture-111 - Count Pairs With Given Sum
 
 
Lecture-112 - HashSet Intro
Lecture-112 - HashSet Intro
 
 
Lecture-113 - Minimum Number Of Distinct Sets
Lecture-113 - Minimum Number Of Distinct Sets
 
 
Lecture-114 - K-Sum Subarray Pattern
Lecture-114 - K-Sum Subarray Pattern
 
 
Lecture-115 - Subarray Sum Divisible by K
Lecture-115 - Subarray Sum Divisible by K
 
 
Lecture-116 - LongestConsecutiveSequence
Lecture-116 - LongestConsecutiveSequence
 
 
Lecture-117 - Longest Subarray of 0 & 1
Lecture-117 - Longest Subarray of 0 & 1
 
 
Lecture-118 - Bucket Sort
Lecture-118 - Bucket Sort
 
 
Lecture-207 - Dynamic Programming
Lecture-207 - Dynamic Programming
 
 
Lecture-208 - Greedy Algorithms
Lecture-208 - Greedy Algorithms
 
 
.DS_Store
.DS_Store
 
 
DisjointSet.java
DisjointSet.java
 
 
README.md
README.md
 
 
graph-2.java
graph-2.java
 
 

Repository files navigation

About

This is a placement course

Resources

Readme
Activity

Stars

235 stars

Watchers

8 watching

Forks

101 forks
Report repository

Releases

No releases published

Packages

No packages published

Contributors 2

Languages