#Circular Doubly Linked List | Explore Tumblr posts and blogs

nocodehackathon · 11 months ago

Text

Essential Algorithms and Data Structures for Competitive Programming

Competitive programming is a thrilling and intellectually stimulating field that challenges participants to solve complex problems efficiently and effectively. At its core, competitive programming revolves around algorithms and data structures—tools that help you tackle problems with precision and speed. If you're preparing for a competitive programming contest or just want to enhance your problem-solving skills, understanding essential algorithms and data structures is crucial. In this blog, we’ll walk through some of the most important ones you should be familiar with.

1. Arrays and Strings

Arrays are fundamental data structures that store elements in a contiguous block of memory. They allow for efficient access to elements via indexing and are often the first data structure you encounter in competitive programming.

Operations: Basic operations include traversal, insertion, deletion, and searching. Understanding how to manipulate arrays efficiently can help solve a wide range of problems.

Strings are arrays of characters and are often used to solve problems involving text processing. Basic string operations like concatenation, substring search, and pattern matching are essential.

2. Linked Lists

A linked list is a data structure where elements (nodes) are stored in separate memory locations and linked together using pointers. There are several types of linked lists:

Singly Linked List: Each node points to the next node.

Doubly Linked List: Each node points to both the next and previous nodes.

Circular Linked List: The last node points back to the first node.

Linked lists are useful when you need to frequently insert or delete elements as they allow for efficient manipulation of the data.

3. Stacks and Queues

Stacks and queues are abstract data types that operate on a last-in-first-out (LIFO) and first-in-first-out (FIFO) principle, respectively.

Stacks: Useful for problems involving backtracking or nested structures (e.g., parsing expressions).

Queues: Useful for problems involving scheduling or buffering (e.g., breadth-first search).

Both can be implemented using arrays or linked lists and are foundational for many algorithms.

4. Hashing

Hashing involves using a hash function to convert keys into indices in a hash table. This allows for efficient data retrieval and insertion.

Hash Tables: Hash tables provide average-case constant time complexity for search, insert, and delete operations.

Collisions: Handling collisions (when two keys hash to the same index) using techniques like chaining or open addressing is crucial for effective hashing.

5. Trees

Trees are hierarchical data structures with a root node and child nodes. They are used to represent hierarchical relationships and are key to many algorithms.

Binary Trees: Each node has at most two children. They are used in various applications such as binary search trees (BSTs), where the left child is less than the parent, and the right child is greater.

Binary Search Trees (BSTs): Useful for dynamic sets where elements need to be ordered. Operations like insertion, deletion, and search have an average-case time complexity of O(log n).

Balanced Trees: Trees like AVL trees and Red-Black trees maintain balance to ensure O(log n) time complexity for operations.

6. Heaps

A heap is a specialized tree-based data structure that satisfies the heap property:

Max-Heap: The value of each node is greater than or equal to the values of its children.

Min-Heap: The value of each node is less than or equal to the values of its children.

Heaps are used in algorithms like heap sort and are also crucial for implementing priority queues.

7. Graphs

Graphs represent relationships between entities using nodes (vertices) and edges. They are essential for solving problems involving networks, paths, and connectivity.

Graph Traversal: Algorithms like Breadth-First Search (BFS) and Depth-First Search (DFS) are used to explore nodes and edges in graphs.

Shortest Path: Algorithms such as Dijkstra’s and Floyd-Warshall help find the shortest path between nodes.

Minimum Spanning Tree: Algorithms like Kruskal’s and Prim’s are used to find the minimum spanning tree in a graph.

8. Dynamic Programming

Dynamic Programming (DP) is a method for solving problems by breaking them down into simpler subproblems and storing the results of these subproblems to avoid redundant computations.

Memoization: Storing results of subproblems to avoid recomputation.

Tabulation: Building a table of results iteratively, bottom-up.

DP is especially useful for optimization problems, such as finding the shortest path, longest common subsequence, or knapsack problem.

9. Greedy Algorithms

Greedy Algorithms make a series of choices, each of which looks best at the moment, with the hope that these local choices will lead to a global optimum.

Applications: Commonly used for problems like activity selection, Huffman coding, and coin change.

10. Graph Algorithms

Understanding graph algorithms is crucial for competitive programming:

Shortest Path Algorithms: Dijkstra’s Algorithm, Bellman-Ford Algorithm.

Minimum Spanning Tree Algorithms: Kruskal’s Algorithm, Prim’s Algorithm.

Network Flow Algorithms: Ford-Fulkerson Algorithm, Edmonds-Karp Algorithm.

Preparing for Competitive Programming: Summer Internship Program

If you're eager to dive deeper into these algorithms and data structures, participating in a summer internship program focused on Data Structures and Algorithms (DSA) can be incredibly beneficial. At our Summer Internship Program, we provide hands-on experience and mentorship to help you master these crucial skills. This program is designed for aspiring programmers who want to enhance their competitive programming abilities and prepare for real-world challenges.

What to Expect:

Hands-On Projects: Work on real-world problems and implement algorithms and data structures.

Mentorship: Receive guidance from experienced professionals in the field.

Workshops and Seminars: Participate in workshops that cover advanced topics and techniques.

Networking Opportunities: Connect with peers and industry experts to expand your professional network.

By participating in our DSA Internship, you’ll gain practical experience and insights that will significantly boost your competitive programming skills and prepare you for success in contests and future career opportunities.

In conclusion, mastering essential algorithms and data structures is key to excelling in competitive programming. By understanding and practicing these concepts, you can tackle complex problems with confidence and efficiency. Whether you’re just starting out or looking to sharpen your skills, focusing on these fundamentals will set you on the path to success.

Ready to take your skills to the next level? Join our Summer Internship Program and dive into the world of algorithms and data structures with expert guidance and hands-on experience. Your journey to becoming a competitive programming expert starts here!

#DSA Internship

0 notes

myprogrammingsolver · 1 year ago

Text

Doubly-linked Circular List in C

[ This content is protected and may not be shared, uploaded, or distributed. ] This spec is private (i.e., only for students who took or are taking CSCI 402 at USC).0You do not have permissions to display this spec at a public place (such as a public bitbucket/github).0You also do not have permissions to display the code you write to implementation this spec at a public place0since your code was…

View On WordPress

0 notes

tutort-academy · 2 years ago

Text

How to Ace Your DSA Interview, Even If You're a Newbie

Are you aiming to crack DSA interviews and land your dream job as a software engineer or developer? Look no further! This comprehensive guide will provide you with all the necessary tips and insights to ace your DSA interviews. We'll explore the important DSA topics to study, share valuable preparation tips, and even introduce you to Tutort Academy DSA courses to help you get started on your journey. So let's dive in!

Why is DSA Important?

Before we delve into the specifics of DSA interviews, let's first understand why data structures and algorithms are crucial for software development. DSA plays a vital role in optimizing software components, enabling efficient data storage and processing.

From logging into your Facebook account to finding the shortest route on Google Maps, DSA is at work in various applications we use every day. Mastering DSA allows you to solve complex problems, optimize code performance, and design efficient software systems.

Important DSA Topics to Study

To excel in DSA interviews, it's essential to have a strong foundation in key topics. Here are some important DSA topics you should study:

1. Arrays and Strings

Arrays and strings are fundamental data structures in programming. Understanding array manipulation, string operations, and common algorithms like sorting and searching is crucial for solving coding problems.

2. Linked Lists

Linked lists are linear data structures that consist of nodes linked together. It's important to understand concepts like singly linked lists, doubly linked lists, and circular linked lists, as well as operations like insertion, deletion, and traversal.

3. Stacks and Queues

Stacks and queues are abstract data types that follow specific orderings. Mastering concepts like LIFO (Last In, First Out) for stacks and FIFO (First In, First Out) for queues is essential. Additionally, learn about their applications in real-life scenarios.

4. Trees and Binary Trees

Trees are hierarchical data structures with nodes connected by edges. Understanding binary trees, binary search trees, and traversal algorithms like preorder, inorder, and postorder is crucial. Additionally, explore advanced concepts like AVL trees and red-black trees.

5. Graphs

Graphs are non-linear data structures consisting of nodes (vertices) and edges. Familiarize yourself with graph representations, traversal algorithms like BFS (Breadth-First Search) and DFS (Depth-First Search), and graph algorithms such as Dijkstra's algorithm and Kruskal's algorithm.

6. Sorting and Searching Algorithms

Understanding various sorting algorithms like bubble sort, selection sort, insertion sort, merge sort, and quicksort is essential. Additionally, familiarize yourself with searching algorithms like linear search, binary search, and hash-based searching.

7. Dynamic Programming

Dynamic programming involves breaking down a complex problem into smaller overlapping subproblems and solving them individually. Mastering this technique allows you to solve optimization problems efficiently.

These are just a few of the important DSA topics to study. It's crucial to have a solid understanding of these concepts and their applications to perform well in DSA interviews.

Tips to Follow While Preparing for DSA Interviews

Preparing for DSA interviews can be challenging, but with the right approach, you can maximize your chances of success. Here are some tips to keep in mind:

1. Understand the Fundamentals

Before diving into complex algorithms, ensure you have a strong grasp of the fundamentals. Familiarize yourself with basic data structures, common algorithms, and time and space complexities.

2. Practice Regularly

Consistent practice is key to mastering DSA. Solve a wide range of coding problems, participate in coding challenges, and implement algorithms from scratch. Leverage online coding platforms like LeetCode, HackerRank to practice and improve your problem-solving skills.

