32 results for “topic:stack-queue”
[WIP] The repository for revising and practicing data structures and algorithms. [TODO] move to practice with python
Data Structures and Algorithms (Checkout solutions and implementations of all the DS/Algos in this repository)
Data structure & Algorithm
This repository contains my solutions to various problems and my practice implementations of data structures and algorithms in Java.
For learning and development purpose
It's totally coding interview preparation repo, based on python programming language. Try to follow algorithm and data structure's best practice.
No description provided.
Practice problems with solutions for Data Structure.
LeetCode Practice👾👨💻
No description provided.
Data Structures and Algorithms
you can acknowledge this repository as an data structure course. in this repository all the data structure information are going to be published with proficient code and comments.
Stacks, Queues - LIFO, FIFO
Data Structure and Algorithm
🎁 A complete C++ implementation of Queue using two Stacks.
About 🏆🌟I solve the Problem of the Day on GeeksforGeeks daily 🗓️🧩 and have successfully tackled Love Babbar's 450 DSA sheet 📚 . My primary coding language is JAVA 💻, but I have also solved many problems in C++,Python ☕. 🏆🌟
Data Structures & Algorithms || Implemented in C++ || Part of My Learning Journey || Examples & Problem Solutions & Practice Codes.
Practice Algorithm CP
This repository consists of the data-structures and algorithms, I implemented for the lab course CSE204: Data Structures and Algorithm I Sessional.
This project solves the certain problems of Data Structures using Stacks and Queues.
This is a collection of various problem sets solved by the C programming language.
Data Structure Practice Problem
This highlights solving problems with using both stack and queue.
A repository to track my DSA (Data Structures and Algorithms) learning journey, including problems, solutions, and progress over time.
Given an array arr[ ] of size N having distinct elements, the task is to find the next greater element for each element of the array in order of their appearance in the array.
🎓 Subject: Data Structure - Technologist degree in System Analysis and Development at IFSP, São Carlos, SP, Brazil - Lecturer: Prof. Dr. Rodrigo Elias Bianchi
🧮 Infix-Postfix Calculator with Binary Tree Visualizer written in Java
CE2002B-資料結構
Simple Student Database using C
A code repo for code practices