LeetCode

This repository contains all the solutions of the leetcode problems which I have done in C++ and Java.

LeetCode is a popular online platform for coding enthusiasts to enhance their skills by solving coding challenges. It offers a vast collection of problems ranging from simple to complex, covering various topics such as algorithms, data structures, databases, and shell scripting. LeetCode is widely used by developers to prepare for technical interviews at top companies.

Visit LeetCode: LeetCode

Space and Time Complexity

Time Complexity

Time complexity refers to the amount of time taken by an algorithm to run as a function of the length of the input. It helps in evaluating the efficiency of an algorithm and predicting its performance.

Space Complexity

Space complexity refers to the amount of memory an algorithm uses as a function of the length of the input. It includes both the memory needed for the input as well as the auxiliary space or temporary space used by the algorithm.

Big-O Notation

Big-O notation is a mathematical representation used to describe the upper limit of an algorithm's time or space complexity. Common Big-O notations include:

O(1): Constant time complexity
O(log n): Logarithmic time complexity
O(n): Linear time complexity
O(n log n): Linearithmic time complexity
O(n^2): Quadratic time complexity
O(2^n): Exponential time complexity

Comparison of C++, Java, and Python for Data Structures and Algorithms (DSA)

C++

Performance: C++ is known for its high performance and low-level memory manipulation capabilities, making it ideal for competitive programming and scenarios requiring efficient memory usage.
Standard Template Library (STL): Provides a rich set of data structures and algorithms, which simplifies implementation.
Compile-time: C++ is a compiled language, leading to faster execution times.

Java

Ease of Use: Java has a more straightforward syntax compared to C++ and includes automatic garbage collection, reducing the risk of memory leaks.
Java Collections Framework (JCF): Offers a comprehensive set of data structures and algorithms that are highly optimized.
Portability: Java programs run on the Java Virtual Machine (JVM), making them platform-independent.

Python

Simplicity: Python's syntax is clean and easy to understand, which makes it a preferred choice for beginners and rapid development.
Built-in Data Structures: Python has powerful built-in data structures like lists, dictionaries, and sets, which can be used directly without the need for additional libraries.
Interpreted Language: Python is an interpreted language, which makes it slower compared to C++ and Java. However, its ease of use often outweighs the performance drawbacks for many applications.

Summary

Feature	C++	Java	Python
Performance	High	Moderate	Low
Library Support	STL	JCF	Built-in data structures
Syntax	Complex	Moderate	Simple
Memory Management	Manual	Automatic (Garbage Collection)	Automatic (Garbage Collection)
Platform Independence	Limited	High (JVM)	High (Interpreted)
Development Speed	Moderate	High	Very High

Each language has its strengths and is suited to different types of problems and development environments. The choice of language often depends on specific use cases, performance requirements, and personal or organizational preferences.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

LeetCode

Space and Time Complexity

Time Complexity

Space Complexity

Big-O Notation

Comparison of C++, Java, and Python for Data Structures and Algorithms (DSA)

C++

Java

Python

Summary

About

Releases

Packages