3. Analyze and Optimize

After solving a problem, analyze your solution and look for areas of improvement. Optimize your code for better time and space complexities. This demonstrates your ability to write efficient and scalable code.

4. Collaborate and Learn from Others

Engage with the coding community, join study groups, and participate in online forums. Collaborating with others allows you to learn different approaches, gain insights, and improve your problem-solving skills.

5. Mock Interviews and Feedback

Simulate real interview scenarios by participating in mock interviews. Seek feedback from experienced professionals or mentors who can provide valuable insights into your strengths and areas for improvement.

Following these tips will help you build a solid foundation in DSA and boost your confidence for interviews.

Conclusion

Mastering DSA is crucial for acing coding interviews and securing your dream job as a software engineer or developer. By studying important DSA topics, following effective preparation tips, and leveraging Tutort Academy's DSA courses, you'll be well-equipped to tackle DSA interviews with confidence. Remember to practice regularly, seek feedback, and stay curious.

Good luck on your DSA journey!

#programming #tutortacademy #tutort #DSA #data structures #data structures and algorithms #algorithm #interview preparation #interview tips

0 notes

c-official · 2 months ago

Text

How can i say no to a :3 request. Basically a Fibonacci heap is a super Priority queue. It supports the following operations

Insert: Insert a number in O(1) time.

GetMin: Get the lowest number in he heap in O(1) time.

DeleteMin: Remove the lowest number in the heap in amortized O(log(n)) time. Here n refers to the amount of values in the heap.

DecreaseKey: Decrease one of the values in the heap in amortized O(1) time.

Merge: Merge two Fibonacci heaps in O(1) time.

Now for the implementation. The heap is stored as a collection of rooted trees such that child notes hold larger values than their parent, and the heap also keeps track of which root has the lowest value.

Insert: To insert a value simply add a new tree of one element and update the pointer to the lowest root if necessary. This is clearly constant time.

GetMin: We already have a pointer to the root with the lowest value so just return that value. This is clearly also constant time.

Merge: Simply merge the collections of roots from the two heaps and set the pointer to the lowest root to the lowest of the two lowest roots. This can be done in constant time if the collections of roots are stored as circular doubly linked lists.

DeleteMin: First remove the lowest root and add its children as new roots. Now this is where things get interesting. Establish a hashmap. Now scan through the roots and put them in the hashmap by their degree(aka the amount of children they have). If their is already a node with the same degree merge that node with the current one by adding the one with the highest value as a child of the other. By the end of this process the highest degree of root node should be higher or equal than the amount of roots. We will write this important fact as #roots <= #maxDegree. While this scan is done find the new lowest value root. This clearly runs in O(#roots) time. This is not O(log n) as i promised but we will return to this.

DecreaseKey: Decrease the value of the desired key. If the value is still larger than the parents value all is well. Otherwise remove the node from the parent and add is as a new root. Mark the parent. If the parent is already marked do the same procedure of removing the parent, adding it as a new root at mark its parent. Do not mark the parent if it is a root and remove the mark when making a node a new root. This way a root will never be marked.

