GitHub - vinleopacs/prog-II-prep: (I passed!) Note: Programs were not written elegantly. This is only an implementation of the algos used. This is just about linked lists (SLL in particular, arrays being converted into linked lists) featuring my own algos for each program. This serves as my preparation for the upcoming examination which will be held at the 17th day of January 2023.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 85 Commits
.vscode		.vscode
(2nd-v) CC-Missing-data.c		(2nd-v) CC-Missing-data.c
CC-Insert-Ordered.c		CC-Insert-Ordered.c
CC-Insert-Remove-Duplicates.c		CC-Insert-Remove-Duplicates.c
CC-Missing-data.c		CC-Missing-data.c
CC-Same-Diff-of-height.c		CC-Same-Diff-of-height.c
CC-Same-Diff-of-height.exe		CC-Same-Diff-of-height.exe
Data-search.c		Data-search.c
First common element.c		First common element.c
If 2 LL equal or not.c		If 2 LL equal or not.c
Smallest positive data (sorted).c		Smallest positive data (sorted).c
[10] Separating even and odd.c		[10] Separating even and odd.c
[11] Sort (Ascending).c		[11] Sort (Ascending).c
[12] Sort (Descending).c		[12] Sort (Descending).c
[14] Insert new node.c		[14] Insert new node.c
[15] Delete element at nth position.c		[15] Delete element at nth position.c
[16] Second largest element.c		[16] Second largest element.c
[17] Second smallest element.c		[17] Second smallest element.c
[2nd-v] CC-Insert-Remove-Duplicates.c		[2nd-v] CC-Insert-Remove-Duplicates.c
[32] (2nd-v) Pair of given sum.c		[32] (2nd-v) Pair of given sum.c
[32] Pair of given sum.c		[32] Pair of given sum.c
[33] Majority element.c		[33] Majority element.c
[34] Odd number freq.c		[34] Odd number freq.c
[35] Largest sum of contiguous sublist.c		[35] Largest sum of contiguous sublist.c
[36] (2nd-v) Find missing data MODIFIED.c		[36] (2nd-v) Find missing data MODIFIED.c
[36] Find missing data.c		[36] Find missing data.c
[39] (MODIFIED) Rotating list by n positions.c		[39] (MODIFIED) Rotating list by n positions.c
[39] Rotate by n positions.c		[39] Rotate by n positions.c
[42] Smallest missing data.c		[42] Smallest missing data.c
[43] (2nd-v) Next bigger numbers.c		[43] (2nd-v) Next bigger numbers.c
[43] Next bigger elements.c		[43] Next bigger elements.c
[44] Find 2 repeating data.c		[44] Find 2 repeating data.c
[45] (2nd-v) Two data whose sum is close to zero.c		[45] (2nd-v) Two data whose sum is close to zero.c
[45] Finding two data whose sum is closest to zero.c		[45] Finding two data whose sum is closest to zero.c
[46] (2nd-v) Smallest positive num.c		[46] (2nd-v) Smallest positive num.c
[46] Smallest positive data (unsorted).c		[46] Smallest positive data (unsorted).c
[48] Data searched repeating more than nslash2 times.c		[48] Data searched repeating more than nslash2 times.c
[49] (Modified) Majority Elem.c		[49] (Modified) Majority Elem.c
[4] Copy contents of the first LL to the second LL.c		[4] Copy contents of the first LL to the second LL.c
[53] Freq of the given data.c		[53] Freq of the given data.c
[54] Sorting 0s, 1s, 2s.c		[54] Sorting 0s, 1s, 2s.c
[55] Determining if list is a subset of another list.c		[55] Determining if list is a subset of another list.c
[58] Move zeroes to the end.c		[58] Move zeroes to the end.c
[5] (Modified) Count total number of duplicates.c		[5] (Modified) Count total number of duplicates.c
[5] Count total number of duplicates.c		[5] Count total number of duplicates.c
[64] (2nd-v) Median of two sorted arrays.c		[64] (2nd-v) Median of two sorted arrays.c
[64] (2nd-v) Median of two sorted arrays.exe		[64] (2nd-v) Median of two sorted arrays.exe
[64] Median of 2 lists (n1==n2).c		[64] Median of 2 lists (n1==n2).c
[69] (+)Max diff of two data (small-large).c		[69] (+)Max diff of two data (small-large).c
[6] Print unique elements.c		[6] Print unique elements.c
[70] Data occurs odd times.c		[70] Data occurs odd times.c
[71] (2nd-v) Median of two sorted arrays (n1!=n2).c		[71] (2nd-v) Median of two sorted arrays (n1!=n2).c
[71] Median of 2 lists(n1!=n2, n1==n2).c		[71] Median of 2 lists(n1!=n2, n1==n2).c
[73] (2nd-v)Print unique data.c		[73] (2nd-v)Print unique data.c
[7] Merge two LL and print in descending.c		[7] Merge two LL and print in descending.c
[80] Number of distinct pairs.c		[80] Number of distinct pairs.c
[81] Maximum repeating num.c		[81] Maximum repeating num.c
[83] Find pair with given diff.c		[83] Find pair with given diff.c
[8] Frequency of each data.c		[8] Frequency of each data.c
[97] Position of peak data.c		[97] Position of peak data.c
[9] Min and max.c		[9] Min and max.c

About

(I passed!) Note: Programs were not written elegantly. This is only an implementation of the algos used. This is just about linked lists (SLL in particular, arrays being converted into linked lists) featuring my own algos for each program. This serves as my preparation for the upcoming examination which will be held at the 17th day of January 2023.