JobsJob TrackerJob alerts

Cerner · 16 questions

All 16Coding 13Low-Level Design 1
  • Choose 4 Numbers from Unsorted Array with Zero SumCoding
  • Difference between malloc and newLow-Level Design
  • Find middle node of linked listCoding
  • Reverse Words in a SentenceCoding
  • Palindrome Number ProcessCoding
  • Ransomware and Cybersecurity in Healthcare
  • Components of System.out.println
  • First number divisible by 7Coding
  • Swap two numbers without extra spaceCoding
  • Count number of palindromes in a string of stringsCoding
  • Parenthesis CheckerCoding
  • Rotate ArrayCoding
  • Find the missing and repeating numberCoding
  • Mirror TreeCoding
  • Find the number of islandsCoding
  • Longest Common Prefix and Stack ImplementationCoding
← Cerner questions
  1. Interview questions
  2. Cerner
  3. Longest Common Prefix and Stack Implementation
Coding

Longest Common Prefix and Stack Implementation

Filed under Cerner

The question

Find the longest common prefix of an array of strings with an optimized approach by sorting and comparing first and last elements. Implement a stack data structure with push, pop, peek, and empty functions, and answer basic binary tree questions.

No write-up yet. Related questions below have one.

Related Cerner questions

  • Choose 4 Numbers from Unsorted Array with Zero Sum
  • Palindrome Number Process
  • First number divisible by 7
  • Count number of palindromes in a string of strings
  • Parenthesis Checker
← Find the number of islands

Collected from public candidate posts and coding forums. Updated Nov 2026.