The whole marked thing sounds complicated but the only thing it does is keeping the restriction that no non root node can have removed more that one child. This is again not constant time and can run in O(#maxDepth) if the nodes parent is marked, the parent's parent is marked and so on up to a root.

This will be a good place to explain what amortized running time is. The point is that we will not consider the worst case, but the worst case average of a series of instructions. So lets keep track of some potential work. Now when you make a DecreaseKey add a token that represents some constant time work you could do now to a pile. As we mark at most one node per operation we know that #potentialWorkDone >= #markedNodes. Now that we know this, each time we move a marked node to be a new root instead of counting the time that took discard one token of potential work. We still unmark the node so the previous inequality still holds. This we will always have a token of potential work when moving a marked node to be a new node. So on each operation we did some constant time work and some constant time potential work. This is amortized O(1).

Now it is just the DeleteMin runtime that needs to be explained and why fibonacci numbers are relevant.

Instaed of looking at #roots. Lets write #roots = #coreRoots+#extraRoots where a core root is a root left after a DeleteMin operation. Thus it is always true that #coreRoots<=#maxDegree. Now we can do the same trick. Each time we add a new root from Insert or DecreaseKey add a token of potential work and each time we handle an extra root in the DeleteMin operation remove a token of potential work. Thus after each DeleteMin operation no tokens of potential work and no extra roots are left. Now DeleteMin runs in amortized O(#coreRoots)=O(#maxDegree) time.

So why is #maxDegre=O(log(n)). The main claim is that given a tree with a root of degree d then the amount of nodes in that tree is at least F_d the d'th Fibonacci number.

To prove this the Fibonacci numbers are screaming to do it inductively. So for a degree 0 tree the minimum amount of nodes is clearly the one node. A degree 1 tree has per definition a child and thus has at least 2 nodes. Now assume that the minimum tree with a root of degree m has at least F_m nodes for all m less than some n. Now look at a tree where the root has degree n. The newest node got added to the tree when it had at least n-1 nodes and because we only merge trees of the same root degree the newest root must have degree at least n-2 because it could have lost a child. Thus the newest child's subtree has at leas size F_(n-2) and before the newest child was added the tree must have had at least F_(n-1) nodes. Thus the tree now has at least size F_(n-2)+F_(n-1)=F_n proving the claim.

But because the Fibonacci numbers grow exponentially we get that #maxDegre=O(log(n)). Pure magic!

Side note, this can not get any quicker. If it could we could sort a list by adding all of our values to our data structure and then running GetMin and DeleteMin until it is empty which would result in less that O(n log n) operations if DeleteMin was quicker than O(log n) and the other operations where constant time.

A better explanation with animations can be found here. And also general shout out to that video for introducing me to the subject.

I just discovered fibonachi heaps! That is some top tier stuff and has left me craving my next big hit. So please, i am in dire need off beutifull algorithms and datastructures.

#c-official #Fibonacci heaps explained #Truly a beautiful data structure #explaining computer science

41 notes · View notes

allcprogrammingandalgorithm · 6 years ago

Link

#include<stdio.h> void main (){ printf("\n\n\t\t\t*******************************"); printf("\n\t\t\t* *"); printf("\n\t\t\t* hello World *"); printf("\n\t\t\t* *"); printf("\n\t\t\t*********************************\n");} output:- Hello World

1 note · View note

sweetswesf · 3 years ago

Text

Check In

What I Did Today

TOO much social media & online videos

Successfully fought the urge to get a new IG

Assigned people in my professional engineering squad their secret santa recipients

Fought urge to order out & actually ate what I had in my kitchen

Watched an AlgoExpert video

Got some sun & grocery shopped

Saw the girl who invited me to an event held by the only dudes I have slept with (one of whom is now engaged) was let go by sadi dudes; I offered her support and tried to relate without being like "I HATE THOSE GUYS TOO"...she kinda gave me a weird response...immediately regretted reaching out...seconds later, one of the said damn dudes reached out to invite me! I wanted to say, "So we just gone act like it never happened huh!?"...I don't know what to respond with...part of me is like, "let it go," the other part of me is like UGHHHH why can't I escape this!? I mean I could if I blocked them...I guess a part of me wants them to feel bad for what they did or apologize, which I know, from history, they'll never do...I could also just meet someone else there but idk...I've NEVER met anyone of promise at any of these stupid mixing events...I just always leave with a weird encounter...

Rented Alice & Wonderland...I've been trying to watch it for years...I may watch it in my "downtime" this week

First meeting w/my new therapist

Bought a gift for my secret santa recipient

My literal thought process ALL...DAY...LONG...: "Eat, then hop into work...okay maybe just watch a video...okay, one more and then get to it...okay, at least sit a the desk...*goes to YouTube, Twitter, etc.*...okay, find that series you like to watch...okay one more Great British Baking Show episode...what if you get tired while you're working...what if you're too cold...what if the heater is making you tired...okay meal time again...okay try to start again...*watches more vidoes*...what if I'm too old...what if I should try something else out...man I wish I had more fam support...what if I don't need to study this crap...am losing all the progress I've been building...UGH! get to work...will I be single forever...all these layoffs, if they don't have it, they'll be sure I don't get it...oh shoot...it's time to meet for the study group soon...you can't work, just start tomorrow...okay, it's after 7:30 PM, at least try to knock this one lesson out since she's doing it too, you don't want to be embarrassed again...should I work out tomorrow or just make up for lost time today..."

Added website blocker & time limits back to my desktop & phone

What I Learned Today

Linked lists...including doubly, circular, and doubly circular linked lists

Feeling

This staying focused thing is harder than I thought it would be...I need to build a bit more discipline

Fat

Apparently not scared enough to study as hard as I need to

Slightly paranoid about being vulnerable to YET another person who may not handle my feelings the way I need them to

Proud I did not NEED a nap today

Can y'all pray for me, please

Takeaways

I'm going to get there

I need to get up & move more during my day

I really appreciate the friend that took me out to Black Panther, suggested we start doing a bake exchange, and, today, encouraged me by telling me in our study session that she'd watch the same video I set out to watch...I wasn't going to do it, but that added pressure was just enough pressure I needed to do it today...mind you, she's going through a stressful time...we both are, but we are confiding in each other, helping each other along, and I am grateful...as someone who has been losing people left & right, I am grateful

How I Got Myself Out of a Rut Today

Confiding in a friend

Trying new creations

FINALLY finding a site that streams full episodes of the series that got me interested in Netflix in the first place years ago, The World's Most Extraordinary Homes...looking at that, I said, "Why NOT me!?"...then recommenced procrastinating for hours after that, but, it did get me up...I'm going to live in something like this one day:

youtube

Goals Completed

Found a therapist

Stopped listening to people worried about their own circumstances and remembering God works on his own time and that I am in no rush...

Got back on the ball

Being kinder to myself and stopping guilting myself if my energy isn't always on 100%

Goals After Today

Strengthen my relationship with God

Understand the main concepts I need to from Interview Cake, AlgoExpert, etc. in 6 months, NOT less than 3

Drop my body fat percentage to Marion Jones, Michaela Cole, or Jade Cargill levels

Consistently fight urge to fill up my time with social media/YouTube

Fully forgive my family & build a great relationship with them

Be more confident & faithful

250 steps/hour & 10k steps/daily consistently

Drink more than 64oz a day consistently

Go on a date with a guy I actually like who actually likes me too

1 note · View note

courseforfree · 4 years ago

Link

Data Structures and Algorithms from Zero to Hero and Crack Top Companies 100+ Interview questions (Java Coding)

What you’ll learn

Java Data Structures and Algorithms Masterclass

Learn, implement, and use different Data Structures

Learn, implement and use different Algorithms

Become a better developer by mastering computer science fundamentals

Learn everything you need to ace difficult coding interviews

Cracking the Coding Interview with 100+ questions with explanations

Time and Space Complexity of Data Structures and Algorithms

Recursion

Big O

Dynamic Programming

Divide and Conquer Algorithms

Graph Algorithms

Greedy Algorithms

Requirements

Basic Java Programming skills

Description

Welcome to the Java Data Structures and Algorithms Masterclass, the most modern, and the most complete Data Structures and Algorithms in Java course on the internet.

At 44+ hours, this is the most comprehensive course online to help you ace your coding interviews and learn about Data Structures and Algorithms in Java. You will see 100+ Interview Questions done at the top technology companies such as Apple, Amazon, Google, and Microsoft and how-to face Interviews with comprehensive visual explanatory video materials which will bring you closer to landing the tech job of your dreams!

Learning Java is one of the fastest ways to improve your career prospects as it is one of the most in-demand tech skills! This course will help you in better understanding every detail of Data Structures and how algorithms are implemented in high-level programming languages.

We’ll take you step-by-step through engaging video tutorials and teach you everything you need to succeed as a professional programmer.

After finishing this course, you will be able to:

Learn basic algorithmic techniques such as greedy algorithms, binary search, sorting, and dynamic programming to solve programming challenges.

Learn the strengths and weaknesses of a variety of data structures, so you can choose the best data structure for your data and applications

Learn many of the algorithms commonly used to sort data, so your applications will perform efficiently when sorting large datasets

Learn how to apply graph and string algorithms to solve real-world challenges: finding shortest paths on huge maps and assembling genomes from millions of pieces.

Why this course is so special and different from any other resource available online?

This course will take you from the very beginning to very complex and advanced topics in understanding Data Structures and Algorithms!

You will get video lectures explaining concepts clearly with comprehensive visual explanations throughout the course.

You will also see Interview Questions done at the top technology companies such as Apple, Amazon, Google, and Microsoft.

I cover everything you need to know about the technical interview process!

So whether you are interested in learning the top programming language in the world in-depth and interested in learning the fundamental Algorithms, Data Structures, and performance analysis that make up the core foundational skillset of every accomplished programmer/designer or software architect and is excited to ace your next technical interview this is the course for you!

And this is what you get by signing up today:

Lifetime access to 44+ hours of HD quality videos. No monthly subscription. Learn at your own pace, whenever you want

Friendly and fast support in the course Q&A whenever you have questions or get stuck

FULL money-back guarantee for 30 days!

This course is designed to help you to achieve your career goals. Whether you are looking to get more into Data Structures and Algorithms, increase your earning potential, or just want a job with more freedom, this is the right course for you!

The topics that are covered in this course.

Section 1 – Introduction

What are Data Structures?

What is an algorithm?

Why are Data Structures And Algorithms important?

Types of Data Structures

Types of Algorithms

Section 2 – Recursion

What is Recursion?

Why do we need recursion?

How does Recursion work?

Recursive vs Iterative Solutions

When to use/avoid Recursion?

How to write Recursion in 3 steps?

How to find Fibonacci numbers using Recursion?

Section 3 – Cracking Recursion Interview Questions

Question 1 – Sum of Digits

Question 2 – Power

Question 3 – Greatest Common Divisor

Question 4 – Decimal To Binary

Section 4 – Bonus CHALLENGING Recursion Problems (Exercises)

power

factorial

products array

recursiveRange

fib

reverse

palindrome

some recursive

flatten

capitalize first

nestedEvenSum

capitalize words

stringifyNumbers

collects things

Section 5 – Big O Notation

Analogy and Time Complexity

Big O, Big Theta, and Big Omega

Time complexity examples

Space Complexity

Drop the Constants and the nondominant terms

Add vs Multiply

How to measure the codes using Big O?

How to find time complexity for Recursive calls?

How to measure Recursive Algorithms that make multiple calls?

Section 6 – Top 10 Big O Interview Questions (Amazon, Facebook, Apple, and Microsoft)

Product and Sum

Print Pairs

Print Unordered Pairs

Print Unordered Pairs 2 Arrays

Print Unordered Pairs 2 Arrays 100000 Units

Reverse

O(N) Equivalents

Factorial Complexity

Fibonacci Complexity

Powers of 2

Section 7 – Arrays

What is an Array?

Types of Array

Arrays in Memory

Create an Array

Insertion Operation

Traversal Operation

Accessing an element of Array

Searching for an element in Array

Deleting an element from Array

Time and Space complexity of One Dimensional Array

One Dimensional Array Practice

Create Two Dimensional Array

Insertion – Two Dimensional Array

Accessing an element of Two Dimensional Array

Traversal – Two Dimensional Array

Searching for an element in Two Dimensional Array

Deletion – Two Dimensional Array

Time and Space complexity of Two Dimensional Array

When to use/avoid array

Section 8 – Cracking Array Interview Questions (Amazon, Facebook, Apple, and Microsoft)

Question 1 – Missing Number

Question 2 – Pairs

Question 3 – Finding a number in an Array

Question 4 – Max product of two int

Question 5 – Is Unique

Question 6 – Permutation

Question 7 – Rotate Matrix

Section 9 – CHALLENGING Array Problems (Exercises)

Middle Function

2D Lists

Best Score

Missing Number

Duplicate Number

Pairs

Section 10 – Linked List

What is a Linked List?

Linked List vs Arrays

Types of Linked List

Linked List in the Memory

Creation of Singly Linked List

Insertion in Singly Linked List in Memory

Insertion in Singly Linked List Algorithm

Insertion Method in Singly Linked List

Traversal of Singly Linked List

Search for a value in Single Linked List

Deletion of a node from Singly Linked List

Deletion Method in Singly Linked List

Deletion of entire Singly Linked List

Time and Space Complexity of Singly Linked List

Section 11 – Circular Singly Linked List

Creation of Circular Singly Linked List

Insertion in Circular Singly Linked List

Insertion Algorithm in Circular Singly Linked List

Insertion method in Circular Singly Linked List

Traversal of Circular Singly Linked List

Searching a node in Circular Singly Linked List

Deletion of a node from Circular Singly Linked List

Deletion Algorithm in Circular Singly Linked List

A method in Circular Singly Linked List

Deletion of entire Circular Singly Linked List

Time and Space Complexity of Circular Singly Linked List

Section 12 – Doubly Linked List

Creation of Doubly Linked List

Insertion in Doubly Linked List

Insertion Algorithm in Doubly Linked List

Insertion Method in Doubly Linked List

Traversal of Doubly Linked List

Reverse Traversal of Doubly Linked List

Searching for a node in Doubly Linked List

Deletion of a node in Doubly Linked List

Deletion Algorithm in Doubly Linked List

Deletion Method in Doubly Linked List

Deletion of entire Doubly Linked List

Time and Space Complexity of Doubly Linked List

Section 13 – Circular Doubly Linked List

Creation of Circular Doubly Linked List

Insertion in Circular Doubly Linked List

Insertion Algorithm in Circular Doubly Linked List

Insertion Method in Circular Doubly Linked List

Traversal of Circular Doubly Linked List

Reverse Traversal of Circular Doubly Linked List

Search for a node in Circular Doubly Linked List

Delete a node from Circular Doubly Linked List

Deletion Algorithm in Circular Doubly Linked List

Deletion Method in Circular Doubly Linked List

Entire Circular Doubly Linked List

Time and Space Complexity of Circular Doubly Linked List

Time Complexity of Linked List vs Arrays

Section 14 – Cracking Linked List Interview Questions (Amazon, Facebook, Apple, and Microsoft)

Linked List Class

Question 1 – Remove Dups

Question 2 – Return Kth to Last

Question 3 – Partition

Question 4 – Sum Linked Lists

Question 5 – Intersection

Section 15 – Stack

What is a Stack?

What and Why of Stack?

Stack Operations

Stack using Array vs Linked List

Stack Operations using Array (Create, isEmpty, isFull)

Stack Operations using Array (Push, Pop, Peek, Delete)

Time and Space Complexity of Stack using Array

Stack Operations using Linked List

Stack methods – Push, Pop, Peek, Delete, and isEmpty using Linked List

Time and Space Complexity of Stack using Linked List

When to Use/Avoid Stack

Stack Quiz

Section 16 – Queue

What is a Queue?

Linear Queue Operations using Array

Create, isFull, isEmpty, and enQueue methods using Linear Queue Array

Dequeue, Peek and Delete Methods using Linear Queue Array

Time and Space Complexity of Linear Queue using Array

Why Circular Queue?

Circular Queue Operations using Array

Create, Enqueue, isFull and isEmpty Methods in Circular Queue using Array

Dequeue, Peek and Delete Methods in Circular Queue using Array

Time and Space Complexity of Circular Queue using Array

Queue Operations using Linked List

Create, Enqueue and isEmpty Methods in Queue using Linked List

Dequeue, Peek and Delete Methods in Queue using Linked List

Time and Space Complexity of Queue using Linked List

Array vs Linked List Implementation

When to Use/Avoid Queue?

Section 17 – Cracking Stack and Queue Interview Questions (Amazon, Facebook, Apple, Microsoft)

Question 1 – Three in One

Question 2 – Stack Minimum

Question 3 – Stack of Plates

Question 4 – Queue via Stacks

Question 5 – Animal Shelter

Section 18 – Tree / Binary Tree

What is a Tree?

Why Tree?

Tree Terminology

How to create a basic tree in Java?

Binary Tree

Types of Binary Tree

Binary Tree Representation

Create Binary Tree (Linked List)

PreOrder Traversal Binary Tree (Linked List)

InOrder Traversal Binary Tree (Linked List)

PostOrder Traversal Binary Tree (Linked List)

LevelOrder Traversal Binary Tree (Linked List)

Searching for a node in Binary Tree (Linked List)

Inserting a node in Binary Tree (Linked List)

Delete a node from Binary Tree (Linked List)

Delete entire Binary Tree (Linked List)

Create Binary Tree (Array)

Insert a value Binary Tree (Array)

Search for a node in Binary Tree (Array)

PreOrder Traversal Binary Tree (Array)

InOrder Traversal Binary Tree (Array)

PostOrder Traversal Binary Tree (Array)

Level Order Traversal Binary Tree (Array)

Delete a node from Binary Tree (Array)

Entire Binary Tree (Array)

Linked List vs Python List Binary Tree

Section 19 – Binary Search Tree

What is a Binary Search Tree? Why do we need it?

Create a Binary Search Tree

Insert a node to BST

Traverse BST

Search in BST

Delete a node from BST

Delete entire BST

Time and Space complexity of BST

Section 20 – AVL Tree

What is an AVL Tree?

Why AVL Tree?

Common Operations on AVL Trees

Insert a node in AVL (Left Left Condition)

Insert a node in AVL (Left-Right Condition)

Insert a node in AVL (Right Right Condition)

Insert a node in AVL (Right Left Condition)

Insert a node in AVL (all together)

Insert a node in AVL (method)

Delete a node from AVL (LL, LR, RR, RL)

Delete a node from AVL (all together)

Delete a node from AVL (method)

Delete entire AVL

Time and Space complexity of AVL Tree

Section 21 – Binary Heap

What is Binary Heap? Why do we need it?

Common operations (Creation, Peek, sizeofheap) on Binary Heap

Insert a node in Binary Heap

Extract a node from Binary Heap

Delete entire Binary Heap

Time and space complexity of Binary Heap

Section 22 – Trie

What is a Trie? Why do we need it?

Common Operations on Trie (Creation)

Insert a string in Trie

Search for a string in Trie

Delete a string from Trie

Practical use of Trie

Section 23 – Hashing

What is Hashing? Why do we need it?

Hashing Terminology

Hash Functions

Types of Collision Resolution Techniques

Hash Table is Full

Pros and Cons of Resolution Techniques

Practical Use of Hashing

Hashing vs Other Data structures

Section 24 – Sort Algorithms

What is Sorting?

Types of Sorting

Sorting Terminologies

Bubble Sort

Selection Sort

Insertion Sort

Bucket Sort

Merge Sort

Quick Sort

Heap Sort

Comparison of Sorting Algorithms

Section 25 – Searching Algorithms

Introduction to Searching Algorithms

Linear Search

Linear Search in Python

Binary Search

Binary Search in Python

Time Complexity of Binary Search

Section 26 – Graph Algorithms

What is a Graph? Why Graph?

Graph Terminology

Types of Graph

Graph Representation

The graph in Java using Adjacency Matrix

The graph in Java using Adjacency List

Section 27 – Graph Traversal

Breadth-First Search Algorithm (BFS)

Breadth-First Search Algorithm (BFS) in Java – Adjacency Matrix

Breadth-First Search Algorithm (BFS) in Java – Adjacency List

Time Complexity of Breadth-First Search (BFS) Algorithm

Depth First Search (DFS) Algorithm

Depth First Search (DFS) Algorithm in Java – Adjacency List

Depth First Search (DFS) Algorithm in Java – Adjacency Matrix

Time Complexity of Depth First Search (DFS) Algorithm

BFS Traversal vs DFS Traversal

Section 28 – Topological Sort

What is Topological Sort?

Topological Sort Algorithm

Topological Sort using Adjacency List

Topological Sort using Adjacency Matrix

Time and Space Complexity of Topological Sort

Section 29 – Single Source Shortest Path Problem

what is Single Source Shortest Path Problem?

Breadth-First Search (BFS) for Single Source Shortest Path Problem (SSSPP)

BFS for SSSPP in Java using Adjacency List

BFS for SSSPP in Java using Adjacency Matrix

Time and Space Complexity of BFS for SSSPP

Why does BFS not work with Weighted Graph?

Why does DFS not work for SSSP?

Section 30 – Dijkstra’s Algorithm

Dijkstra’s Algorithm for SSSPP

Dijkstra’s Algorithm in Java – 1

Dijkstra’s Algorithm in Java – 2

Dijkstra’s Algorithm with Negative Cycle

Section 31 – Bellman-Ford Algorithm

Bellman-Ford Algorithm

Bellman-Ford Algorithm with negative cycle

Why does Bellman-Ford run V-1 times?

Bellman-Ford in Python

BFS vs Dijkstra vs Bellman Ford

Section 32 – All Pairs Shortest Path Problem

All pairs shortest path problem

Dry run for All pair shortest path

Section 33 – Floyd Warshall

Floyd Warshall Algorithm

Why Floyd Warshall?

Floyd Warshall with negative cycle,

Floyd Warshall in Java,

BFS vs Dijkstra vs Bellman Ford vs Floyd Warshall,

Section 34 – Minimum Spanning Tree

Minimum Spanning Tree,

Disjoint Set,

Disjoint Set in Java,

Section 35 – Kruskal’s and Prim’s Algorithms

Kruskal Algorithm,

Kruskal Algorithm in Python,

Prim’s Algorithm,

Prim’s Algorithm in Python,

Prim’s vs Kruskal

Section 36 – Cracking Graph and Tree Interview Questions (Amazon, Facebook, Apple, Microsoft)

Section 37 – Greedy Algorithms

What is a Greedy Algorithm?

Well known Greedy Algorithms

Activity Selection Problem

Activity Selection Problem in Python

Coin Change Problem

Coin Change Problem in Python

Fractional Knapsack Problem

Fractional Knapsack Problem in Python

Section 38 – Divide and Conquer Algorithms

What is a Divide and Conquer Algorithm?

Common Divide and Conquer algorithms

How to solve the Fibonacci series using the Divide and Conquer approach?

Number Factor

Number Factor in Java

House Robber

House Robber Problem in Java

Convert one string to another

Convert One String to another in Java

Zero One Knapsack problem

Zero One Knapsack problem in Java

Longest Common Sequence Problem

Longest Common Subsequence in Java

Longest Palindromic Subsequence Problem

Longest Palindromic Subsequence in Java

Minimum cost to reach the Last cell problem

Minimum Cost to reach the Last Cell in 2D array using Java

Number of Ways to reach the Last Cell with given Cost

Number of Ways to reach the Last Cell with given Cost in Java

Section 39 – Dynamic Programming

What is Dynamic Programming? (Overlapping property)

Where does the name of DC come from?

Top-Down with Memoization

Bottom-Up with Tabulation

Top-Down vs Bottom Up

Is Merge Sort Dynamic Programming?

Number Factor Problem using Dynamic Programming

Number Factor: Top-Down and Bottom-Up

House Robber Problem using Dynamic Programming

House Robber: Top-Down and Bottom-Up

Convert one string to another using Dynamic Programming

Convert String using Bottom Up

Zero One Knapsack using Dynamic Programming

Zero One Knapsack – Top Down

Zero One Knapsack – Bottom Up

Section 40 – CHALLENGING Dynamic Programming Problems

Longest repeated Subsequence Length problem

Longest Common Subsequence Length problem

Longest Common Subsequence problem

Diff Utility

Shortest Common Subsequence problem

Length of Longest Palindromic Subsequence

Subset Sum Problem

Egg Dropping Puzzle

Maximum Length Chain of Pairs

Section 41 – A Recipe for Problem Solving

Introduction

Step 1 – Understand the problem

Step 2 – Examples

Step 3 – Break it Down

Step 4 – Solve or Simplify

Step 5 – Look Back and Refactor

Section 41 – Wild West

Download

To download more paid courses for free visit course catalog where 1000+ paid courses available for free. You can get the full course into your device with just a single click. Follow the link above to download this course for free.

3 notes · View notes