Канал: Shiva Prasad Gurram

#8 - Best Time to Buy and Sell Stock - Leetcode 121 - Brute Force - Optimized

#8 - Best Time to Buy and Sell Stock - Leetcode 121 - Brute Force - Optimized

#7 - Min Stack Design - Leetcode 155 - Stack

#7 - Min Stack Design - Leetcode 155 - Stack

#6 - Sort Colors - Leetcode 75 - Dutch National Flag O(n)

#6 - Sort Colors - Leetcode 75 - Dutch National Flag O(n)

#5 - Contains Duplicate - Leetcode 217 - Solved in 4 ways

#5 - Contains Duplicate - Leetcode 217 - Solved in 4 ways

#4 - Valid Anagram - Leetcode 242 - Sorting - HashMap

#4 - Valid Anagram - Leetcode 242 - Sorting - HashMap

#3 - Valid Parentheses - Leetcode 20 - Stack

#3 - Valid Parentheses - Leetcode 20 - Stack

#2 - Majority Element - Leetcode 169 - Sorting - HashMap - Moore's Voting Algorithm

#2 - Majority Element - Leetcode 169 - Sorting - HashMap - Moore's Voting Algorithm

#1 - Two Sum - Leetcode 1 - Brute Force - Optimized - Java

#1 - Two Sum - Leetcode 1 - Brute Force - Optimized - Java

Leetcode BLIND 75 - Must do problems

Leetcode BLIND 75 - Must do problems

Difference Between Ones and Zeros in Row and Column | Leetcode 2482

Difference Between Ones and Zeros in Row and Column | Leetcode 2482

Design Min Stack | LeetCode 155 | O(1) Time Complexity

Design Min Stack | LeetCode 155 | O(1) Time Complexity

Find First and Last Position of Element in Sorted Array | LeetCode 34

Find First and Last Position of Element in Sorted Array | LeetCode 34

Majority Element II - LeetCode 229 | SOLVED in 3 ways | T.C O(N) | S.C O(1)

Majority Element II - LeetCode 229 | SOLVED in 3 ways | T.C O(N) | S.C O(1)

Observer Design Pattern

Observer Design Pattern

Design HashMap - LeetCode 706

Design HashMap - LeetCode 706

Number of Good Pairs - Leetcode 1512 | Two Solutions | O(N) T.C

Number of Good Pairs - Leetcode 1512 | Two Solutions | O(N) T.C

Remove Colored Pieces if Both Neighbors are the Same Color - LeetCode 2038

Remove Colored Pieces if Both Neighbors are the Same Color - LeetCode 2038

State Design Pattern

State Design Pattern

Reverse Words in a String III - LeetCode 557 | Two Solutions Explained 🔥🔥

Reverse Words in a String III - LeetCode 557 | Two Solutions Explained 🔥🔥

Coupling In Software Engineering | Tight Coupling VS Loose Coupling | Java

Coupling In Software Engineering | Tight Coupling VS Loose Coupling | Java

Diamond Problem in Java | Multiple Inheritance drawback | Java Interview Series

Diamond Problem in Java | Multiple Inheritance drawback | Java Interview Series

Efficient Bulk Data Insertion into PostgreSQL using SQL: Managing Millions of Records

Efficient Bulk Data Insertion into PostgreSQL using SQL: Managing Millions of Records

Smallest Number in Infinite Set | Leetcode 2336 | Live coding session 🔥🔥

Smallest Number in Infinite Set | Leetcode 2336 | Live coding session 🔥🔥

Removing Stars From a String | Leetcode 2390 | Live coding session 🔥🔥

Removing Stars From a String | Leetcode 2390 | Live coding session 🔥🔥

Sum of Square Numbers | Leetcode 633 | Live coding session 🔥🔥🔥

Sum of Square Numbers | Leetcode 633 | Live coding session 🔥🔥🔥

Number of Zero-Filled Subarrays | Leetcode | Java

Number of Zero-Filled Subarrays | Leetcode | Java

How to Write a Resume | 8 Tips for Writing a Winning Resume

How to Write a Resume | 8 Tips for Writing a Winning Resume

Increasing triplet subsequence | Leetcode 334 | Optimized solution

Increasing triplet subsequence | Leetcode 334 | Optimized solution

Recyclable and Low Fat Products | Leetcode 1757 | SQL Series

Recyclable and Low Fat Products | Leetcode 1757 | SQL Series

