Nitin Agrawal
Contact -
  • Home
  • Interviews
    • Secret Receipe
    • InterviewFacts
    • Resume Thoughts
    • Daily Coding Problems
    • BigShyft
    • CompanyInterviews >
      • InvestmentBanks >
        • ECS
        • Bank Of America
        • WesternUnion
        • WellsFargo
      • ProductBasedCompanies >
        • CA Technologies
        • Model N India
        • Verizon Media
        • Oracle & GoJek
        • IVY Computec
        • Nvidia
        • ClearWaterAnalytics
        • ADP
        • ServiceNow
        • Pubmatic
        • Expedia
        • Amphora
        • CDK Global
        • CDK Global
        • Epic
        • Sincro-Pune
        • Whiz.AI
        • ChargePoint
      • ServiceBasedCompanies >
        • Altimetrik
        • ASG World Wide Pvt Ltd
        • Paraxel International & Pramati Technologies Pvt Ltd
        • MitraTech
        • Intelizest Coding Round
        • EPAM
    • Interviews Theory
  • Programming Languages
    • Java Script >
      • Tutorials
      • Code Snippets
    • Reactive Programming >
      • Code Snippets
    • R
    • DataStructures >
      • LeetCode Problems
      • AnagramsSet
    • Core Java >
      • Codility
      • Program Arguments OR VM arguments & Environment variables
      • Java Releases
      • Threading >
        • ThreadsOrder
        • ProducerConsumer
        • Finalizer
        • RaceCondition
        • Executors
        • Future Or CompletableFuture
      • Important Points
      • Immutability
      • Dictionary
      • URL Validator
    • Julia
    • Python >
      • Decorators
      • String Formatting
      • Generators_Threads
      • JustLikeThat
    • Go >
      • Tutorial
      • CodeSnippet
      • Go Routine_Channel
      • Suggestions
    • Methodologies & Design Patterns >
      • Design Principles
      • Design Patterns >
        • TemplatePattern
        • Adapter Design Pattern
        • Decorator
        • Proxy
        • Lazy Initialization
        • CombinatorPattern
        • RequestChaining
        • Singleton >
          • Singletons
  • Frameworks
    • Apache Velocity
    • Spring >
      • Spring Boot >
        • CustomProperties
        • ExceptionHandling
        • Issues
      • Quick View
    • Rest WebServices >
      • Interviews
      • Swagger
    • Cloudera BigData >
      • Ques_Ans
      • Hive
      • Apache Spark >
        • ApacheSpark Installation
        • SparkCode
        • Sample1
        • DataFrames
        • RDDs
        • SparkStreaming
        • SparkFiles
    • Integration >
      • Apache Camel
    • Testing Frameworks >
      • JUnit >
        • JUnit Runners
      • EasyMock
      • Mockito >
        • Page 2
      • TestNG
    • Blockchain >
      • Ethereum Smart Contract
      • Blockchain Java Example
    • Microservices >
      • Messaging Formats
      • Design Patterns
    • AWS >
      • Honeycode
    • Dockers >
      • GitBash
      • Issues
  • Databases
    • MySql
    • Oracle >
      • Interview1
      • SQL Queries
    • Elastic Search
  • Random issues
    • TOAD issue
    • Architect's suggestions
  • Your Views

Interview question asked in ServiceNow interview to a person

Question : Concatenate the number 9, 90,900, 110,11,45 in a way that you will get the highest number out of it. (9909004511110)
Code : Below is the code for that. I have not tested it properly but should work, if it fails for any case please let me know -

import java.util.Arrays;
import java.util.Comparator;
public class ServiceNow2 implements Comparator<String>{
 
// public static Integer[] nums = {9,90,900,45,110,11};
 public static Integer[] nums = {8, 100, 22, 101, 77};
 
 public static void main(String[] args) {
  String[] sorted = new String[nums.length];
  int i = 0;
  for(int num : nums) {
   String str = Integer.toString(num);
   sorted[i] = str;
   i++;
  }
  Arrays.sort(sorted);
  Arrays.sort(sorted, new ServiceNow2());
  String result = "";
  for(String str : sorted) {
   result = result + str;
  }
  System.out.println(result);
 }
 @Override
 public int compare(String curr, String next) {
  int i = 0;
  int j = 0;
  while(i <= curr.length()-1 && j <= next.length()-1) {
   if(curr.charAt(i) > next.charAt(j)) {
    return -1;
   } else if(curr.charAt(i) < next.charAt(j)) {
    return 1;
   }
   i++;
   j++;
  }
  if(curr.length() > next.length()) {
   return 1;
  }
  return 0;
 }
}​
Powered by Create your own unique website with customizable templates.