If you are a newbie in coding and wanna do CP then first solve this DSA question then move to cp..it will surely gonna help u clear the concepts. and get better at cp.

Tips for improvement, resources, DSA, math, verdicts, time complexity, ratings, contest, interesting things

Udemy-Java-Data-Structures-Algorithms course with LEETCODE Exercises

Exercises of Coding Ninjas Java DSA

C# Solutions for Algorithm Style Programming Questions found on LeetCode

Resource place for lecture notes, quizzes, assignments, internal exams etc. for DAA course under VTU

Coding Interviews are such an important thing in a programmer’s life that he just can’t get away with that.I am going to share with you top 500 coding interview problems from programming job interviews which every programmer should know.

Big O Cheat Sheet in Bahasa 🇮🇩

All coding solutions will be uploaded here time to time

Time complexity optimization in Python

documenting my journey of learning DSA

⚠️💀 Repository of Problems 💀⚠️ - Enter if you dare! Stay away if you value peace 🕊️ and sanity 🌀

This repository is a comprehensive collection of Data Structures and Algorithms (DSA) programs implemented in Java. Each major topic in DSA has its dedicated subfolder, referred to as a ‘set’. Each ‘set’ encapsulates 10-12 specific DSA programs related to the overarching topic.

BigOCheatShit - Cheat Sheet for Big-O Notation, Data Structures and Algorithms

This repository contains implementations of various data structures and algorithms

Config files for my GitHub profile.

A collection of search, sorting, graph, greedy, and optimization algorithms implemented in C++ and Python, including Binary Search, BFS, Dijkstra's Algorithm, Bubble Sort, and the Four Color Theorem. 🚀

Big O Notation Explained ( Time Complexity & Space Complexity )

This application contains a set of examples for all mayor linear algebraic algorithms. Within the source code there are definitions and complex descriptions to the different aspects of computing bidimentional arrays of any size. This project focuses in computing systems of equations of nxn size.