Big Countries | Leetcode 595 | SQL Series

Big Countries | Leetcode 595 | SQL Series

Minimum Rounds to Complete All Tasks | Leetcode 2244 | Hashmap

Minimum Rounds to Complete All Tasks | Leetcode 2244 | Hashmap

Linked List complete roadmap for beginners | How to learn Linked list

Linked List complete roadmap for beginners | How to learn Linked list

Detect Capital | Leetcode 520 | String

Detect Capital | Leetcode 520 | String

Leaf - Similar Trees | Leetcode December | Day - 8

Leaf - Similar Trees | Leetcode December | Day - 8

Odd Even Linked List | Leetcode December | Day 6

Odd Even Linked List | Leetcode December | Day 6

Middle of the Linked List | Leetcode December | Day 5

Middle of the Linked List | Leetcode December | Day 5

Minimum Average Difference | Leetcode December | Day 4

Minimum Average Difference | Leetcode December | Day 4

Sort Characters By Frequency | Leetcode December | Day 3

Sort Characters By Frequency | Leetcode December | Day 3

Determine if Two Strings Are Close | Leetcode December | Day 2

Determine if Two Strings Are Close | Leetcode December | Day 2

Determine if String Halves Are Alike | Leetcode December | Day 1

Determine if String Halves Are Alike | Leetcode December | Day 1

Subarray Product Less Than K | Sliding Window | Leetcode

Subarray Product Less Than K | Sliding Window | Leetcode

Minimum Size Subarray Sum | Sliding Window | Leetcode

Minimum Size Subarray Sum | Sliding Window | Leetcode

Maximum Subarray Average | Sliding Window

Maximum Subarray Average | Sliding Window

GitHub - Create local repository and push to remote repository

GitHub - Create local repository and push to remote repository

Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Sliding Window

Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Sliding Window

Substrings of Size Three with Distinct Characters | Sliding Window

Substrings of Size Three with Distinct Characters | Sliding Window

Sliding Window Technique | Introduction

Sliding Window Technique | Introduction

Next Greater Element | Two Variants | Leetcode 496

Next Greater Element | Two Variants | Leetcode 496

Lecture 4: Subarray Sum Equals To K | SPG | Java

Lecture 4: Subarray Sum Equals To K | SPG | Java

Lecture 3: Subarray With 0 Sum | SPG | Java

Lecture 3: Subarray With 0 Sum | SPG | Java

Java 8 Stream API Interview Questions and Answers | Part - 3

Java 8 Stream API Interview Questions and Answers | Part - 3

Lecture 2: Check If Array Pairs Are Divisible By K - Coding | SPG | Java

Lecture 2: Check If Array Pairs Are Divisible By K - Coding | SPG | Java

Lecture 2: Check If Array Pairs Are Divisible By K - Explanation | SPG | Java

Lecture 2: Check If Array Pairs Are Divisible By K - Explanation | SPG | Java

Lecture 1: Count Pairs With Given Sum | SPG | Java

Lecture 1: Count Pairs With Given Sum | SPG | Java

What is HashMap Data Structure? | SPG | Java

What is HashMap Data Structure? | SPG | Java

What is my next series topic?

What is my next series topic?

Thank you

Thank you

Lecture 20: Partition List | SPG | JAVA

Lecture 20: Partition List | SPG | JAVA

Lecture 19: Remove Linked List Elements | SPG | JAVA

Lecture 19: Remove Linked List Elements | SPG | JAVA

Lecture 18: LRU Cache Implementation | Doubly Linked List | SPG | JAVA

Lecture 18: LRU Cache Implementation | Doubly Linked List | SPG | JAVA

Lecture 17: What is LRU Cache? | SPG | JAVA

Lecture 17: What is LRU Cache? | SPG | JAVA

Lecture 16: Design Browser History | Doubly Linked List | SPG | JAVA

Lecture 16: Design Browser History | Doubly Linked List | SPG | JAVA

Lecture 15: Odd Even Linked List | 2 methods | SPG | JAVA

Lecture 15: Odd Even Linked List | 2 methods | SPG | JAVA

Lecture 14: Swapping Nodes in a Linked List | 2 methods | SPG | JAVA

Lecture 14: Swapping Nodes in a Linked List | 2 methods | SPG | JAVA

Lecture 13: Remove Duplicates From Sorted List II | SPG | JAVA

Lecture 13: Remove Duplicates From Sorted List II | SPG | JAVA

Lecture 12: Remove Duplicates From Sorted List | SPG | JAVA

Lecture 12: Remove Duplicates From Sorted List | SPG | JAVA

Lecture 11: Intersection Of Two Linked Lists | SPG | JAVA

Lecture 11: Intersection Of Two Linked Lists | SPG | JAVA

Lecture 10: Remove Nth Node From End List | SPG | JAVA

Lecture 10: Remove Nth Node From End List | SPG | JAVA

Lecture 9: Delete Node Without Head Pointer in List | SPG | JAVA

Lecture 9: Delete Node Without Head Pointer in List | SPG | JAVA

Lecture 8: Find Middle Element in Linked List | 3 Methods | SPG | JAVA

Lecture 8: Find Middle Element in Linked List | 3 Methods | SPG | JAVA

Lecture 7: Add Two Numbers | SPG | Java

Lecture 7: Add Two Numbers | SPG | Java

Lecture 6: Rotate Linked List by K places | SPG | Java

Lecture 6: Rotate Linked List by K places | SPG | Java

Lecture 5: Remove the loop in Linked List | SPG | Java

Lecture 5: Remove the loop in Linked List | SPG | Java

Lecture 4: Middle of the Linked List | SPG | JAVA

Lecture 4: Middle of the Linked List | SPG | JAVA

Lecture 3: Delete a node in Single Linked List | SPG | JAVA

Lecture 3: Delete a node in Single Linked List | SPG | JAVA

Lecture 2: Insert a node in Single Linked List | SPG | JAVA

Lecture 2: Insert a node in Single Linked List | SPG | JAVA

Lecture 1: Introduction to Linked List | Linked List Series | SPG | Java

Lecture 1: Introduction to Linked List | Linked List Series | SPG | Java

Valid Anagram | Leetcode 242 | Hashing | Solved in 2 ways | Java | SPG

Valid Anagram | Leetcode 242 | Hashing | Solved in 2 ways | Java | SPG

Contains Duplicate | Leetcode 217 | Solved in 3 methods | Java | SPG

Contains Duplicate | Leetcode 217 | Solved in 3 methods | Java | SPG

HashCode and Equals Impact In Java | Why we need to override hashCode() and equals() | SPG

HashCode and Equals Impact In Java | Why we need to override hashCode() and equals() | SPG

Search Insert Position | Leetcode 35 | Binary Search Algorithm | Java | Shiva Prasad Gurram

Search Insert Position | Leetcode 35 | Binary Search Algorithm | Java | Shiva Prasad Gurram

Java 8 Stream API Interview Questions and Answers | Part - 2 | Shiva Prasad Gurram

Java 8 Stream API Interview Questions and Answers | Part - 2 | Shiva Prasad Gurram

Java 8 Stream API Interview Questions and Answers | Part - 1 | Shiva Prasad Gurram

Java 8 Stream API Interview Questions and Answers | Part - 1 | Shiva Prasad Gurram

Move Zeroes | Leetcode 283 | in-place algorithm | Java

Move Zeroes | Leetcode 283 | in-place algorithm | Java

Valid Parentheses String | Leetcode 20 | Stack | Java

Valid Parentheses String | Leetcode 20 | Stack | Java

Encode and Decode TinyURL | Leetcode 535 | Hashing | Java

Encode and Decode TinyURL | Leetcode 535 | Hashing | Java

Reverse String | Leetcode | In-place Algorithm | Recursion and Iteration methods | Java

Reverse String | Leetcode | In-place Algorithm | Recursion and Iteration methods | Java

Spring Boot CRUD Backend Application | JPA, H2 Database, Restful API | Shiva Prasad Gurram

Spring Boot CRUD Backend Application | JPA, H2 Database, Restful API | Shiva Prasad Gurram

Design Linked List | Leetcode | How to implement Singly Linked List in Java?

Design Linked List | Leetcode | How to implement Singly Linked List in Java?

Detect a Cycle in Linked List | Tortoise and the Hare algorithm | Java

Detect a Cycle in Linked List | Tortoise and the Hare algorithm | Java

Convert Java Object to JSON String | JSON String to Java Object | Jackson

Convert Java Object to JSON String | JSON String to Java Object | Jackson

Single number - Leetcode 136 - Solved using 3 approaches - Java

Single number - Leetcode 136 - Solved using 3 approaches - Java

Two Sum - Leetcode 1 - HashMap - Java

Two Sum - Leetcode 1 - HashMap - Java