Contributors 2

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 415 Commits
#1 Two Sum.cpp		#1 Two Sum.cpp
#1002 Find Common Characters.cpp		#1002 Find Common Characters.cpp
#1008 Construct Binary Search Tree from Preorder Traversal.cpp		#1008 Construct Binary Search Tree from Preorder Traversal.cpp
#1019 Next Greater Node In Linked List.cpp		#1019 Next Greater Node In Linked List.cpp
#102 Binary Tree Level Order Traversal.cpp		#102 Binary Tree Level Order Traversal.cpp
#1021 Remove Outermost Parentheses.cpp		#1021 Remove Outermost Parentheses.cpp
#1028 Recover a Tree From Preorder Traversal.cpp		#1028 Recover a Tree From Preorder Traversal.cpp
#1038 Binary Search Tree to Greater Sum Tree.cpp		#1038 Binary Search Tree to Greater Sum Tree.cpp
#104 Maximum Depth of Binary Tree.cpp		#104 Maximum Depth of Binary Tree.cpp
#105 Construct Binary Tree from Preorder and Inorder Traversal.cpp		#105 Construct Binary Tree from Preorder and Inorder Traversal.cpp
#1051 Height Checker.cpp		#1051 Height Checker.cpp
#106 Construct Binary Tree from Inorder and Postorder Traversal.cpp		#106 Construct Binary Tree from Inorder and Postorder Traversal.cpp
#107 Binary Tree Level Order Traversal II.cpp		#107 Binary Tree Level Order Traversal II.cpp
#1071 Greatest Common Divisor of Strings.cpp		#1071 Greatest Common Divisor of Strings.cpp
#108 Convert Sorted Array to Binary Search Tree.cpp		#108 Convert Sorted Array to Binary Search Tree.cpp
#109 Convert Sorted List to Binary Search Tree.cpp		#109 Convert Sorted List to Binary Search Tree.cpp
#11 Container with most water.cpp		#11 Container with most water.cpp
#110 Balanced Binary Tree.cpp		#110 Balanced Binary Tree.cpp
#1105 Filling Bookcase Shelves.cpp		#1105 Filling Bookcase Shelves.cpp
#1106. Parsing A Boolean Expression.cpp		#1106. Parsing A Boolean Expression.cpp
#1108 Defanging an IP Address.cpp		#1108 Defanging an IP Address.cpp
#111 Minimum Depth of Binary Tree.cpp		#111 Minimum Depth of Binary Tree.cpp
#1110 Delete Nodes And Return Forest.cpp		#1110 Delete Nodes And Return Forest.cpp
#112 Path Sum.cpp		#112 Path Sum.cpp
#1122 Relative Sort Array.cpp		#1122 Relative Sort Array.cpp
#1123 Lowest Common Ancestor of Deepest Leaves.cpp		#1123 Lowest Common Ancestor of Deepest Leaves.cpp
#114 Flatten Binary Tree to Linked List.cpp		#114 Flatten Binary Tree to Linked List.cpp
#1140. Stone Game II.cpp		#1140. Stone Game II.cpp
#116 Populating Next Right Pointers in Each Node.cpp		#116 Populating Next Right Pointers in Each Node.cpp
#1161 Maximum Level Sum of a Binary Tree.cpp		#1161 Maximum Level Sum of a Binary Tree.cpp
#118 Pascal's Triangle.cpp		#118 Pascal's Triangle.cpp
#1190 Reverse Substrings Between Each Pair of Parentheses.cpp		#1190 Reverse Substrings Between Each Pair of Parentheses.cpp
#12 Integer to Roman.cpp		#12 Integer to Roman.cpp
#1200 Minimum Absolute Difference.cpp		#1200 Minimum Absolute Difference.cpp
#122 Best Time to Buy and Sell Stock II.cpp		#122 Best Time to Buy and Sell Stock II.cpp
#123 Best Time to Buy and Sell Stock III.cpp		#123 Best Time to Buy and Sell Stock III.cpp
#1248 Count Number of Nice Subarrays.cpp		#1248 Count Number of Nice Subarrays.cpp
#1255 Maximum Score Words Formed by Letters.cpp		#1255 Maximum Score Words Formed by Letters.cpp
#1282 Group the People Given the Group Size They Belong To.cpp		#1282 Group the People Given the Group Size They Belong To.cpp
#129 Sum Root to Leaf Numbers.cpp		#129 Sum Root to Leaf Numbers.cpp
#1290 Convert Binary Number in a Linked List to Integer.cpp		#1290 Convert Binary Number in a Linked List to Integer.cpp
#1299 Replace Elements with Greatest Element on Right Side.cpp		#1299 Replace Elements with Greatest Element on Right Side.cpp
#13 Roman to Integer.cpp		#13 Roman to Integer.cpp
#1302 Deepest Leaves Sum.cpp		#1302 Deepest Leaves Sum.cpp
#1305 All Elements in Two Binary Search Trees.cpp		#1305 All Elements in Two Binary Search Trees.cpp
#1310. XOR Queries of a Subarray.cpp		#1310. XOR Queries of a Subarray.cpp
#1312 Minimum Insertion Steps to Make a String Palindrome.cpp		#1312 Minimum Insertion Steps to Make a String Palindrome.cpp
#1313 Decompress Run-Length Encoded List.cpp		#1313 Decompress Run-Length Encoded List.cpp
#1315 Sum of Nodes with Even-Valued Grandparent.cpp		#1315 Sum of Nodes with Even-Valued Grandparent.cpp
#1318 Minimum Flips to Make a OR b Equal to c.cpp		#1318 Minimum Flips to Make a OR b Equal to c.cpp
#1323 Maximum 69 Number.cpp		#1323 Maximum 69 Number.cpp
#1325 Delete Leaves With a Given Value.cpp		#1325 Delete Leaves With a Given Value.cpp
#1331. Rank Transform of an Array.cpp		#1331. Rank Transform of an Array.cpp
#1334 Find the City With the Smallest Number of Neighbors at a Threshold Distance.cpp		#1334 Find the City With the Smallest Number of Neighbors at a Threshold Distance.cpp
#1347 Minimum Number of Steps to Make Two Strings Anagram.cpp		#1347 Minimum Number of Steps to Make Two Strings Anagram.cpp
#136 Single Number.cpp		#136 Single Number.cpp
#1365 How Many Numbers Are Smaller Than the Current Number.cpp		#1365 How Many Numbers Are Smaller Than the Current Number.cpp
#1367. Linked List in Binary Tree.cpp		#1367. Linked List in Binary Tree.cpp
#137 Single Number.cpp		#137 Single Number.cpp
#1371. Find the Longest Substring Containing Vowels in Even Counts.cpp		#1371. Find the Longest Substring Containing Vowels in Even Counts.cpp
#1377 Frog Position After T Seconds.cpp		#1377 Frog Position After T Seconds.cpp
#1379 Find a Corresponding Node of a Binary Tree in a Clone of That Tree.cpp		#1379 Find a Corresponding Node of a Binary Tree in a Clone of That Tree.cpp
#1380 Lucky Numbers in a Matrix.cpp		#1380 Lucky Numbers in a Matrix.cpp
#1381. Design a Stack With Increment Operation.cpp		#1381. Design a Stack With Increment Operation.cpp
#1382 Balance a Binary Search Tree.cpp		#1382 Balance a Binary Search Tree.cpp
#1389 Create Target Array in the Given Order.cpp		#1389 Create Target Array in the Given Order.cpp
#1395 Count Number of Teams.cpp		#1395 Count Number of Teams.cpp
#14 Longest Common Prefix.cpp		#14 Longest Common Prefix.cpp
#141 Linked List Cycle.cpp		#141 Linked List Cycle.cpp
#1431 Kids With the Greatest Number of Candies.cpp		#1431 Kids With the Greatest Number of Candies.cpp
#144 Binary Tree Preorder Traversal.cpp		#144 Binary Tree Preorder Traversal.cpp
#1441 Build an Array With Stack Operations.cpp		#1441 Build an Array With Stack Operations.cpp
#1448 Count Good Nodes in Binary Tree.cpp		#1448 Count Good Nodes in Binary Tree.cpp
#145 Binary Tree Postorder Traversal.cpp		#145 Binary Tree Postorder Traversal.cpp
#1450 Number of Students Doing Homework at a Given Time.cpp		#1450 Number of Students Doing Homework at a Given Time.cpp
#1460 Make Two Arrays Equal by Reversing Subarrays.cpp		#1460 Make Two Arrays Equal by Reversing Subarrays.cpp
#1464 Maximum Product of Two Elements in an Array.cpp		#1464 Maximum Product of Two Elements in an Array.cpp
#1470 Shuffle the Array.cpp		#1470 Shuffle the Array.cpp
#1472 Design Browser History.cpp		#1472 Design Browser History.cpp
#1475 Final Prices With a Special Discount in a Shop.cpp		#1475 Final Prices With a Special Discount in a Shop.cpp
#1476 Subrectangle Queries.cpp		#1476 Subrectangle Queries.cpp
#148 Sort List.cpp		#148 Sort List.cpp
#1480 Running Sum of 1d Array.cpp		#1480 Running Sum of 1d Array.cpp
#15 3Sum.cpp		#15 3Sum.cpp
#1508 Range Sum of Sorted Subarray Sums.cpp		#1508 Range Sum of Sorted Subarray Sums.cpp
#1509 Minimum Difference Between Largest and Smallest Value in Three Moves.cpp		#1509 Minimum Difference Between Largest and Smallest Value in Three Moves.cpp
#151 Reverse Words in a String.cpp		#151 Reverse Words in a String.cpp
#1512 Number of Good Pairs.cpp		#1512 Number of Good Pairs.cpp
#1514. Path with Maximum Probability.cpp		#1514. Path with Maximum Probability.cpp
#1518 Water Bottles.cpp		#1518 Water Bottles.cpp
#153 Find Minimum in Rotated Sorted Array.cpp		#153 Find Minimum in Rotated Sorted Array.cpp
#1530 Number of Good Leaf Nodes Pairs.cpp		#1530 Number of Good Leaf Nodes Pairs.cpp
#154 Find Minimum in Rotated Sorted Array II.cpp		#154 Find Minimum in Rotated Sorted Array II.cpp
#1545. Find Kth Bit in Nth Binary String.cpp		#1545. Find Kth Bit in Nth Binary String.cpp
#1550 Three Consecutive Odds.cpp		#1550 Three Consecutive Odds.cpp
#1557 Minimum Number of Vertices to Reach All Nodes.cpp		#1557 Minimum Number of Vertices to Reach All Nodes.cpp
#1568. Minimum Number of Days to Disconnect Island.cpp		#1568. Minimum Number of Days to Disconnect Island.cpp
#1572 Matrix Diagonal Sum.cpp		#1572 Matrix Diagonal Sum.cpp
#1584 Min Cost to Connect All Points.cpp		#1584 Min Cost to Connect All Points.cpp
#1588 Sum of All Odd Length Subarrays.cpp		#1588 Sum of All Odd Length Subarrays.cpp

InflixOP/LeetCode

Folders and files

Latest commit

History

Repository files navigation

LeetCode

Space and Time Complexity

Time Complexity

Space Complexity

Big-O Notation

Comparison of C++, Java, and Python for Data Structures and Algorithms (DSA)

C++

Java

Python

Summary

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Contributors 2

Languages

Packages