This is a Leet Code problem (1578 – Minimum Deletion Cost to Avoid Repeating Letters) solved in Java, the problem description is:
Given a string s and an array of integers cost where cost[i] is the cost of deleting the ith character in s.
Category: Java Qs
Remove Duplicates from Sorted Array
This is a Leet Code problem solved in Java, the problem description is:
Difference between Synchronized & Volatile in Java
volatile keyword in Java is field modifier while synchronized modifies code blocks and methods. synchronized acquires and releases locks on entire code block or method
Javascript Hoisting : Function Hoisting
In Previous article, We have looked into how Javascript Hoisting works. Hoisting is Javascript’s default behavior of moving declarations to top of the file. There
How to access REF CURSOR Data in Java ?
In Java, a REF CURSOR is known as a ResultSet object and can be accessed as shown below: import oracle.jdbc.*; … CallableStatement cstmt; ResultSet cursor; // Use a PL/SQL block
Convert List to a Set / Set to List in Java
In Java, When we are working on real time projects.. Generally we came across scenarios like Converting List to Set Object or Vice Versa. 1.
Swipe 2 Numbers without using Third Variable or Temp Variable | Interview question
While giving interviews, Interviewers generally asks questions which tests logical thinking of candidate. This is one of the questions I faced while giving Interviews. There
JAR vs. WAR vs. EAR
In J2EE application modules are packaged as EAR, JAR and WAR based on their functionality JAR: EJB modules which contains enterprise java beans class