Camel-Case Validation Function | Dataford Interview Questions

PayPay India test tooling receives an identifier and the ordered words it should contain. Write a function that returns True only when the identifier follows the required camel-case pattern exactly.

The first word must appear entirely in lowercase. Every later word must begin with an uppercase letter followed by its remaining lowercase letters. The identifier must contain all words in the given order, with no missing, extra, or rearranged characters.

Formal Specification

Implement validate_camel_case(s, words).

s is a string containing the candidate identifier.
words is a non-empty array of non-empty lowercase English words.
Return a boolean: True if s is exactly the camel-case concatenation of words, otherwise False.
Do not use regular expressions. The solution should compare characters directly.

Constraints

1 <= len(words) <= 10^4
1 <= len(word) <= 100 for every word
1 <= len(s) <= 10^6
Words contain only lowercase English letters
The total number of characters in words is at most 10^6

Function Signature

def validate_camel_case(s, words):

Your question is Camel-Case Validation Function. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem