📘 DSA Solutions – SKCET Placement Portal

This repository contains my C++ solutions to coding problems from the SKCET Placement Portal.
Each file corresponds to a single question, focusing on Data Structures and Algorithms (DSA) commonly asked in coding interviews and placement tests.

🚀 Features

Written in C++17
Covers core DSA topics:
- Arrays & Strings
- Linked Lists
- Stacks & Queues
- Trees & Binary Search Trees
- Graph Algorithms
- Dynamic Programming
- Greedy Algorithms
- Searching & Sorting
Focuses on time and space efficiency
Directly runnable on coding platforms and compilers

🛠️ How to Run

Clone the repository:

git clone https://github.com/TheQber/DSA-CPP-codes.git
cd DSA-CPP-codes

Compile and run any file:

g++ filename.cpp -o output
./output

🎯 Purpose

This repo serves as:

My personal practice log for DSA.
A quick reference for revising interview problems.
A resource for peers preparing for placements and technical interviews.

📌 Notes

Solutions are tailored for placement.skcet.ac.in test cases.
Naming conventions follow problem statements for easy lookup.
Some problems may have multiple approaches (brute force vs. optimized).

📬 Contributions

If you are from SKCET (or elsewhere) and solving similar problems, feel free to:

Suggest optimizations
Add alternate approaches
Improve documentation

🧑‍💻 Author

Abdullah
🎓 Student | Aspiring Engineer
🔗 GitHub

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

📘 DSA Solutions – SKCET Placement Portal

🚀 Features

🛠️ How to Run

🎯 Purpose

📌 Notes

📬 Contributions

🧑‍💻 Author

About

