Skip to content
/ Data-in-Structure Public

Data Structures and Algorithms problems from Leetcodes are stored here for reference as i dont forget these concepts.

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

rawwmen/Data-in-Structure

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

42 Commits
0078-subsets
0078-subsets
 
 
0125-valid-palindrome
0125-valid-palindrome
 
 
0167-two-sum-ii-input-array-is-sorted
0167-two-sum-ii-input-array-is-sorted
 
 
shellsort.cpp#include <iostream> using namespace std; void ShellSort(int arr[], int n) { for (int gap = n / 2; gap > 0; gap /= 2) { for (int i = gap; i < n; i++) { int temp = arr[i]; int j = i; for (j = i; j >= gap && arr[j - gap] > temp; j -= gap) { arr[j] = arr[j - gap]; } arr[j] = temp; } } } void print(int arr[], int n) { for (int i = 0; i < n; i++) { cout << arr[i] << " "; } } int main() { int arr[] = {20, 35, -15, 7, 55, 1, -22}; int n = sizeof(arr)
shellsort.cpp#include <iostream> using namespace std; void ShellSort(int arr[], int n) { for (int gap = n / 2; gap > 0; gap /= 2) { for (int i = gap; i < n; i++) { int temp = arr[i]; int j = i; for (j = i; j >= gap && arr[j - gap] > temp; j -= gap) { arr[j] = arr[j - gap]; } arr[j] = temp; } } } void print(int arr[], int n) { for (int i = 0; i < n; i++) { cout << arr[i] << " "; } } int main() { int arr[] = {20, 35, -15, 7, 55, 1, -22}; int n = sizeof(arr)
 
 
Add two Numbers.cpp
Add two Numbers.cpp
 
 
Classes.cpp
Classes.cpp
 
 
Container with most water.cpp
Container with most water.cpp
 
 
Contains Duplicates.java
Contains Duplicates.java
 
 
Cyclic Sort.cpp
Cyclic Sort.cpp
 
 
Four sum.cpp
Four sum.cpp
 
 
Generate Parenthesis.java
Generate Parenthesis.java
 
 
InsertionSort.cpp
InsertionSort.cpp
 
 
Merge sorted list.java
Merge sorted list.java
 
 
MinMaxRecursion.cpp
MinMaxRecursion.cpp
 
 
Phone Number.cpp
Phone Number.cpp
 
 
README.md
README.md
 
 
Radixsorting.cpp
Radixsorting.cpp
 
 
Regular Expression Matching.cpp
Regular Expression Matching.cpp
 
 
Remove Elements.cpp
Remove Elements.cpp
 
 
Reverse integer.cpp
Reverse integer.cpp
 
 
Roman Interger.cpp
Roman Interger.cpp
 
 
Search insert positon.cpp
Search insert positon.cpp
 
 
String to Integer.cpp
String to Integer.cpp
 
 
StringSort.cpp
StringSort.cpp
 
 
Third Max.cpp
Third Max.cpp
 
 
Three sum closest.cpp
Three sum closest.cpp
 
 
Two sum.cpp
Two sum.cpp
 
 
longest substring.cpp
longest substring.cpp
 
 
paalindrome.cpp
paalindrome.cpp
 
 
power of 3.cpp
power of 3.cpp
 
 
searchinRange.cpp
searchinRange.cpp
 
 
semi sort.cpp
semi sort.cpp
 
 
single number.cpp
single number.cpp
 
 
stats.json
stats.json
 
 

Repository files navigation

About

Data Structures and Algorithms problems from Leetcodes are stored here for reference as i dont forget these concepts.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages