Skip to main content

How would you design a stack which, in addition to push and pop, also has a function min which returns the minimum element? Push,pop and min should all operate in O(1) time.

File:StackBox.java
---------------------------------------------------------------------------------------------------
package org.developersbrain.solutions;

class Student{
String studentName;
int   totalMarks;
String grade;

Student(String studentName,int totalMarks,String grade){
this.studentName = studentName;
this.totalMarks  = totalMarks;
this.grade       = grade;
}

public int hashCode(){
return totalMarks;
}

public String toString(){
System.out.println("Student Name :"+this.studentName);
System.out.println("Total Marks :"+this.totalMarks);
System.out.println("Grade :"+this.grade);
System.out.println();
System.out.println("-------------------------------------------");
return "";
}
}

class StackNode<ELEMENT>{
StackNode<ELEMENT> next;
ELEMENT e;
    ELEMENT min;
StackNode(ELEMENT e){
this.e = e;
next = null;
}
}
public class StackBox<ELEMENT> {
StackNode<ELEMENT> top;

StackBox(){
top=null;
}

void push(ELEMENT e){
StackNode<ELEMENT> snode=new StackNode<ELEMENT>(e);
if(top==null){
top = snode;
top.min=top.e;
}else{
if(snode.e.hashCode()<top.min.hashCode()){
snode.min=snode.e;
}else{
snode.min=top.min;
}
snode.next =top;
top=snode;
}
}

void pop(){
StackNode<ELEMENT> pNode=top;
if(pNode==null){
System.out.println("Stack Empty!");
}else{
System.out.println(pNode.e.toString());
top=top.next;
}
}

void min(){
System.out.println(top.min.toString());
}

void printStack(){
StackNode<ELEMENT> pNode=top;
while(pNode!=null){
pNode.e.toString();
pNode=pNode.next;
}
}
}

File:MainClass.java
-----------------------------------------------------------------------------------------
package org.developersbrain.solutions;

import java.io.IOException;

public class MainClass {
public static void main(String[] args) throws IOException{
StackBox<Student> sb=new StackBox<Student>();
sb.push(new Student("Student1",400,"B"));
sb.push(new Student("Student2",450,"A"));
sb.push(new Student("Student3",420,"B"));
sb.push(new Student("Student4",440,"B"));
sb.push(new Student("Student5",460,"A"));
System.out.println("Print Stack elements");
System.out.println("---------------------------------------------");
sb.printStack();
System.out.println();
System.out.println("Student Who scored the least score");
System.out.println("---------------------------------------------");
sb.min();
}
}

Program Output:
------------------------------------------------------------------------------------------------
Print Stack elements
---------------------------------------------
Student Name :Student5
Total Marks :460
Grade :A

-------------------------------------------
Student Name :Student4
Total Marks :440
Grade :B

-------------------------------------------
Student Name :Student3
Total Marks :420
Grade :B

-------------------------------------------
Student Name :Student2
Total Marks :450
Grade :A

-------------------------------------------
Student Name :Student1
Total Marks :400
Grade :B

-------------------------------------------

Student Who scored the least score
---------------------------------------------
Student Name :Student1
Total Marks :400
Grade :B

-------------------------------------------

Comments

Post a Comment

Popular posts from this blog

CODILITY: Determine whether given string of parentheses is properly nested.

Task description A string S consisting of N characters is called  properly nested  if: S is empty; S has the form " (U) " where U is a properly nested string; S has the form " VW " where V and W are properly nested strings. For example, string " (()(())()) " is properly nested but string " ()) " isn't. Write a function: class Solution { public int solution(String S); } that, given a string S consisting of N characters, returns 1 if string S is properly nested and 0 otherwise. For example, given S = " (()(())()) ", the function should return 1 and given S = " ()) ", the function should return 0, as explained above. Assume that: N is an integer within the range [ 0 .. 1,000,000 ]; string S consists only of the characters " ( " and/or " ) ". Complexity: expected worst-case time complexity is O(N); expected worst-case space complexity is O(1) (not counting the storage requi...
1 comment
Read more

Distinct: Compute number of distinct values in an array.

Task description Write a function class Solution { public int solution(int[] A); } that, given a zero-indexed array A consisting of N integers, returns the number of distinct values in array A. Assume that: N is an integer within the range [ 0 .. 100,000 ]; each element of array A is an integer within the range [ −1,000,000 .. 1,000,000 ]. For example, given array A consisting of six elements such that: A[0] = 2 A[1] = 1 A[2] = 1 A[3] = 2 A[4] = 3 A[5] = 1 the function should return 3, because there are 3 distinct values appearing in array A, namely 1, 2 and 3. Complexity: expected worst-case time complexity is O(N*log(N)); expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments). Elements of input arrays can be modified. class Solution { public int solution ( int [] A) { // write your code in Java SE 8 int len=A.length; int count= 1 ; ...
1 comment
Read more

Dominator: Find an index of an array such that its value occurs at more than half of indices in the array.

Dominator Find an index of an array such that its value occurs at more than half of indices in the array. Task description A zero-indexed array A consisting of N integers is given. The dominator  of array A is the value that occurs in more than half of the elements of A. For example, consider array A such that A[0] = 3 A[1] = 4 A[2] = 3 A[3] = 2 A[4] = 3 A[5] = -1 A[6] = 3 A[7] = 3 The dominator of A is 3 because it occurs in 5 out of 8 elements of A (namely in those with indices 0, 2, 4, 6 and 7) and 5 is more than a half of 8. Write a function class Solution { public int solution(int[] A); } that, given a zero-indexed array A consisting of N integers, returns index of any element of array A in which the dominator of A occurs. The function should return −1 if array A does not have a dominator. Assume that: N is an integer within the range [ 0 .. 100,000 ]; each element of array A is an integer within the range [ −2,147,483,648 .. 2,147,483...
Post a Comment
Read more