Uh oh!

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 13 Commits
2 sum problem (hashing session 2).cpp		2 sum problem (hashing session 2).cpp
Add id and names using hashing and search for name using ID.cpp		Add id and names using hashing and search for name using ID.cpp
All operations on singly linked list.cpp		All operations on singly linked list.cpp
BFS traversal and print (unspecified edge count) (Graph traversal PAH).cpp		BFS traversal and print (unspecified edge count) (Graph traversal PAH).cpp
BFS traversal and print from specified node (unspecified edge count) (Graph traversal PAH).cpp		BFS traversal and print from specified node (unspecified edge count) (Graph traversal PAH).cpp
BFS traversal and print of nodes.cpp		BFS traversal and print of nodes.cpp
BST insertion and postorder print of characters.cpp		BST insertion and postorder print of characters.cpp
BST populate and inorder print with delete values.cpp		BST populate and inorder print with delete values.cpp
BST with insert and delete nodes.cpp		BST with insert and delete nodes.cpp
Binary tree populate and search for value.cpp		Binary tree populate and search for value.cpp
Closest value lesser than or equal to target.cpp		Closest value lesser than or equal to target.cpp
DeleteValueAtPositionInDoublyLinkedList.cpp		DeleteValueAtPositionInDoublyLinkedList.cpp
Find element in array, and print sum and average of array.cpp		Find element in array, and print sum and average of array.cpp
Find element occuring twice.cpp		Find element occuring twice.cpp
Find max path sum in tree.cpp		Find max path sum in tree.cpp
Find maximum subarray with target sum (only 1 testcase pass).cpp		Find maximum subarray with target sum (only 1 testcase pass).cpp
Find value that occurs odd number of times (Hashing DC).cpp		Find value that occurs odd number of times (Hashing DC).cpp
Finding number of roads to be added for Lena (graphs - CY).cpp		Finding number of roads to be added for Lena (graphs - CY).cpp
Insert and delete values from list (ridiculous printing format).cpp		Insert and delete values from list (ridiculous printing format).cpp
InsertValueAtPosition.cpp		InsertValueAtPosition.cpp
Level order populate and inorder traversal of tree.cpp		Level order populate and inorder traversal of tree.cpp
README.md		README.md
Second occurence of key.cpp		Second occurence of key.cpp
Specified iteration of BFS traversal and print nodes from first node (unspecified).cpp		Specified iteration of BFS traversal and print nodes from first node (unspecified).cpp
Word transformation game (find shortest path between start and target) (Graph traversal PAH).cpp		Word transformation game (find shortest path between start and target) (Graph traversal PAH).cpp
add, remove players and rotate list (nightmare question).cpp		add, remove players and rotate list (nightmare question).cpp
add,remove,delete nodes.cpp		add,remove,delete nodes.cpp
adjacency matrix (header, middle code and footer).cpp		adjacency matrix (header, middle code and footer).cpp
basic stack implementation using array template.cpp		basic stack implementation using array template.cpp
bucket sort (for book titles question).cpp		bucket sort (for book titles question).cpp
calculate and print hash value based on string (hashing session 2).cpp		calculate and print hash value based on string (hashing session 2).cpp
cgpa and stuff question (no testcase pass but its correct answer fuck this shit).cpp		cgpa and stuff question (no testcase pass but its correct answer fuck this shit).cpp
check brackets validity using stack.cpp		check brackets validity using stack.cpp
check common elements of 2 arrays (hashing PAH).cpp		check common elements of 2 arrays (hashing PAH).cpp
check if list is palindrome.cpp		check if list is palindrome.cpp
check if word is in sentence (searching-CY).cpp		check if word is in sentence (searching-CY).cpp
checkout queue question.cpp		checkout queue question.cpp
classify graph as strongly, weakly, unilaterally and print.cpp		classify graph as strongly, weakly, unilaterally and print.cpp
delete last value in list.cpp		delete last value in list.cpp
dequeue and enqueue based on priority.cpp		dequeue and enqueue based on priority.cpp
double hashing (hashing session 3).cpp		double hashing (hashing session 3).cpp
evaluate postfix expression with header and footer.cpp		evaluate postfix expression with header and footer.cpp
evaluate postfix expression.cpp		evaluate postfix expression.cpp
find count of elements and increment in value - count pair (hashing PAH).cpp		find count of elements and increment in value - count pair (hashing PAH).cpp
find first and last occurence of number in array.cpp		find first and last occurence of number in array.cpp
find fruit based on index (hashing session 1).cpp		find fruit based on index (hashing session 1).cpp
find largest rectangle in histogram.cpp		find largest rectangle in histogram.cpp
find maximum flow in graph using Ford-Fulkerson algorithm.cpp		find maximum flow in graph using Ford-Fulkerson algorithm.cpp
find maximum nested envelopes.cpp		find maximum nested envelopes.cpp
find median of sorted list using merge sort.cpp		find median of sorted list using merge sort.cpp
find middle value in list - alternate.cpp		find middle value in list - alternate.cpp
find middle value in list.cpp		find middle value in list.cpp
find minimum value in stack.cpp		find minimum value in stack.cpp
find n closest numbers to given target from given array (searching- daily challenge).cpp		find n closest numbers to given target from given array (searching- daily challenge).cpp
find number of connected networks in graph (graphs - DC).cpp		find number of connected networks in graph (graphs - DC).cpp
find number of elements greater than median.cpp		find number of elements greater than median.cpp
find number of elements greater than mentor.cpp		find number of elements greater than mentor.cpp
find number of groups in character array.cpp		find number of groups in character array.cpp
infix to postfix using stack.cpp		infix to postfix using stack.cpp
insertion sort with each iteration.cpp		insertion sort with each iteration.cpp
interleaving first and second half of list.cpp		interleaving first and second half of list.cpp
iterate over list of strings.cpp		iterate over list of strings.cpp
mark edges of directed graph and print as list of connections (graph session 3).cpp		mark edges of directed graph and print as list of connections (graph session 3).cpp
merge sort (not actually, but it works).cpp		merge sort (not actually, but it works).cpp
number of islands (graph traversal PAH).cpp		number of islands (graph traversal PAH).cpp
parking spot queue.cpp		parking spot queue.cpp
preorder population and postorder print.cpp		preorder population and postorder print.cpp
print SCC based on adjacency matrix.cpp		print SCC based on adjacency matrix.cpp
print abcdef with hyphens.cpp		print abcdef with hyphens.cpp
print adjacency matrix as list of connections (HMF)(ab ae bc bd be cd de question).cpp		print adjacency matrix as list of connections (HMF)(ab ae bc bd be cd de question).cpp
print adjacency matrix as list of connections (header, middle code, footer).cpp		print adjacency matrix as list of connections (header, middle code, footer).cpp
print inorder traversal of characters.cpp		print inorder traversal of characters.cpp
print job processing queue.cpp		print job processing queue.cpp
print list in forward and reverse.cpp		print list in forward and reverse.cpp
print max value in list.cpp		print max value in list.cpp
print person with most votes (Hashing DC).cpp		print person with most votes (Hashing DC).cpp
print postorder predecessor (only 3 testcase pass, wasted 4 hours on this fuck this shit).cpp		print postorder predecessor (only 3 testcase pass, wasted 4 hours on this fuck this shit).cpp
print tree in postorder, preorder and inorder.cpp		print tree in postorder, preorder and inorder.cpp
printNodeDeleteHeadPrintDeleteTailPrint.cpp		printNodeDeleteHeadPrintDeleteTailPrint.cpp
priority queue based on priority and deadline.cpp		priority queue based on priority and deadline.cpp
priority queue using linkedlist.cpp		priority queue using linkedlist.cpp
queue implementation with header and footer (ticketIDs question).cpp		queue implementation with header and footer (ticketIDs question).cpp
quick sorting and printing each iteration.cpp		quick sorting and printing each iteration.cpp
remove duplicates in list.cpp		remove duplicates in list.cpp
remove duplicates in string using linkedlist.cpp		remove duplicates in string using linkedlist.cpp
remove first node.cpp		remove first node.cpp
remove node at position.cpp		remove node at position.cpp
reverse a queue.cpp		reverse a queue.cpp
reverse sentence with words in original order.cpp		reverse sentence with words in original order.cpp
rotate list by specified number.cpp		rotate list by specified number.cpp
search for array of numbers within another array.cpp		search for array of numbers within another array.cpp
selection sort of integers (height order of students question).cpp		selection sort of integers (height order of students question).cpp
selection sort of strings.cpp		selection sort of strings.cpp
selection sort with header and footer.cpp		selection sort with header and footer.cpp
shelf using stack question.cpp		shelf using stack question.cpp
simple bubble sort.cpp		simple bubble sort.cpp
simple integer search within array.cpp		simple integer search within array.cpp
sliding window (hashing session 3).cpp		sliding window (hashing session 3).cpp
sort array of ID and int (Hashing PAH).cpp		sort array of ID and int (Hashing PAH).cpp
sort barcodes.cpp		sort barcodes.cpp

TheQber/DSA-CPP-codes

Folders and files

Latest commit

History

Repository files navigation

📘 DSA Solutions – SKCET Placement Portal

🚀 Features

🛠️ How to Run

🎯 Purpose

📌 Notes

📬 Contributions

🧑‍💻 Author

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages